TSTP Solution File: SYN065+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SYN065+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n018.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:28:53 EDT 2023

% Result   : Theorem 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   9 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   32 (  14   ~;  13   |;   3   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   22 (   1 sgn;  11   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel36_3,axiom,
    ! [X1,X2] :
      ( ( big_f(X1,X2)
        | big_g(X1,X2) )
     => ! [X3] :
          ( ( big_f(X2,X3)
            | big_g(X2,X3) )
         => big_h(X1,X3) ) ),
    file('/export/starexec/sandbox/tmp/tmp.XTHQIQ7Zjx/E---3.1_19374.p',pel36_3) ).

fof(pel36_1,axiom,
    ! [X1] :
    ? [X2] : big_f(X1,X2),
    file('/export/starexec/sandbox/tmp/tmp.XTHQIQ7Zjx/E---3.1_19374.p',pel36_1) ).

fof(pel36,conjecture,
    ! [X1] :
    ? [X2] : big_h(X1,X2),
    file('/export/starexec/sandbox/tmp/tmp.XTHQIQ7Zjx/E---3.1_19374.p',pel36) ).

fof(c_0_3,plain,
    ! [X6,X7,X8] :
      ( ( ~ big_f(X7,X8)
        | big_h(X6,X8)
        | ~ big_f(X6,X7) )
      & ( ~ big_g(X7,X8)
        | big_h(X6,X8)
        | ~ big_f(X6,X7) )
      & ( ~ big_f(X7,X8)
        | big_h(X6,X8)
        | ~ big_g(X6,X7) )
      & ( ~ big_g(X7,X8)
        | big_h(X6,X8)
        | ~ big_g(X6,X7) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel36_3])])])]) ).

fof(c_0_4,plain,
    ! [X11] : big_f(X11,esk3_1(X11)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel36_1])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
      ? [X2] : big_h(X1,X2),
    inference(assume_negation,[status(cth)],[pel36]) ).

cnf(c_0_6,plain,
    ( big_h(X3,X2)
    | ~ big_f(X1,X2)
    | ~ big_f(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    big_f(X1,esk3_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ! [X5] : ~ big_h(esk1_0,X5),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,plain,
    ( big_h(X1,X2)
    | ~ big_f(esk3_1(X1),X2) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ~ big_h(esk1_0,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    big_h(X1,esk3_1(esk3_1(X1))),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_10,c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN065+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 19:01:54 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  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/tmp/tmp.XTHQIQ7Zjx/E---3.1_19374.p
% 0.21/0.50  # Version: 3.1pre001
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # new_bool_3 with pid 19456 completed with status 0
% 0.21/0.50  # Result found by new_bool_3
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50  # SAT001_MinMin_p005000_rr_RG with pid 19460 completed with status 0
% 0.21/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Theorem
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 4
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.50  # Initial clauses                      : 7
% 0.21/0.50  # Removed in clause preprocessing      : 0
% 0.21/0.50  # Initial clauses in saturation        : 7
% 0.21/0.50  # Processed clauses                    : 14
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 14
% 0.21/0.50  # Other redundant clauses eliminated   : 0
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 0
% 0.21/0.50  # Generated clauses                    : 4
% 0.21/0.50  # ...of the previous two non-redundant : 3
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 4
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 0
% 0.21/0.50  # Total rewrite steps                  : 0
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 7
% 0.21/0.50  #    Positive orientable unit clauses  : 3
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 1
% 0.21/0.50  #    Non-unit-clauses                  : 3
% 0.21/0.50  # Current number of unprocessed clauses: 3
% 0.21/0.50  # ...number of literals in the above   : 8
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 7
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 4
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 4
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 0
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 0
% 0.21/0.50  # BW rewrite match successes           : 0
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 356
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.003 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.005 s
% 0.21/0.50  # Maximum resident set size: 1608 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.005 s
% 0.21/0.50  # System time              : 0.003 s
% 0.21/0.50  # Total time               : 0.008 s
% 0.21/0.50  # Maximum resident set size: 1676 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------