TSTP Solution File: LCL109-3 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n010.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:45 EDT 2023

% Result   : Unsatisfiable 2.99s 0.86s
% Output   : CNFRefutation 2.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  29 unt;   0 nHn;   6 RR)
%            Number of literals    :   29 (  28 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_wajsberg_mv_4,negated_conjecture,
    implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',prove_wajsberg_mv_4) ).

cnf(lemma_10,axiom,
    implies(not(X1),not(X2)) = implies(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',lemma_10) ).

cnf(wajsberg_3,axiom,
    implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',wajsberg_3) ).

cnf(lemma_9,axiom,
    not(not(X1)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',lemma_9) ).

cnf(lemma_7,axiom,
    implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',lemma_7) ).

cnf(wajsberg_2,axiom,
    implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',wajsberg_2) ).

cnf(lemma_4,axiom,
    implies(X1,implies(X2,X1)) = truth,
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',lemma_4) ).

cnf(lemma_8,axiom,
    implies(X1,not(truth)) = not(X1),
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',lemma_8) ).

cnf(wajsberg_1,axiom,
    implies(truth,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.U2q1u28l30/E---3.1_17034.p',wajsberg_1) ).

cnf(c_0_9,negated_conjecture,
    implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
    prove_wajsberg_mv_4 ).

cnf(c_0_10,axiom,
    implies(not(X1),not(X2)) = implies(X2,X1),
    lemma_10 ).

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

cnf(c_0_12,axiom,
    not(not(X1)) = X1,
    lemma_9 ).

cnf(c_0_13,negated_conjecture,
    implies(not(implies(b,a)),not(implies(implies(a,b),implies(b,a)))) != truth,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    implies(not(X1),not(implies(X2,X1))) = implies(not(X2),not(implies(X1,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).

cnf(c_0_15,plain,
    implies(not(X1),X2) = implies(not(X2),X1),
    inference(spm,[status(thm)],[c_0_10,c_0_12]) ).

cnf(c_0_16,axiom,
    implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
    lemma_7 ).

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

cnf(c_0_18,plain,
    implies(X1,not(X2)) = implies(X2,not(X1)),
    inference(spm,[status(thm)],[c_0_10,c_0_12]) ).

cnf(c_0_19,axiom,
    implies(X1,implies(X2,X1)) = truth,
    lemma_4 ).

cnf(c_0_20,axiom,
    implies(X1,not(truth)) = not(X1),
    lemma_8 ).

cnf(c_0_21,negated_conjecture,
    implies(not(implies(a,b)),not(implies(implies(b,a),implies(a,b)))) != truth,
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_22,plain,
    implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_23,plain,
    implies(implies(not(X1),X2),implies(not(X3),implies(implies(X1,X3),not(implies(X2,not(implies(X3,X1))))))) = truth,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_16]),c_0_18]) ).

cnf(c_0_24,plain,
    implies(implies(X1,X2),not(implies(not(X1),not(implies(X2,X1))))) = not(X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_14]),c_0_12]),c_0_12]),c_0_18]),c_0_12]),c_0_19]),c_0_20]) ).

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

cnf(c_0_26,negated_conjecture,
    implies(a,implies(not(b),not(implies(a,implies(not(b),not(implies(b,a))))))) != truth,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_16]),c_0_10]),c_0_12]),c_0_10]) ).

cnf(c_0_27,plain,
    implies(X1,implies(not(X2),not(implies(X1,implies(not(X2),not(implies(X2,X1))))))) = truth,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_12]),c_0_12]),c_0_18]),c_0_12]),c_0_19]),c_0_12]),c_0_25]),c_0_16]),c_0_10]),c_0_16]),c_0_10]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL109-3 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Oct  2 12:24:20 EDT 2023
