TSTP Solution File: LCL158-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL158-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:45:14 EDT 2024
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 10 RR)
% Number of literals : 46 ( 45 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
and_star(xor(truth,x),x) != falsehood,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(and_star_definition,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(c_0_11,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_12,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_13,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_14,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_15,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_17,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_18,plain,
implies(implies(not(not(truth)),X1),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
implies(implies(X1,not(not(truth))),not(not(truth))) = truth,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_21,plain,
not(not(truth)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_19]),c_0_12]) ).
cnf(c_0_22,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_12]) ).
cnf(c_0_23,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21]),c_0_21]) ).
cnf(c_0_24,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
and_star(xor(truth,x),x) != falsehood,
inference(fof_simplification,[status(thm)],[prove_alternative_wajsberg_axiom]) ).
cnf(c_0_26,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
and_star_definition ).
cnf(c_0_27,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_28,plain,
implies(implies(X1,not(X2)),not(X2)) = implies(implies(not(X1),X2),X1),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_29,plain,
implies(not(truth),X1) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
and_star(xor(truth,x),x) != falsehood,
c_0_25 ).
cnf(c_0_31,plain,
and_star(X1,X2) = not(implies(not(not(X1)),not(X2))),
inference(rw,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_32,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_33,plain,
and(X1,X2) = not(implies(not(not(X1)),not(X2))),
inference(rw,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_34,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_12]) ).
cnf(c_0_35,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_12]),c_0_21]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
not(implies(not(not(xor(truth,x))),not(x))) != falsehood,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_38,plain,
xor(X1,X2) = implies(not(not(implies(not(not(X1)),not(not(X2))))),not(implies(not(not(not(X1))),not(X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_14]),c_0_33]),c_0_33]) ).
cnf(c_0_39,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
not(implies(not(not(xor(truth,x))),not(x))) != not(truth),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
implies(implies(X1,X2),not(implies(not(X1),not(X2)))) = xor(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_39]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
not(implies(not(not(x)),not(xor(truth,x)))) != not(truth),
inference(rw,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_43,plain,
xor(truth,X1) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_12]),c_0_35]) ).
cnf(c_0_44,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_12]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39]),c_0_39]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL158-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 01:17:38 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/benchmark/theBenchmark.p
% 0.17/0.45 # Version: 3.1.0
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5044 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.45 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.45 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 5048 completed with status 0
% 0.17/0.45 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Unsatisfiable
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 17
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 17
% 0.17/0.45 # Removed in clause preprocessing : 3
% 0.17/0.45 # Initial clauses in saturation : 14
% 0.17/0.45 # Processed clauses : 59
% 0.17/0.45 # ...of these trivial : 15
% 0.17/0.45 # ...subsumed : 2
% 0.17/0.45 # ...remaining for further processing : 42
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 9
% 0.17/0.45 # Generated clauses : 372
% 0.17/0.45 # ...of the previous two non-redundant : 275
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 372
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 466
% 0.17/0.45 # ...of those cached : 346
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 22
% 0.17/0.45 # Positive orientable unit clauses : 16
% 0.17/0.45 # Positive unorientable unit clauses: 4
% 0.17/0.45 # Negative unit clauses : 2
% 0.17/0.45 # Non-unit-clauses : 0
% 0.17/0.45 # Current number of unprocessed clauses: 233
% 0.17/0.45 # ...number of literals in the above : 233
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 23
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 3
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 47
% 0.17/0.45 # BW rewrite match successes : 14
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 5198
% 0.17/0.45 # Search garbage collected termcells : 2
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.005 s
% 0.17/0.45 # System time : 0.001 s
% 0.17/0.45 # Total time : 0.006 s
% 0.17/0.45 # Maximum resident set size: 1636 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.019 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.021 s
% 0.17/0.45 # Maximum resident set size: 1700 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------