TSTP Solution File: SYN969+1 by E-SAT---3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.0
% Problem  : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 22:21:49 EDT 2022

% Result   : Theorem 0.20s 0.46s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   13 (   4 unt;   4 typ;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   25 (   8   ~;   4   |;   5   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    p: $i > $o ).

tff(decl_23,type,
    q: $i > $o ).

tff(decl_24,type,
    r: $i > $o ).

tff(decl_25,type,
    esk1_0: $i ).

fof(prove_this,conjecture,
    ! [X1] :
      ( ( ! [X2] :
            ( p(X2)
           => q(X2) )
        & r(X1) )
     => ( ! [X3] :
            ( r(X3)
           => p(X3) )
       => q(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ( ! [X2] :
              ( p(X2)
             => q(X2) )
          & r(X1) )
       => ( ! [X3] :
              ( r(X3)
             => p(X3) )
         => q(X1) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X5,X6] :
      ( ( ~ p(X5)
        | q(X5) )
      & r(esk1_0)
      & ( ~ r(X6)
        | p(X6) )
      & ~ q(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ q(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( q(X1)
    | ~ p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ p(esk1_0),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    ( p(X1)
    | ~ r(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    r(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Sep  5 09:46:24 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.46  Running first-order on 8 cores model finding
% 0.20/0.46  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  # Version: 3.0pre003
% 0.20/0.46  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46  # Starting sh5l with 300s (1) cores
% 0.20/0.46  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2041 completed with status 0
% 0.20/0.46  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.46  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.46  # No SInE strategy applied
% 0.20/0.46  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.20/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.46  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.46  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.46  # Starting sh5l with 136s (1) cores
% 0.20/0.46  # SAT001_MinMin_p005000_rr_RG with pid 2046 completed with status 0
% 0.20/0.46  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.46  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.46  # No SInE strategy applied
% 0.20/0.46  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.20/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.46  # Preprocessing time       : 0.001 s
% 0.20/0.46  # Presaturation interreduction done
% 0.20/0.46  
% 0.20/0.46  # Proof found!
% 0.20/0.46  # SZS status Theorem
% 0.20/0.46  # SZS output start CNFRefutation
% See solution above
% 0.20/0.46  # Parsed axioms                        : 1
% 0.20/0.46  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.46  # Initial clauses                      : 4
% 0.20/0.46  # Removed in clause preprocessing      : 0
% 0.20/0.46  # Initial clauses in saturation        : 4
% 0.20/0.46  # Processed clauses                    : 9
% 0.20/0.46  # ...of these trivial                  : 0
% 0.20/0.46  # ...subsumed                          : 0
% 0.20/0.46  # ...remaining for further processing  : 9
% 0.20/0.46  # Other redundant clauses eliminated   : 0
% 0.20/0.46  # Clauses deleted for lack of memory   : 0
% 0.20/0.46  # Backward-subsumed                    : 0
% 0.20/0.46  # Backward-rewritten                   : 0
% 0.20/0.46  # Generated clauses                    : 2
% 0.20/0.46  # ...of the previous two non-redundant : 1
% 0.20/0.46  # ...aggressively subsumed             : 0
% 0.20/0.46  # Contextual simplify-reflections      : 0
% 0.20/0.46  # Paramodulations                      : 2
% 0.20/0.46  # Factorizations                       : 0
% 0.20/0.46  # NegExts                              : 0
% 0.20/0.46  # Equation resolutions                 : 0
% 0.20/0.46  # Propositional unsat checks           : 0
% 0.20/0.46  #    Propositional check models        : 0
% 0.20/0.46  #    Propositional check unsatisfiable : 0
% 0.20/0.46  #    Propositional clauses             : 0
% 0.20/0.46  #    Propositional clauses after purity: 0
% 0.20/0.46  #    Propositional unsat core size     : 0
% 0.20/0.46  #    Propositional preprocessing time  : 0.000
% 0.20/0.46  #    Propositional encoding time       : 0.000
% 0.20/0.46  #    Propositional solver time         : 0.000
% 0.20/0.46  #    Success case prop preproc time    : 0.000
% 0.20/0.46  #    Success case prop encoding time   : 0.000
% 0.20/0.46  #    Success case prop solver time     : 0.000
% 0.20/0.46  # Current number of processed clauses  : 5
% 0.20/0.46  #    Positive orientable unit clauses  : 1
% 0.20/0.46  #    Positive unorientable unit clauses: 0
% 0.20/0.46  #    Negative unit clauses             : 2
% 0.20/0.46  #    Non-unit-clauses                  : 2
% 0.20/0.46  # Current number of unprocessed clauses: 0
% 0.20/0.46  # ...number of literals in the above   : 0
% 0.20/0.46  # Current number of archived formulas  : 0
% 0.20/0.46  # Current number of archived clauses   : 4
% 0.20/0.46  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.46  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.46  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.46  # Unit Clause-clause subsumption calls : 0
% 0.20/0.46  # Rewrite failures with RHS unbound    : 0
% 0.20/0.46  # BW rewrite match attempts            : 0
% 0.20/0.46  # BW rewrite match successes           : 0
% 0.20/0.46  # Condensation attempts                : 0
% 0.20/0.46  # Condensation successes               : 0
% 0.20/0.46  # Termbank termtop insertions          : 237
% 0.20/0.46  
% 0.20/0.46  # -------------------------------------------------
% 0.20/0.46  # User time                : 0.001 s
% 0.20/0.46  # System time              : 0.002 s
% 0.20/0.46  # Total time               : 0.003 s
% 0.20/0.46  # Maximum resident set size: 1676 pages
% 0.20/0.46  
% 0.20/0.46  # -------------------------------------------------
% 0.20/0.46  # User time                : 0.005 s
% 0.20/0.46  # System time              : 0.006 s
% 0.20/0.46  # Total time               : 0.011 s
% 0.20/0.46  # Maximum resident set size: 1696 pages
%------------------------------------------------------------------------------