TSTP Solution File: LCL109-10 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : LCL109-10 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 10:43:22 EDT 2024
% Result : Unsatisfiable 1.38s 0.65s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 5 RR)
% Number of literals : 30 ( 29 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 48 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',wajsberg_3) ).
cnf(lemma_4,axiom,
implies(X1,implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',lemma_4) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',wajsberg_1) ).
cnf(lemma_10,axiom,
implies(not(X1),not(X2)) = implies(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',lemma_10) ).
cnf(lemma_9,axiom,
not(not(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',lemma_9) ).
cnf(lemma_7,axiom,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',lemma_7) ).
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.P93WH7tKG8/E---3.1_24172.p',prove_wajsberg_mv_4) ).
cnf(lemma_1,axiom,
implies(X1,X1) = truth,
file('/export/starexec/sandbox/tmp/tmp.P93WH7tKG8/E---3.1_24172.p',lemma_1) ).
cnf(c_0_8,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_9,axiom,
implies(X1,implies(X2,X1)) = truth,
lemma_4 ).
cnf(c_0_10,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_11,axiom,
implies(not(X1),not(X2)) = implies(X2,X1),
lemma_10 ).
cnf(c_0_12,axiom,
not(not(X1)) = X1,
lemma_9 ).
cnf(c_0_13,plain,
implies(implies(implies(X1,X2),X2),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
lemma_7 ).
cnf(c_0_16,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_17,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
inference(fof_simplification,[status(thm)],[prove_wajsberg_mv_4]) ).
cnf(c_0_19,plain,
implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
implies(X1,not(implies(X2,not(implies(X2,X1))))) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_17]),c_0_11]),c_0_17]) ).
cnf(c_0_21,plain,
implies(not(X1),implies(X1,X2)) = truth,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
c_0_18 ).
cnf(c_0_23,plain,
implies(X1,implies(implies(X2,not(implies(X2,X1))),X3)) = implies(X1,implies(not(X3),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_19]),c_0_11]) ).
cnf(c_0_24,plain,
implies(X1,implies(not(X1),X2)) = truth,
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_25,axiom,
implies(X1,X1) = truth,
lemma_1 ).
cnf(c_0_26,negated_conjecture,
implies(b,implies(implies(b,implies(implies(a,b),a)),a)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_15]),c_0_15]) ).
cnf(c_0_27,plain,
implies(X1,implies(implies(X2,X1),X2)) = implies(X1,X2),
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_8]),c_0_19]),c_0_24]),c_0_10]),c_0_12]) ).
cnf(c_0_28,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL109-10 : TPTP v8.2.0. Released v7.5.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 13:56:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.P93WH7tKG8/E---3.1_24172.p
% 1.38/0.65 # Version: 3.2.0
% 1.38/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.38/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.38/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.38/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.38/0.65 # Starting sh5l with 300s (1) cores
% 1.38/0.65 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24251 completed with status 0
% 1.38/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.38/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.38/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.38/0.65 # No SInE strategy applied
% 1.38/0.65 # Search class: FUUPM-FFSF32-MFFFFFNN
% 1.38/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.38/0.65 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 1.38/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.38/0.65 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.38/0.65 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.38/0.65 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.38/0.65 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 24260 completed with status 0
% 1.38/0.65 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 1.38/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.38/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.38/0.65 # No SInE strategy applied
% 1.38/0.65 # Search class: FUUPM-FFSF32-MFFFFFNN
% 1.38/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.38/0.65 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 1.38/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.38/0.65 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.38/0.65 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.38/0.65 # Preprocessing time : 0.001 s
% 1.38/0.65 # Presaturation interreduction done
% 1.38/0.65
% 1.38/0.65 # Proof found!
% 1.38/0.65 # SZS status Unsatisfiable
% 1.38/0.65 # SZS output start CNFRefutation
% See solution above
% 1.38/0.65 # Parsed axioms : 16
% 1.38/0.65 # Removed by relevancy pruning/SinE : 0
% 1.38/0.65 # Initial clauses : 16
% 1.38/0.65 # Removed in clause preprocessing : 0
% 1.38/0.65 # Initial clauses in saturation : 16
% 1.38/0.65 # Processed clauses : 649
% 1.38/0.65 # ...of these trivial : 434
% 1.38/0.65 # ...subsumed : 53
% 1.38/0.65 # ...remaining for further processing : 162
% 1.38/0.65 # Other redundant clauses eliminated : 0
% 1.38/0.65 # Clauses deleted for lack of memory : 0
% 1.38/0.65 # Backward-subsumed : 0
% 1.38/0.65 # Backward-rewritten : 7
% 1.38/0.65 # Generated clauses : 17540
% 1.38/0.65 # ...of the previous two non-redundant : 8488
% 1.38/0.65 # ...aggressively subsumed : 0
% 1.38/0.65 # Contextual simplify-reflections : 0
% 1.38/0.65 # Paramodulations : 17540
% 1.38/0.65 # Factorizations : 0
% 1.38/0.65 # NegExts : 0
% 1.38/0.65 # Equation resolutions : 0
% 1.38/0.65 # Disequality decompositions : 0
% 1.38/0.65 # Total rewrite steps : 25431
% 1.38/0.65 # ...of those cached : 20474
% 1.38/0.65 # Propositional unsat checks : 0
% 1.38/0.65 # Propositional check models : 0
% 1.38/0.65 # Propositional check unsatisfiable : 0
% 1.38/0.65 # Propositional clauses : 0
% 1.38/0.65 # Propositional clauses after purity: 0
% 1.38/0.65 # Propositional unsat core size : 0
% 1.38/0.65 # Propositional preprocessing time : 0.000
% 1.38/0.65 # Propositional encoding time : 0.000
% 1.38/0.65 # Propositional solver time : 0.000
% 1.38/0.65 # Success case prop preproc time : 0.000
% 1.38/0.65 # Success case prop encoding time : 0.000
% 1.38/0.65 # Success case prop solver time : 0.000
% 1.38/0.65 # Current number of processed clauses : 140
% 1.38/0.65 # Positive orientable unit clauses : 134
% 1.38/0.65 # Positive unorientable unit clauses: 5
% 1.38/0.65 # Negative unit clauses : 1
% 1.38/0.65 # Non-unit-clauses : 0
% 1.38/0.65 # Current number of unprocessed clauses: 7859
% 1.38/0.65 # ...number of literals in the above : 7859
% 1.38/0.65 # Current number of archived formulas : 0
% 1.38/0.65 # Current number of archived clauses : 22
% 1.38/0.65 # Clause-clause subsumption calls (NU) : 0
% 1.38/0.65 # Rec. Clause-clause subsumption calls : 0
% 1.38/0.65 # Non-unit clause-clause subsumptions : 0
% 1.38/0.65 # Unit Clause-clause subsumption calls : 22
% 1.38/0.65 # Rewrite failures with RHS unbound : 0
% 1.38/0.65 # BW rewrite match attempts : 846
% 1.38/0.65 # BW rewrite match successes : 92
% 1.38/0.65 # Condensation attempts : 0
% 1.38/0.65 # Condensation successes : 0
% 1.38/0.65 # Termbank termtop insertions : 179603
% 1.38/0.65 # Search garbage collected termcells : 2
% 1.38/0.65
% 1.38/0.65 # -------------------------------------------------
% 1.38/0.65 # User time : 0.138 s
% 1.38/0.65 # System time : 0.013 s
% 1.38/0.65 # Total time : 0.151 s
% 1.38/0.65 # Maximum resident set size: 1564 pages
% 1.38/0.65
% 1.38/0.65 # -------------------------------------------------
% 1.38/0.65 # User time : 0.744 s
% 1.38/0.65 # System time : 0.046 s
% 1.38/0.65 # Total time : 0.790 s
% 1.38/0.65 # Maximum resident set size: 1688 pages
% 1.38/0.65 % E---3.1 exiting
% 1.38/0.65 % E exiting
%------------------------------------------------------------------------------