% 0.15/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.U2q1u28l30/E---3.1_17034.p
% 2.99/0.86  # Version: 3.1pre001
% 2.99/0.86  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.99/0.86  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.99/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.99/0.86  # Starting new_bool_3 with 300s (1) cores
% 2.99/0.86  # Starting new_bool_1 with 300s (1) cores
% 2.99/0.86  # Starting sh5l with 300s (1) cores
% 2.99/0.86  # sh5l with pid 17114 completed with status 0
% 2.99/0.86  # Result found by sh5l
% 2.99/0.86  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.99/0.86  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.99/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.99/0.86  # Starting new_bool_3 with 300s (1) cores
% 2.99/0.86  # Starting new_bool_1 with 300s (1) cores
% 2.99/0.86  # Starting sh5l with 300s (1) cores
% 2.99/0.86  # SinE strategy is gf500_gu_R04_F100_L20000
% 2.99/0.86  # Search class: FHUPM-FFSF21-MFFFFFNN
% 2.99/0.86  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.99/0.86  # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 163s (1) cores
% 2.99/0.86  # G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 17118 completed with status 0
% 2.99/0.86  # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 2.99/0.86  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.99/0.86  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.99/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.99/0.86  # Starting new_bool_3 with 300s (1) cores
% 2.99/0.86  # Starting new_bool_1 with 300s (1) cores
% 2.99/0.86  # Starting sh5l with 300s (1) cores
% 2.99/0.86  # SinE strategy is gf500_gu_R04_F100_L20000
% 2.99/0.86  # Search class: FHUPM-FFSF21-MFFFFFNN
% 2.99/0.86  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.99/0.86  # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 163s (1) cores
% 2.99/0.86  # Preprocessing time       : 0.001 s
% 2.99/0.86  # Presaturation interreduction done
% 2.99/0.86  
% 2.99/0.86  # Proof found!
% 2.99/0.86  # SZS status Unsatisfiable
% 2.99/0.86  # SZS output start CNFRefutation
% See solution above
% 2.99/0.86  # Parsed axioms                        : 15
% 2.99/0.86  # Removed by relevancy pruning/SinE    : 0
% 2.99/0.86  # Initial clauses                      : 15
% 2.99/0.86  # Removed in clause preprocessing      : 0
% 2.99/0.86  # Initial clauses in saturation        : 15
% 2.99/0.86  # Processed clauses                    : 3113
% 2.99/0.86  # ...of these trivial                  : 290
% 2.99/0.86  # ...subsumed                          : 2512
% 2.99/0.86  # ...remaining for further processing  : 311
% 2.99/0.86  # Other redundant clauses eliminated   : 0
% 2.99/0.86  # Clauses deleted for lack of memory   : 0
% 2.99/0.86  # Backward-subsumed                    : 7
% 2.99/0.86  # Backward-rewritten                   : 13
% 2.99/0.86  # Generated clauses                    : 33050
% 2.99/0.86  # ...of the previous two non-redundant : 23821
% 2.99/0.86  # ...aggressively subsumed             : 0
% 2.99/0.86  # Contextual simplify-reflections      : 0
% 2.99/0.86  # Paramodulations                      : 33028
% 2.99/0.86  # Factorizations                       : 0
% 2.99/0.86  # NegExts                              : 0
% 2.99/0.86  # Equation resolutions                 : 22
% 2.99/0.86  # Total rewrite steps                  : 57869
% 2.99/0.86  # Propositional unsat checks           : 0
% 2.99/0.86  #    Propositional check models        : 0
% 2.99/0.86  #    Propositional check unsatisfiable : 0
% 2.99/0.86  #    Propositional clauses             : 0
% 2.99/0.86  #    Propositional clauses after purity: 0
% 2.99/0.86  #    Propositional unsat core size     : 0
% 2.99/0.86  #    Propositional preprocessing time  : 0.000
% 2.99/0.86  #    Propositional encoding time       : 0.000
% 2.99/0.86  #    Propositional solver time         : 0.000
% 2.99/0.86  #    Success case prop preproc time    : 0.000
% 2.99/0.86  #    Success case prop encoding time   : 0.000
% 2.99/0.86  #    Success case prop solver time     : 0.000
% 2.99/0.86  # Current number of processed clauses  : 276
% 2.99/0.86  #    Positive orientable unit clauses  : 100
% 2.99/0.86  #    Positive unorientable unit clauses: 5
% 2.99/0.86  #    Negative unit clauses             : 0
% 2.99/0.86  #    Non-unit-clauses                  : 171
% 2.99/0.86  # Current number of unprocessed clauses: 20704
% 2.99/0.86  # ...number of literals in the above   : 28903
% 2.99/0.86  # Current number of archived formulas  : 0
% 2.99/0.86  # Current number of archived clauses   : 35
% 2.99/0.86  # Clause-clause subsumption calls (NU) : 21751
% 2.99/0.86  # Rec. Clause-clause subsumption calls : 20239
% 2.99/0.86  # Non-unit clause-clause subsumptions  : 2512
% 2.99/0.86  # Unit Clause-clause subsumption calls : 12
% 2.99/0.86  # Rewrite failures with RHS unbound    : 0
% 2.99/0.86  # BW rewrite match attempts            : 1322
% 2.99/0.86  # BW rewrite match successes           : 82
% 2.99/0.86  # Condensation attempts                : 0
% 2.99/0.86  # Condensation successes               : 0
% 2.99/0.86  # Termbank termtop insertions          : 499079
% 2.99/0.86  
% 2.99/0.86  # -------------------------------------------------
% 2.99/0.86  # User time                : 0.338 s
% 2.99/0.86  # System time              : 0.011 s
% 2.99/0.86  # Total time               : 0.349 s
% 2.99/0.86  # Maximum resident set size: 1640 pages
% 2.99/0.86  
% 2.99/0.86  # -------------------------------------------------
% 2.99/0.86  # User time                : 0.339 s
% 2.99/0.86  # System time              : 0.013 s
% 2.99/0.86  # Total time               : 0.352 s
% 2.99/0.86  # Maximum resident set size: 1676 pages
% 2.99/0.86  % E---3.1 exiting
%------------------------------------------------------------------------------