TSTP Solution File: LCL109-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL109-6 : TPTP v8.2.0. Released v1.0.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 May 20 23:55:29 EDT 2024
% Result : Unsatisfiable 1.05s 0.59s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of clauses : 64 ( 64 unt; 0 nHn; 7 RR)
% Number of literals : 64 ( 63 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 103 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_7,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
cnf(axiom_1,axiom,
not(X1) = xor(X1,truth),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_1) ).
cnf(implies_definition,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
cnf(axiom_4,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_4) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_definition) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutativity) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_commutativity) ).
cnf(axiom_8,axiom,
and_star(xor(and_star(xor(truth,X1),X2),truth),X2) = and_star(xor(and_star(xor(truth,X2),X1),truth),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_8) ).
cnf(axiom_6,axiom,
and_star(xor(truth,X1),X1) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_6) ).
cnf(and_star_associativity,axiom,
and_star(and_star(X1,X2),X3) = and_star(X1,and_star(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_associativity) ).
cnf(axiom_5,axiom,
and_star(X1,falsehood) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_5) ).
cnf(prove_wajsberg_mv_4,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_mv_4) ).
cnf(c_0_13,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_14,axiom,
not(X1) = xor(X1,truth),
axiom_1 ).
cnf(c_0_15,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_16,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_17,axiom,
and_star(X1,truth) = X1,
axiom_4 ).
cnf(c_0_18,plain,
xor(X1,xor(truth,X2)) = xor(not(X1),X2),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_20,plain,
xor(truth,X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_22,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]),c_0_16]),c_0_14]) ).
cnf(c_0_23,plain,
not(X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14]) ).
cnf(c_0_24,plain,
implies(implies(X1,falsehood),falsehood) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
implies(and_star(X1,implies(X2,falsehood)),falsehood) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_20]),c_0_20]) ).
cnf(c_0_26,plain,
and_star(X1,implies(X2,falsehood)) = implies(implies(X1,X2),falsehood),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_28,plain,
and_star(X1,X2) = implies(implies(X1,implies(X2,falsehood)),falsehood),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_29,axiom,
and_star(xor(and_star(xor(truth,X1),X2),truth),X2) = and_star(xor(and_star(xor(truth,X2),X1),truth),X1),
axiom_8 ).
cnf(c_0_30,plain,
implies(implies(X1,implies(X2,falsehood)),falsehood) = implies(implies(X2,implies(X1,falsehood)),falsehood),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_31,plain,
and_star(X1,not(and_star(xor(truth,X2),X1))) = and_star(X2,not(and_star(xor(truth,X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_14]),c_0_27]),c_0_14]),c_0_27]) ).
cnf(c_0_32,plain,
implies(X1,implies(X2,falsehood)) = implies(X2,implies(X1,falsehood)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_30]),c_0_24]) ).
cnf(c_0_33,axiom,
and_star(xor(truth,X1),X1) = falsehood,
axiom_6 ).
cnf(c_0_34,plain,
and_star(X1,implies(and_star(implies(X2,falsehood),X1),falsehood)) = and_star(X2,implies(and_star(implies(X1,falsehood),X2),falsehood)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_20]),c_0_23]),c_0_20]),c_0_23]) ).
cnf(c_0_35,plain,
implies(implies(X1,falsehood),implies(X2,falsehood)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_36,axiom,
and_star(and_star(X1,X2),X3) = and_star(X1,and_star(X2,X3)),
and_star_associativity ).
cnf(c_0_37,plain,
and_star(X1,xor(truth,X1)) = falsehood,
inference(rw,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_38,axiom,
and_star(X1,falsehood) = falsehood,
axiom_5 ).
cnf(c_0_39,plain,
and_star(truth,X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_40,plain,
implies(implies(X1,implies(implies(X1,X2),falsehood)),falsehood) = implies(implies(X2,implies(implies(X2,X1),falsehood)),falsehood),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_26]),c_0_26]),c_0_28]),c_0_35]),c_0_28]),c_0_35]) ).
cnf(c_0_41,plain,
implies(implies(X1,implies(X2,implies(X3,falsehood))),falsehood) = implies(implies(X2,implies(X3,implies(X1,falsehood))),falsehood),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_24]),c_0_35]) ).
cnf(c_0_42,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_37]),c_0_16]) ).
cnf(c_0_43,plain,
implies(X1,truth) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_19]),c_0_38]),c_0_16]) ).
cnf(c_0_44,plain,
implies(truth,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_39]),c_0_24]) ).
cnf(c_0_45,plain,
implies(X1,implies(implies(X1,X2),falsehood)) = implies(X2,implies(implies(X2,X1),falsehood)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_24]) ).
cnf(c_0_46,plain,
implies(implies(X1,implies(X2,X1)),falsehood) = falsehood,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24]),c_0_43]),c_0_44]) ).
cnf(c_0_47,plain,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_35]),c_0_35]),c_0_35]) ).
cnf(c_0_48,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_46]),c_0_42]) ).
cnf(c_0_49,plain,
implies(X1,implies(X2,implies(X3,falsehood))) = implies(X2,implies(X3,implies(X1,falsehood))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_41]),c_0_24]) ).
cnf(c_0_50,plain,
implies(implies(X1,falsehood),X2) = implies(implies(X2,falsehood),X1),
inference(spm,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_51,plain,
implies(implies(implies(X1,X2),X2),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_44]) ).
cnf(c_0_52,plain,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_24]),c_0_24]) ).
cnf(c_0_53,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_54,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_55,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_56,plain,
implies(implies(implies(X1,X2),falsehood),X3) = implies(X1,implies(implies(X3,falsehood),X2)),
inference(spm,[status(thm)],[c_0_50,c_0_52]) ).
cnf(c_0_57,plain,
implies(implies(X1,X2),implies(implies(implies(X2,X1),X1),falsehood)) = implies(X2,falsehood),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_53]),c_0_54]),c_0_44]),c_0_32]) ).
cnf(c_0_58,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
c_0_55 ).
cnf(c_0_59,plain,
implies(implies(implies(X1,X2),X2),implies(X3,X1)) = implies(X3,implies(X2,X1)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
implies(implies(X1,X2),implies(implies(implies(X2,X1),X1),X3)) = implies(X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_24]),c_0_35]) ).
cnf(c_0_61,negated_conjecture,
implies(b,implies(implies(b,implies(implies(a,b),a)),a)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_52]),c_0_52]) ).
cnf(c_0_62,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_59,c_0_60]),c_0_48]),c_0_44]),c_0_52]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : LCL109-6 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 02:33:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/benchmark/theBenchmark.p
% 1.05/0.59 # Version: 3.1.0
% 1.05/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.05/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.05/0.59 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.59 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.59 # Starting sh5l with 300s (1) cores
% 1.05/0.59 # sh5l with pid 7872 completed with status 0
% 1.05/0.59 # Result found by sh5l
% 1.05/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.05/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.05/0.59 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.59 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.59 # Starting sh5l with 300s (1) cores
% 1.05/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.05/0.59 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1.05/0.59 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.05/0.59 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 1.05/0.59 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 7878 completed with status 0
% 1.05/0.59 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 1.05/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.05/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.05/0.59 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.59 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.59 # Starting sh5l with 300s (1) cores
% 1.05/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.05/0.59 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1.05/0.59 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.05/0.59 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 1.05/0.59 # Preprocessing time : 0.001 s
% 1.05/0.59 # Presaturation interreduction done
% 1.05/0.59
% 1.05/0.59 # Proof found!
% 1.05/0.59 # SZS status Unsatisfiable
% 1.05/0.59 # SZS output start CNFRefutation
% See solution above
% 1.05/0.59 # Parsed axioms : 14
% 1.05/0.59 # Removed by relevancy pruning/SinE : 0
% 1.05/0.59 # Initial clauses : 14
% 1.05/0.59 # Removed in clause preprocessing : 0
% 1.05/0.59 # Initial clauses in saturation : 14
% 1.05/0.59 # Processed clauses : 699
% 1.05/0.59 # ...of these trivial : 340
% 1.05/0.59 # ...subsumed : 227
% 1.05/0.59 # ...remaining for further processing : 132
% 1.05/0.59 # Other redundant clauses eliminated : 0
% 1.05/0.59 # Clauses deleted for lack of memory : 0
% 1.05/0.59 # Backward-subsumed : 4
% 1.05/0.59 # Backward-rewritten : 38
% 1.05/0.59 # Generated clauses : 13869
% 1.05/0.59 # ...of the previous two non-redundant : 6198
% 1.05/0.59 # ...aggressively subsumed : 0
% 1.05/0.59 # Contextual simplify-reflections : 0
% 1.05/0.59 # Paramodulations : 13869
% 1.05/0.59 # Factorizations : 0
% 1.05/0.59 # NegExts : 0
% 1.05/0.59 # Equation resolutions : 0
% 1.05/0.59 # Disequality decompositions : 0
% 1.05/0.59 # Total rewrite steps : 26595
% 1.05/0.59 # ...of those cached : 23348
% 1.05/0.59 # Propositional unsat checks : 0
% 1.05/0.59 # Propositional check models : 0
% 1.05/0.59 # Propositional check unsatisfiable : 0
% 1.05/0.59 # Propositional clauses : 0
% 1.05/0.59 # Propositional clauses after purity: 0
% 1.05/0.59 # Propositional unsat core size : 0
% 1.05/0.59 # Propositional preprocessing time : 0.000
% 1.05/0.59 # Propositional encoding time : 0.000
% 1.05/0.59 # Propositional solver time : 0.000
% 1.05/0.59 # Success case prop preproc time : 0.000
% 1.05/0.59 # Success case prop encoding time : 0.000
% 1.05/0.59 # Success case prop solver time : 0.000
% 1.05/0.59 # Current number of processed clauses : 76
% 1.05/0.59 # Positive orientable unit clauses : 64
% 1.05/0.59 # Positive unorientable unit clauses: 11
% 1.05/0.59 # Negative unit clauses : 1
% 1.05/0.59 # Non-unit-clauses : 0
% 1.05/0.59 # Current number of unprocessed clauses: 5352
% 1.05/0.59 # ...number of literals in the above : 5352
% 1.05/0.59 # Current number of archived formulas : 0
% 1.05/0.59 # Current number of archived clauses : 56
% 1.05/0.59 # Clause-clause subsumption calls (NU) : 0
% 1.05/0.59 # Rec. Clause-clause subsumption calls : 0
% 1.05/0.59 # Non-unit clause-clause subsumptions : 0
% 1.05/0.59 # Unit Clause-clause subsumption calls : 69
% 1.05/0.59 # Rewrite failures with RHS unbound : 0
% 1.05/0.59 # BW rewrite match attempts : 853
% 1.05/0.59 # BW rewrite match successes : 196
% 1.05/0.59 # Condensation attempts : 0
% 1.05/0.59 # Condensation successes : 0
% 1.05/0.59 # Termbank termtop insertions : 175563
% 1.05/0.59 # Search garbage collected termcells : 2
% 1.05/0.59
% 1.05/0.59 # -------------------------------------------------
% 1.05/0.59 # User time : 0.130 s
% 1.05/0.59 # System time : 0.007 s
% 1.05/0.59 # Total time : 0.137 s
% 1.05/0.59 # Maximum resident set size: 1640 pages
% 1.05/0.59
% 1.05/0.59 # -------------------------------------------------
% 1.05/0.59 # User time : 0.130 s
% 1.05/0.59 # System time : 0.010 s
% 1.05/0.59 # Total time : 0.140 s
% 1.05/0.59 # Maximum resident set size: 1700 pages
% 1.05/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------