TSTP Solution File: LCL155-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL155-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:13 EDT 2024
% Result : Unsatisfiable 0.24s 0.56s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 7 RR)
% Number of literals : 37 ( 36 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_definition) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(and_star_definition,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
xor(x,x) != falsehood,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',and_star_commutativity) ).
cnf(c_0_11,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_12,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_13,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_14,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_15,plain,
implies(or(X1,not(X2)),implies(X2,X1)) = truth,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_17,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_18,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
and_star_definition ).
cnf(c_0_19,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_20,plain,
implies(or(X1,falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_21,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_22,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_14]) ).
cnf(c_0_23,plain,
and(X1,X2) = and_star(X1,X2),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
implies(or(falsehood,X1),X1) = truth,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
or(X1,not(X1)) = truth,
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_26,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_27,plain,
not(or(not(X1),not(X2))) = and_star(X1,X2),
inference(rw,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_28,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]) ).
cnf(c_0_29,negated_conjecture,
xor(x,x) != falsehood,
inference(fof_simplification,[status(thm)],[prove_alternative_wajsberg_axiom]) ).
cnf(c_0_30,plain,
or(and_star(X1,not(X2)),and_star(not(X1),X2)) = xor(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_23]) ).
cnf(c_0_31,plain,
and_star(X1,not(X1)) = falsehood,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_16]) ).
cnf(c_0_32,plain,
or(falsehood,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_28]),c_0_14]) ).
cnf(c_0_33,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_34,negated_conjecture,
xor(x,x) != falsehood,
c_0_29 ).
cnf(c_0_35,plain,
xor(X1,X1) = falsehood,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : LCL155-1 : TPTP v8.2.0. Released v1.0.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n002.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 02:19:08 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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/benchmark/theBenchmark.p
% 0.24/0.56 # Version: 3.1.0
% 0.24/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 # Starting sh5l with 300s (1) cores
% 0.24/0.56 # sh5l with pid 12521 completed with status 0
% 0.24/0.56 # Result found by sh5l
% 0.24/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 # Starting sh5l with 300s (1) cores
% 0.24/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.56 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.24/0.56 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.56 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.24/0.56 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 12528 completed with status 0
% 0.24/0.56 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.24/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 # Starting sh5l with 300s (1) cores
% 0.24/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.56 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.24/0.56 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.56 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.24/0.56 # Preprocessing time : 0.001 s
% 0.24/0.56 # Presaturation interreduction done
% 0.24/0.56
% 0.24/0.56 # Proof found!
% 0.24/0.56 # SZS status Unsatisfiable
% 0.24/0.56 # SZS output start CNFRefutation
% See solution above
% 0.24/0.56 # Parsed axioms : 17
% 0.24/0.56 # Removed by relevancy pruning/SinE : 0
% 0.24/0.56 # Initial clauses : 17
% 0.24/0.56 # Removed in clause preprocessing : 0
% 0.24/0.56 # Initial clauses in saturation : 17
% 0.24/0.56 # Processed clauses : 99
% 0.24/0.56 # ...of these trivial : 19
% 0.24/0.56 # ...subsumed : 11
% 0.24/0.56 # ...remaining for further processing : 69
% 0.24/0.56 # Other redundant clauses eliminated : 0
% 0.24/0.56 # Clauses deleted for lack of memory : 0
% 0.24/0.56 # Backward-subsumed : 0
% 0.24/0.56 # Backward-rewritten : 21
% 0.24/0.56 # Generated clauses : 599
% 0.24/0.56 # ...of the previous two non-redundant : 494
% 0.24/0.56 # ...aggressively subsumed : 0
% 0.24/0.56 # Contextual simplify-reflections : 0
% 0.24/0.56 # Paramodulations : 599
% 0.24/0.56 # Factorizations : 0
% 0.24/0.56 # NegExts : 0
% 0.24/0.56 # Equation resolutions : 0
% 0.24/0.56 # Disequality decompositions : 0
% 0.24/0.56 # Total rewrite steps : 475
% 0.24/0.56 # ...of those cached : 255
% 0.24/0.56 # Propositional unsat checks : 0
% 0.24/0.56 # Propositional check models : 0
% 0.24/0.56 # Propositional check unsatisfiable : 0
% 0.24/0.56 # Propositional clauses : 0
% 0.24/0.56 # Propositional clauses after purity: 0
% 0.24/0.56 # Propositional unsat core size : 0
% 0.24/0.56 # Propositional preprocessing time : 0.000
% 0.24/0.56 # Propositional encoding time : 0.000
% 0.24/0.56 # Propositional solver time : 0.000
% 0.24/0.56 # Success case prop preproc time : 0.000
% 0.24/0.56 # Success case prop encoding time : 0.000
% 0.24/0.56 # Success case prop solver time : 0.000
% 0.24/0.56 # Current number of processed clauses : 33
% 0.24/0.56 # Positive orientable unit clauses : 27
% 0.24/0.56 # Positive unorientable unit clauses: 6
% 0.24/0.56 # Negative unit clauses : 0
% 0.24/0.56 # Non-unit-clauses : 0
% 0.24/0.56 # Current number of unprocessed clauses: 424
% 0.24/0.56 # ...number of literals in the above : 424
% 0.24/0.56 # Current number of archived formulas : 0
% 0.24/0.56 # Current number of archived clauses : 36
% 0.24/0.56 # Clause-clause subsumption calls (NU) : 0
% 0.24/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.24/0.56 # Non-unit clause-clause subsumptions : 0
% 0.24/0.56 # Unit Clause-clause subsumption calls : 4
% 0.24/0.56 # Rewrite failures with RHS unbound : 0
% 0.24/0.56 # BW rewrite match attempts : 121
% 0.24/0.56 # BW rewrite match successes : 61
% 0.24/0.56 # Condensation attempts : 0
% 0.24/0.56 # Condensation successes : 0
% 0.24/0.56 # Termbank termtop insertions : 5992
% 0.24/0.56 # Search garbage collected termcells : 2
% 0.24/0.56
% 0.24/0.56 # -------------------------------------------------
% 0.24/0.56 # User time : 0.007 s
% 0.24/0.56 # System time : 0.003 s
% 0.24/0.56 # Total time : 0.010 s
% 0.24/0.56 # Maximum resident set size: 1624 pages
% 0.24/0.56
% 0.24/0.56 # -------------------------------------------------
% 0.24/0.56 # User time : 0.010 s
% 0.24/0.56 # System time : 0.004 s
% 0.24/0.56 # Total time : 0.014 s
% 0.24/0.56 # Maximum resident set size: 1704 pages
% 0.24/0.56 % E---3.1 exiting
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------