TSTP Solution File: LCL155-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:23:56 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 8 RR)
% Number of literals : 41 ( 40 equ; 3 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 : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 55 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',wajsberg_4) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',wajsberg_1) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',or_commutativity) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',or_definition) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',wajsberg_3) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',wajsberg_2) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',and_definition) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',xor_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
xor(x,x) != falsehood,
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',prove_alternative_wajsberg_axiom) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p',false_definition) ).
cnf(c_0_10,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_11,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_12,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_13,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_14,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_16,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_17,plain,
implies(implies(not(not(truth)),X1),X1) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_19,plain,
implies(not(not(truth)),not(not(truth))) = truth,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
not(not(truth)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_11]) ).
cnf(c_0_21,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_22,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_11]) ).
cnf(c_0_23,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_11]) ).
cnf(c_0_24,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_25,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_27,plain,
implies(implies(X1,not(X2)),not(X2)) = implies(implies(not(X1),X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_28,plain,
implies(not(truth),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_29,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_30,plain,
and(X1,X2) = not(implies(not(not(X1)),not(X2))),
inference(rw,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_11]) ).
cnf(c_0_32,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_27,c_0_28]),c_0_11]),c_0_20]),c_0_11]) ).
cnf(c_0_33,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_29,c_0_13]),c_0_30]),c_0_30]) ).
cnf(c_0_34,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
xor(x,x) != falsehood,
prove_alternative_wajsberg_axiom ).
cnf(c_0_36,axiom,
not(truth) = falsehood,
false_definition ).
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_33,c_0_34]),c_0_34]),c_0_34]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
xor(x,x) != not(truth),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
xor(X1,X1) = not(truth),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_22]),c_0_22]),c_0_11]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 12:37:44 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.2RXManRf4b/E---3.1_24239.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24388 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.51 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 24393 completed with status 0
% 0.21/0.51 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 17
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 17
% 0.21/0.51 # Removed in clause preprocessing : 3
% 0.21/0.51 # Initial clauses in saturation : 14
% 0.21/0.51 # Processed clauses : 56
% 0.21/0.51 # ...of these trivial : 13
% 0.21/0.51 # ...subsumed : 4
% 0.21/0.51 # ...remaining for further processing : 39
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 9
% 0.21/0.51 # Generated clauses : 383
% 0.21/0.51 # ...of the previous two non-redundant : 293
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 383
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 438
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 19
% 0.21/0.51 # Positive orientable unit clauses : 15
% 0.21/0.51 # Positive unorientable unit clauses: 4
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 0
% 0.21/0.51 # Current number of unprocessed clauses: 259
% 0.21/0.51 # ...number of literals in the above : 259
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 23
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 2
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 60
% 0.21/0.51 # BW rewrite match successes : 14
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 5342
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.010 s
% 0.21/0.51 # Maximum resident set size: 1628 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.038 s
% 0.21/0.51 # System time : 0.010 s
% 0.21/0.51 # Total time : 0.047 s
% 0.21/0.51 # Maximum resident set size: 1676 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------