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

View Problem - Process Solution

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

% Computer : n003.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:51 EDT 2023

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   14 (  14 unt;   0 nHn;   3 RR)
%            Number of literals    :   14 (  13 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
    implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
    file('/export/starexec/sandbox2/tmp/tmp.VOhHXv5Gkh/E---3.1_24045.p',wajsberg_2) ).

cnf(wajsberg_1,axiom,
    implies(truth,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.VOhHXv5Gkh/E---3.1_24045.p',wajsberg_1) ).

cnf(wajsberg_3,axiom,
    implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
    file('/export/starexec/sandbox2/tmp/tmp.VOhHXv5Gkh/E---3.1_24045.p',wajsberg_3) ).

cnf(prove_wajsberg_lemma,negated_conjecture,
    implies(x,truth) != truth,
    file('/export/starexec/sandbox2/tmp/tmp.VOhHXv5Gkh/E---3.1_24045.p',prove_wajsberg_lemma) ).

cnf(c_0_4,axiom,
    implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
    wajsberg_2 ).

cnf(c_0_5,axiom,
    implies(truth,X1) = X1,
    wajsberg_1 ).

cnf(c_0_6,axiom,
    implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
    wajsberg_3 ).

cnf(c_0_7,plain,
    implies(X1,implies(implies(X1,X2),X2)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).

cnf(c_0_8,plain,
    implies(implies(X1,truth),truth) = implies(X1,X1),
    inference(spm,[status(thm)],[c_0_6,c_0_5]) ).

cnf(c_0_9,plain,
    implies(X1,X1) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_5]) ).

cnf(c_0_10,plain,
    implies(implies(X1,truth),truth) = truth,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,negated_conjecture,
    implies(x,truth) != truth,
    prove_wajsberg_lemma ).

cnf(c_0_12,plain,
    implies(X1,truth) = truth,
    inference(spm,[status(thm)],[c_0_7,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
    [proof] ).

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