TSTP Solution File: LCL007-1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n027.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 18:23:26 EDT 2023

% Result   : Unsatisfiable 0.17s 0.44s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   8 unt;   0 nHn;   6 RR)
%            Number of literals    :   16 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.XheSVjQQTN/E---3.1_32481.p',condensed_detachment) ).

cnf(ec_4,axiom,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
    file('/export/starexec/sandbox/tmp/tmp.XheSVjQQTN/E---3.1_32481.p',ec_4) ).

cnf(ec_5,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
    file('/export/starexec/sandbox/tmp/tmp.XheSVjQQTN/E---3.1_32481.p',ec_5) ).

cnf(prove_ec_2,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
    file('/export/starexec/sandbox/tmp/tmp.XheSVjQQTN/E---3.1_32481.p',prove_ec_2) ).

cnf(c_0_4,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_5,axiom,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
    ec_4 ).

cnf(c_0_6,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
    ec_5 ).

cnf(c_0_8,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
    prove_ec_2 ).

cnf(c_0_9,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,X2),X3))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

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