TSTP Solution File: LCL013-1 by E---3.1

View Problem - Process Solution

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

% Computer : n017.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:11:15 EDT 2023

% Result   : Unsatisfiable 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :   18 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   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.BadnDJ3k9k/E---3.1_21715.p',condensed_detachment) ).

cnf(xgf,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2)))),
    file('/export/starexec/sandbox/tmp/tmp.BadnDJ3k9k/E---3.1_21715.p',xgf) ).

cnf(prove_um,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
    file('/export/starexec/sandbox/tmp/tmp.BadnDJ3k9k/E---3.1_21715.p',prove_um) ).

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

cnf(c_0_4,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2)))),
    xgf ).

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

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

cnf(c_0_7,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
    prove_um ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : LCL013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n017.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 12:02:26 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order theorem proving
% 0.16/0.42  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.BadnDJ3k9k/E---3.1_21715.p
% 0.16/0.43  # Version: 3.1pre001
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43  # Starting sh5l with 300s (1) cores
% 0.16/0.43  # new_bool_3 with pid 21794 completed with status 0
% 0.16/0.43  # Result found by new_bool_3
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.16/0.43  # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 21798 completed with status 0
% 0.16/0.43  # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.16/0.43  # Preprocessing time       : 0.001 s
% 0.16/0.43  
% 0.16/0.43  # Proof found!
% 0.16/0.43  # SZS status Unsatisfiable
% 0.16/0.43  # SZS output start CNFRefutation
% See solution above
% 0.16/0.43  # Parsed axioms                        : 3
% 0.16/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.43  # Initial clauses                      : 3
% 0.16/0.43  # Removed in clause preprocessing      : 0
% 0.16/0.43  # Initial clauses in saturation        : 3
% 0.16/0.43  # Processed clauses                    : 6
% 0.16/0.43  # ...of these trivial                  : 0
% 0.16/0.43  # ...subsumed                          : 0
% 0.16/0.43  # ...remaining for further processing  : 6
% 0.16/0.43  # Other redundant clauses eliminated   : 0
% 0.16/0.43  # Clauses deleted for lack of memory   : 0
% 0.16/0.43  # Backward-subsumed                    : 0
% 0.16/0.43  # Backward-rewritten                   : 0
% 0.16/0.43  # Generated clauses                    : 7
% 0.16/0.43  # ...of the previous two non-redundant : 6
% 0.16/0.43  # ...aggressively subsumed             : 0
% 0.16/0.43  # Contextual simplify-reflections      : 0
% 0.16/0.43  # Paramodulations                      : 7
% 0.16/0.43  # Factorizations                       : 0
% 0.16/0.43  # NegExts                              : 0
% 0.16/0.43  # Equation resolutions                 : 0
% 0.16/0.43  # Total rewrite steps                  : 1
% 0.16/0.43  # Propositional unsat checks           : 0
% 0.16/0.43  #    Propositional check models        : 0
% 0.16/0.43  #    Propositional check unsatisfiable : 0
% 0.16/0.43  #    Propositional clauses             : 0
% 0.16/0.43  #    Propositional clauses after purity: 0
% 0.16/0.43  #    Propositional unsat core size     : 0
% 0.16/0.43  #    Propositional preprocessing time  : 0.000
% 0.16/0.43  #    Propositional encoding time       : 0.000
% 0.16/0.43  #    Propositional solver time         : 0.000
% 0.16/0.43  #    Success case prop preproc time    : 0.000
% 0.16/0.43  #    Success case prop encoding time   : 0.000
% 0.16/0.43  #    Success case prop solver time     : 0.000
% 0.16/0.43  # Current number of processed clauses  : 6
% 0.16/0.43  #    Positive orientable unit clauses  : 1
% 0.16/0.43  #    Positive unorientable unit clauses: 0
% 0.16/0.43  #    Negative unit clauses             : 1
% 0.16/0.43  #    Non-unit-clauses                  : 4
% 0.16/0.43  # Current number of unprocessed clauses: 1
% 0.16/0.43  # ...number of literals in the above   : 3
% 0.16/0.43  # Current number of archived formulas  : 0
% 0.16/0.43  # Current number of archived clauses   : 0
% 0.16/0.43  # Clause-clause subsumption calls (NU) : 1
% 0.16/0.43  # Rec. Clause-clause subsumption calls : 1
% 0.16/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.43  # Unit Clause-clause subsumption calls : 0
% 0.16/0.43  # Rewrite failures with RHS unbound    : 0
% 0.16/0.43  # BW rewrite match attempts            : 0
% 0.16/0.43  # BW rewrite match successes           : 0
% 0.16/0.43  # Condensation attempts                : 0
% 0.16/0.43  # Condensation successes               : 0
% 0.16/0.43  # Termbank termtop insertions          : 194
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.001 s
% 0.16/0.43  # System time              : 0.002 s
% 0.16/0.43  # Total time               : 0.003 s
% 0.16/0.43  # Maximum resident set size: 1640 pages
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.002 s
% 0.16/0.43  # System time              : 0.002 s
% 0.16/0.43  # Total time               : 0.005 s
% 0.16/0.43  # Maximum resident set size: 1676 pages
% 0.16/0.43  % E---3.1 exiting
% 0.16/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------