TSTP Solution File: LCL163-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL163-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:15 EDT 2024
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 6 RR)
% Number of literals : 38 ( 37 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_7,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
cnf(axiom_1,axiom,
not(X1) = xor(X1,truth),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',implies_definition) ).
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
cnf(axiom_4,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_4) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',false_definition) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutativity) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_8) ).
cnf(prove_wajsberg_axiom,negated_conjecture,
implies(implies(x,y),y) != implies(implies(y,x),x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
cnf(c_0_10,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_11,axiom,
not(X1) = xor(X1,truth),
axiom_1 ).
cnf(c_0_12,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_13,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_14,axiom,
and_star(X1,truth) = X1,
axiom_4 ).
cnf(c_0_15,plain,
xor(X1,xor(truth,X2)) = xor(not(X1),X2),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_17,plain,
xor(truth,X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_19,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]),c_0_13]),c_0_11]) ).
cnf(c_0_20,plain,
not(X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11]) ).
cnf(c_0_21,plain,
implies(implies(X1,falsehood),falsehood) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_22,plain,
implies(and_star(X1,implies(X2,falsehood)),falsehood) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_17]),c_0_17]) ).
cnf(c_0_23,plain,
and_star(X1,implies(X2,falsehood)) = implies(implies(X1,X2),falsehood),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_25,plain,
and_star(X1,X2) = implies(implies(X1,implies(X2,falsehood)),falsehood),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_26,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_27,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_24,c_0_25]),c_0_25]) ).
cnf(c_0_28,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_26,c_0_11]),c_0_24]),c_0_11]),c_0_24]) ).
cnf(c_0_29,plain,
implies(X1,implies(X2,falsehood)) = implies(X2,implies(X1,falsehood)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_21]) ).
cnf(c_0_30,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_28,c_0_17]),c_0_20]),c_0_17]),c_0_20]) ).
cnf(c_0_31,plain,
implies(implies(X1,falsehood),implies(X2,falsehood)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_32,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_30,c_0_23]),c_0_23]),c_0_25]),c_0_31]),c_0_25]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
implies(implies(x,y),y) != implies(implies(y,x),x),
inference(fof_simplification,[status(thm)],[prove_wajsberg_axiom]) ).
cnf(c_0_34,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_21,c_0_32]),c_0_21]) ).
cnf(c_0_35,negated_conjecture,
implies(implies(x,y),y) != implies(implies(y,x),x),
c_0_33 ).
cnf(c_0_36,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_34,c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL163-1 : TPTP v8.2.0. Released v1.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 03:15:22 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # sh5l with pid 17335 completed with status 0
% 0.20/0.50 # Result found by sh5l
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.20/0.50 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 17342 completed with status 0
% 0.20/0.50 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 14
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 14
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 14
% 0.20/0.50 # Processed clauses : 84
% 0.20/0.50 # ...of these trivial : 14
% 0.20/0.50 # ...subsumed : 14
% 0.20/0.50 # ...remaining for further processing : 56
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 2
% 0.20/0.50 # Backward-rewritten : 20
% 0.20/0.50 # Generated clauses : 403
% 0.20/0.50 # ...of the previous two non-redundant : 167
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 403
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 758
% 0.20/0.50 # ...of those cached : 646
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 20
% 0.20/0.50 # Positive orientable unit clauses : 14
% 0.20/0.50 # Positive unorientable unit clauses: 6
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 57
% 0.20/0.50 # ...number of literals in the above : 57
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 36
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 10
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 101
% 0.20/0.50 # BW rewrite match successes : 80
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 5198
% 0.20/0.50 # Search garbage collected termcells : 2
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1640 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1700 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------