TSTP Solution File: LCL155-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n014.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:55:41 EDT 2024
% Result : Timeout 300.29s 100.61s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 7 RR)
% Number of literals : 32 ( 31 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 : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 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(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
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(prove_alternative_wajsberg_axiom,negated_conjecture,
xor(x,x) != falsehood,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
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(and_commutativity,axiom,
and(X1,X2) = and(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_commutativity) ).
cnf(c_0_10,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_11,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_12,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_13,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_14,plain,
implies(or(X1,not(X2)),implies(X2,X1)) = truth,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_16,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
implies(or(X1,falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_18,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_19,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_13]) ).
cnf(c_0_20,plain,
implies(or(falsehood,X1),X1) = truth,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
or(X1,not(X1)) = truth,
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_22,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_23,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_13]) ).
cnf(c_0_24,negated_conjecture,
xor(x,x) != falsehood,
inference(fof_simplification,[status(thm)],[prove_alternative_wajsberg_axiom]) ).
cnf(c_0_25,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_26,plain,
and(X1,not(X1)) = falsehood,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_15]) ).
cnf(c_0_27,plain,
or(falsehood,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_13]) ).
cnf(c_0_28,axiom,
and(X1,X2) = and(X2,X1),
and_commutativity ).
cnf(c_0_29,negated_conjecture,
xor(x,x) != falsehood,
c_0_24 ).
cnf(c_0_30,plain,
xor(X1,X1) = falsehood,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL155-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 02:19:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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/benchmark/theBenchmark.p
% 300.29/100.61 # Version: 3.1.0
% 300.29/100.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.29/100.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.29/100.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.29/100.61 # Starting new_bool_3 with 300s (1) cores
% 300.29/100.61 # Starting new_bool_1 with 300s (1) cores
% 300.29/100.61 # Starting sh5l with 300s (1) cores
% 300.29/100.61 # new_bool_1 with pid 4721 completed with status 0
% 300.29/100.61 # Result found by new_bool_1
% 300.29/100.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.29/100.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.29/100.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.29/100.61 # Starting new_bool_3 with 300s (1) cores
% 300.29/100.61 # Starting new_bool_1 with 300s (1) cores
% 300.29/100.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.29/100.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 300.29/100.61 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 300.29/100.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 300.29/100.61 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 4727 completed with status 0
% 300.29/100.61 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 300.29/100.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.29/100.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.29/100.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.29/100.61 # Starting new_bool_3 with 300s (1) cores
% 300.29/100.61 # Starting new_bool_1 with 300s (1) cores
% 300.29/100.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.29/100.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 300.29/100.61 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 300.29/100.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 300.29/100.61 # Preprocessing time : 0.001 s
% 300.29/100.61 # Presaturation interreduction done
% 300.29/100.61
% 300.29/100.61 # Proof found!
% 300.29/100.61 # SZS status Unsatisfiable
% 300.29/100.61 # SZS output start CNFRefutation
% See solution above
% 300.29/100.61 # Parsed axioms : 17
% 300.29/100.61 # Removed by relevancy pruning/SinE : 3
% 300.29/100.61 # Initial clauses : 14
% 300.29/100.61 # Removed in clause preprocessing : 0
% 300.29/100.61 # Initial clauses in saturation : 14
% 300.29/100.61 # Processed clauses : 99
% 300.29/100.61 # ...of these trivial : 12
% 300.29/100.61 # ...subsumed : 20
% 300.29/100.61 # ...remaining for further processing : 67
% 300.29/100.61 # Other redundant clauses eliminated : 0
% 300.29/100.61 # Clauses deleted for lack of memory : 0
% 300.29/100.61 # Backward-subsumed : 0
% 300.29/100.61 # Backward-rewritten : 16
% 300.29/100.61 # Generated clauses : 705
% 300.29/100.61 # ...of the previous two non-redundant : 586
% 300.29/100.61 # ...aggressively subsumed : 0
% 300.29/100.61 # Contextual simplify-reflections : 0
% 300.29/100.61 # Paramodulations : 705
% 300.29/100.61 # Factorizations : 0
% 300.29/100.61 # NegExts : 0
% 300.29/100.61 # Equation resolutions : 0
% 300.29/100.61 # Disequality decompositions : 0
% 300.29/100.61 # Total rewrite steps : 534
% 300.29/100.61 # ...of those cached : 281
% 300.29/100.61 # Propositional unsat checks : 0
% 300.29/100.61 # Propositional check models : 0
% 300.29/100.61 # Propositional check unsatisfiable : 0
% 300.29/100.61 # Propositional clauses : 0
% 300.29/100.61 # Propositional clauses after purity: 0
% 300.29/100.61 # Propositional unsat core size : 0
% 300.29/100.61 # Propositional preprocessing time : 0.000
% 300.29/100.61 # Propositional encoding time : 0.000
% 300.29/100.61 # Propositional solver time : 0.000
% 300.29/100.61 # Success case prop preproc time : 0.000
% 300.29/100.61 # Success case prop encoding time : 0.000
% 300.29/100.61 # Success case prop solver time : 0.000
% 300.29/100.61 # Current number of processed clauses : 37
% 300.29/100.61 # Positive orientable unit clauses : 29
% 300.29/100.61 # Positive unorientable unit clauses: 8
% 300.29/100.61 # Negative unit clauses : 0
% 300.29/100.61 # Non-unit-clauses : 0
% 300.29/100.61 # Current number of unprocessed clauses: 513
% 300.29/100.61 # ...number of literals in the above : 513
% 300.29/100.61 # Current number of archived formulas : 0
% 300.29/100.61 # Current number of archived clauses : 30
% 300.29/100.61 # Clause-clause subsumption calls (NU) : 0
% 300.29/100.61 # Rec. Clause-clause subsumption calls : 0
% 300.29/100.61 # Non-unit clause-clause subsumptions : 0
% 300.29/100.61 # Unit Clause-clause subsumption calls : 6
% 300.29/100.61 # Rewrite failures with RHS unbound : 0
% 300.29/100.61 # BW rewrite match attempts : 100
% 300.29/100.61 # BW rewrite match successes : 47
% 300.29/100.61 # Condensation attempts : 0
% 300.29/100.61 # Condensation successes : 0
% 300.29/100.61 # Termbank termtop insertions : 6631
% 300.29/100.61 # Search garbage collected termcells : 10
% 300.29/100.61
% 300.29/100.61 # -------------------------------------------------
% 300.29/100.61 # User time : 0.007 s
% 300.29/100.61 # System time : 0.003 s
% 300.29/100.61 # Total time : 0.010 s
% 300.29/100.61 # Maximum resident set size: 1624 pages
% 300.29/100.61
% 300.29/100.61 # -------------------------------------------------
% 300.29/100.61 # User time : 0.008 s
% 300.29/100.61 # System time : 0.006 s
% 300.29/100.61 # Total time : 0.014 s
% 300.29/100.61 # Maximum resident set size: 1704 pages
% 300.29/100.61 % E---3.1 exiting
%------------------------------------------------------------------------------