TSTP Solution File: LCL109-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL109-2 : 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:33 EDT 2023
% Result : Unsatisfiable 1.97s 0.78s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 4 RR)
% Number of literals : 47 ( 46 equ; 3 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 : 82 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/tmp/tmp.Ip4YBH7KPy/E---3.1_16886.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Ip4YBH7KPy/E---3.1_16886.p',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/tmp/tmp.Ip4YBH7KPy/E---3.1_16886.p',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/tmp/tmp.Ip4YBH7KPy/E---3.1_16886.p',wajsberg_4) ).
cnf(prove_wajsberg_mv_4,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
file('/export/starexec/sandbox2/tmp/tmp.Ip4YBH7KPy/E---3.1_16886.p',prove_wajsberg_mv_4) ).
cnf(c_0_5,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_6,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_7,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_8,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_6]) ).
cnf(c_0_11,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_6]),c_0_6]) ).
cnf(c_0_14,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_15,plain,
implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_6]) ).
cnf(c_0_16,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,plain,
implies(not(truth),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_6]) ).
cnf(c_0_18,plain,
implies(not(X1),implies(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_6]) ).
cnf(c_0_19,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_17]),c_0_6]) ).
cnf(c_0_20,plain,
implies(not(implies(X1,not(truth))),X1) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_21]),c_0_6]),c_0_16]),c_0_6]) ).
cnf(c_0_23,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_17]),c_0_6]) ).
cnf(c_0_24,plain,
implies(implies(X1,X2),implies(not(X2),not(X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_6]) ).
cnf(c_0_26,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_6]) ).
cnf(c_0_27,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_6]),c_0_14]),c_0_6]) ).
cnf(c_0_28,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_23]),c_0_23]) ).
cnf(c_0_29,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_6]) ).
cnf(c_0_30,plain,
implies(implies(implies(X1,X2),X2),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_6]) ).
cnf(c_0_31,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_29]),c_0_6]),c_0_29]),c_0_6]) ).
cnf(c_0_33,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_7]) ).
cnf(c_0_34,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
implies(not(implies(X1,X2)),not(X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_23]) ).
cnf(c_0_36,plain,
implies(X1,implies(not(X1),X2)) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_37,plain,
implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,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_33,c_0_27]),c_0_27]),c_0_34]),c_0_34]) ).
cnf(c_0_39,plain,
implies(not(implies(X1,not(X2))),X2) = truth,
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_40,plain,
implies(implies(implies(not(X1),X2),X1),X1) = implies(not(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_36]),c_0_6]) ).
cnf(c_0_41,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
prove_wajsberg_mv_4 ).
cnf(c_0_42,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_37,c_0_38]),c_0_37]),c_0_27]) ).
cnf(c_0_43,plain,
implies(not(implies(X1,X2)),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_28]) ).
cnf(c_0_44,negated_conjecture,
implies(b,implies(implies(b,implies(implies(a,b),a)),a)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_32]),c_0_32]) ).
cnf(c_0_45,plain,
implies(X1,implies(implies(X2,X1),X2)) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_7]),c_0_43]),c_0_6]),c_0_28]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL109-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 11:33:41 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Ip4YBH7KPy/E---3.1_16886.p
% 1.97/0.78 # Version: 3.1pre001
% 1.97/0.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.97/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.97/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.97/0.78 # Starting new_bool_3 with 300s (1) cores
% 1.97/0.78 # Starting new_bool_1 with 300s (1) cores
% 1.97/0.78 # Starting sh5l with 300s (1) cores
% 1.97/0.78 # sh5l with pid 16967 completed with status 0
% 1.97/0.78 # Result found by sh5l
% 1.97/0.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.97/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.97/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.97/0.78 # Starting new_bool_3 with 300s (1) cores
% 1.97/0.78 # Starting new_bool_1 with 300s (1) cores
% 1.97/0.78 # Starting sh5l with 300s (1) cores
% 1.97/0.78 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.97/0.78 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1.97/0.78 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.97/0.78 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 1.97/0.78 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 16973 completed with status 0
% 1.97/0.78 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 1.97/0.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.97/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.97/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.97/0.78 # Starting new_bool_3 with 300s (1) cores
% 1.97/0.78 # Starting new_bool_1 with 300s (1) cores
% 1.97/0.78 # Starting sh5l with 300s (1) cores
% 1.97/0.78 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.97/0.78 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1.97/0.78 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.97/0.78 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 1.97/0.78 # Preprocessing time : 0.001 s
% 1.97/0.78 # Presaturation interreduction done
% 1.97/0.78
% 1.97/0.78 # Proof found!
% 1.97/0.78 # SZS status Unsatisfiable
% 1.97/0.78 # SZS output start CNFRefutation
% See solution above
% 1.97/0.78 # Parsed axioms : 5
% 1.97/0.78 # Removed by relevancy pruning/SinE : 0
% 1.97/0.78 # Initial clauses : 5
% 1.97/0.78 # Removed in clause preprocessing : 0
% 1.97/0.78 # Initial clauses in saturation : 5
% 1.97/0.78 # Processed clauses : 828
% 1.97/0.78 # ...of these trivial : 599
% 1.97/0.78 # ...subsumed : 48
% 1.97/0.78 # ...remaining for further processing : 181
% 1.97/0.78 # Other redundant clauses eliminated : 0
% 1.97/0.78 # Clauses deleted for lack of memory : 0
% 1.97/0.78 # Backward-subsumed : 0
% 1.97/0.78 # Backward-rewritten : 84
% 1.97/0.78 # Generated clauses : 45072
% 1.97/0.78 # ...of the previous two non-redundant : 15913
% 1.97/0.78 # ...aggressively subsumed : 0
% 1.97/0.78 # Contextual simplify-reflections : 0
% 1.97/0.78 # Paramodulations : 45072
% 1.97/0.78 # Factorizations : 0
% 1.97/0.78 # NegExts : 0
% 1.97/0.78 # Equation resolutions : 0
% 1.97/0.78 # Total rewrite steps : 73329
% 1.97/0.78 # Propositional unsat checks : 0
% 1.97/0.78 # Propositional check models : 0
% 1.97/0.78 # Propositional check unsatisfiable : 0
% 1.97/0.78 # Propositional clauses : 0
% 1.97/0.78 # Propositional clauses after purity: 0
% 1.97/0.78 # Propositional unsat core size : 0
% 1.97/0.78 # Propositional preprocessing time : 0.000
% 1.97/0.78 # Propositional encoding time : 0.000
% 1.97/0.78 # Propositional solver time : 0.000
% 1.97/0.78 # Success case prop preproc time : 0.000
% 1.97/0.78 # Success case prop encoding time : 0.000
% 1.97/0.78 # Success case prop solver time : 0.000
% 1.97/0.78 # Current number of processed clauses : 92
% 1.97/0.78 # Positive orientable unit clauses : 87
% 1.97/0.78 # Positive unorientable unit clauses: 4
% 1.97/0.78 # Negative unit clauses : 1
% 1.97/0.78 # Non-unit-clauses : 0
% 1.97/0.78 # Current number of unprocessed clauses: 14822
% 1.97/0.78 # ...number of literals in the above : 14822
% 1.97/0.78 # Current number of archived formulas : 0
% 1.97/0.78 # Current number of archived clauses : 89
% 1.97/0.78 # Clause-clause subsumption calls (NU) : 0
% 1.97/0.78 # Rec. Clause-clause subsumption calls : 0
% 1.97/0.78 # Non-unit clause-clause subsumptions : 0
% 1.97/0.78 # Unit Clause-clause subsumption calls : 74
% 1.97/0.78 # Rewrite failures with RHS unbound : 0
% 1.97/0.78 # BW rewrite match attempts : 1900
% 1.97/0.78 # BW rewrite match successes : 411
% 1.97/0.78 # Condensation attempts : 0
% 1.97/0.78 # Condensation successes : 0
% 1.97/0.78 # Termbank termtop insertions : 471079
% 1.97/0.78
% 1.97/0.78 # -------------------------------------------------
% 1.97/0.78 # User time : 0.250 s
% 1.97/0.78 # System time : 0.012 s
% 1.97/0.78 # Total time : 0.263 s
% 1.97/0.78 # Maximum resident set size: 1424 pages
% 1.97/0.78
% 1.97/0.78 # -------------------------------------------------
% 1.97/0.78 # User time : 0.251 s
% 1.97/0.78 # System time : 0.015 s
% 1.97/0.78 # Total time : 0.266 s
% 1.97/0.78 # Maximum resident set size: 1672 pages
% 1.97/0.78 % E---3.1 exiting
% 1.97/0.78 % E---3.1 exiting
%------------------------------------------------------------------------------