TSTP Solution File: LCL159-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL159-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:45 EDT 2023
% Result : Unsatisfiable 0.38s 0.62s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 9 RR)
% Number of literals : 50 ( 49 equ; 4 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; 4 con; 0-2 aty)
% Number of variables : 71 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',wajsberg_4) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',wajsberg_1) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',false_definition) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',or_commutativity) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',or_definition) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',wajsberg_3) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',wajsberg_2) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',and_definition) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',xor_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
xor(x,xor(truth,y)) != xor(xor(x,truth),y),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',prove_alternative_wajsberg_axiom) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.krHaDzUcCA/E---3.1_32167.p',xor_commutativity) ).
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,
not(truth) = falsehood,
false_definition ).
cnf(c_0_14,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_15,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_16,plain,
implies(implies(not(X1),falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_18,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_19,plain,
implies(implies(not(falsehood),X1),X1) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_21,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
implies(implies(X1,not(X2)),not(X2)) = implies(implies(not(X1),X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_12]) ).
cnf(c_0_24,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_25,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16]) ).
cnf(c_0_26,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_12]) ).
cnf(c_0_27,plain,
implies(not(X1),truth) = implies(falsehood,X1),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_28,plain,
implies(implies(falsehood,X1),truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_13]) ).
cnf(c_0_29,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_30,plain,
implies(falsehood,X1) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_27]) ).
cnf(c_0_31,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_32,plain,
and(X1,X2) = not(implies(not(not(X1)),not(X2))),
inference(rw,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_33,plain,
implies(not(X1),falsehood) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_12]) ).
cnf(c_0_34,plain,
implies(X1,falsehood) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_12]),c_0_23]),c_0_12]) ).
cnf(c_0_35,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_31,c_0_15]),c_0_32]),c_0_32]) ).
cnf(c_0_36,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,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_35,c_0_36]),c_0_36]),c_0_36]),c_0_36]) ).
cnf(c_0_38,plain,
implies(implies(X1,X2),not(implies(X2,X1))) = xor(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_36]) ).
cnf(c_0_39,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_40,plain,
xor(not(X1),not(X2)) = xor(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
xor(x,xor(truth,y)) != xor(xor(x,truth),y),
prove_alternative_wajsberg_axiom ).
cnf(c_0_42,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_43,plain,
xor(not(X1),X2) = xor(not(X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
xor(y,xor(truth,x)) != xor(x,xor(truth,y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42]) ).
cnf(c_0_45,plain,
xor(truth,X1) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_13]),c_0_12]),c_0_30]),c_0_13]),c_0_34]) ).
cnf(c_0_46,plain,
xor(not(X1),X2) = xor(X1,not(X2)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
xor(y,not(x)) != xor(x,not(y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
cnf(c_0_48,plain,
xor(X1,not(X2)) = xor(X2,not(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_46]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL159-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 11:47:38 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.38/0.54 Running first-order theorem proving
% 0.38/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/tmp/tmp.krHaDzUcCA/E---3.1_32167.p
% 0.38/0.62 # Version: 3.1pre001
% 0.38/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.62 # Starting sh5l with 300s (1) cores
% 0.38/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32246 completed with status 0
% 0.38/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.62 # No SInE strategy applied
% 0.38/0.62 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.38/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.62 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.38/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.62 # Starting new_bool_3 with 136s (1) cores
% 0.38/0.62 # Starting new_bool_1 with 136s (1) cores
% 0.38/0.62 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32253 completed with status 0
% 0.38/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.62 # No SInE strategy applied
% 0.38/0.62 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.38/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.62 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.38/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.62 # Preprocessing time : 0.001 s
% 0.38/0.62 # Presaturation interreduction done
% 0.38/0.62
% 0.38/0.62 # Proof found!
% 0.38/0.62 # SZS status Unsatisfiable
% 0.38/0.62 # SZS output start CNFRefutation
% See solution above
% 0.38/0.62 # Parsed axioms : 17
% 0.38/0.62 # Removed by relevancy pruning/SinE : 0
% 0.38/0.62 # Initial clauses : 17
% 0.38/0.62 # Removed in clause preprocessing : 3
% 0.38/0.62 # Initial clauses in saturation : 14
% 0.38/0.62 # Processed clauses : 182
% 0.38/0.62 # ...of these trivial : 80
% 0.38/0.62 # ...subsumed : 10
% 0.38/0.62 # ...remaining for further processing : 92
% 0.38/0.62 # Other redundant clauses eliminated : 0
% 0.38/0.62 # Clauses deleted for lack of memory : 0
% 0.38/0.62 # Backward-subsumed : 0
% 0.38/0.62 # Backward-rewritten : 26
% 0.38/0.62 # Generated clauses : 3171
% 0.38/0.62 # ...of the previous two non-redundant : 1685
% 0.38/0.62 # ...aggressively subsumed : 0
% 0.38/0.62 # Contextual simplify-reflections : 0
% 0.38/0.62 # Paramodulations : 3171
% 0.38/0.62 # Factorizations : 0
% 0.38/0.62 # NegExts : 0
% 0.38/0.62 # Equation resolutions : 0
% 0.38/0.62 # Total rewrite steps : 5166
% 0.38/0.62 # Propositional unsat checks : 0
% 0.38/0.62 # Propositional check models : 0
% 0.38/0.62 # Propositional check unsatisfiable : 0
% 0.38/0.62 # Propositional clauses : 0
% 0.38/0.62 # Propositional clauses after purity: 0
% 0.38/0.62 # Propositional unsat core size : 0
% 0.38/0.62 # Propositional preprocessing time : 0.000
% 0.38/0.62 # Propositional encoding time : 0.000
% 0.38/0.62 # Propositional solver time : 0.000
% 0.38/0.62 # Success case prop preproc time : 0.000
% 0.38/0.62 # Success case prop encoding time : 0.000
% 0.38/0.62 # Success case prop solver time : 0.000
% 0.38/0.62 # Current number of processed clauses : 55
% 0.38/0.62 # Positive orientable unit clauses : 48
% 0.38/0.62 # Positive unorientable unit clauses: 7
% 0.38/0.62 # Negative unit clauses : 0
% 0.38/0.62 # Non-unit-clauses : 0
% 0.38/0.62 # Current number of unprocessed clauses: 1473
% 0.38/0.62 # ...number of literals in the above : 1473
% 0.38/0.62 # Current number of archived formulas : 0
% 0.38/0.62 # Current number of archived clauses : 40
% 0.38/0.62 # Clause-clause subsumption calls (NU) : 0
% 0.38/0.62 # Rec. Clause-clause subsumption calls : 0
% 0.38/0.62 # Non-unit clause-clause subsumptions : 0
% 0.38/0.62 # Unit Clause-clause subsumption calls : 12
% 0.38/0.62 # Rewrite failures with RHS unbound : 0
% 0.38/0.62 # BW rewrite match attempts : 184
% 0.38/0.62 # BW rewrite match successes : 61
% 0.38/0.62 # Condensation attempts : 0
% 0.38/0.62 # Condensation successes : 0
% 0.38/0.62 # Termbank termtop insertions : 33233
% 0.38/0.62
% 0.38/0.62 # -------------------------------------------------
% 0.38/0.62 # User time : 0.033 s
% 0.38/0.62 # System time : 0.004 s
% 0.38/0.62 # Total time : 0.037 s
% 0.38/0.62 # Maximum resident set size: 1628 pages
% 0.38/0.62
% 0.38/0.62 # -------------------------------------------------
% 0.38/0.62 # User time : 0.308 s
% 0.38/0.62 # System time : 0.012 s
% 0.38/0.62 # Total time : 0.321 s
% 0.38/0.62 # Maximum resident set size: 1676 pages
% 0.38/0.62 % E---3.1 exiting
% 0.38/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------