TSTP Solution File: LCL157-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL157-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:57 EDT 2023
% Result : Unsatisfiable 136.31s 136.57s
% Output : CNFRefutation 136.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 7 RR)
% Number of literals : 51 ( 50 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 : 75 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',wajsberg_4) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',or_definition) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',wajsberg_1) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',false_definition) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',wajsberg_3) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',or_commutativity) ).
cnf(and_star_definition,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',and_star_definition) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',and_definition) ).
cnf(or_associativity,axiom,
or(or(X1,X2),X3) = or(X1,or(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',or_associativity) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',and_star_commutativity) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
and_star(x,falsehood) != falsehood,
file('/export/starexec/sandbox/tmp/tmp.hJUCeTTr60/E---3.1_12410.p',prove_alternative_wajsberg_axiom) ).
cnf(c_0_12,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_13,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_14,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_15,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_16,plain,
implies(or(X1,not(X2)),implies(X2,X1)) = truth,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_18,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_19,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_20,plain,
implies(or(X1,falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17]) ).
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_15,c_0_18]),c_0_15]) ).
cnf(c_0_23,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
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_13,c_0_22]) ).
cnf(c_0_26,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
and_star_definition ).
cnf(c_0_28,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_29,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]) ).
cnf(c_0_30,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_31,plain,
and(X1,X2) = and_star(X1,X2),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
or(falsehood,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_29]),c_0_15]) ).
cnf(c_0_33,plain,
or(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_34,plain,
not(or(not(X1),not(X2))) = and_star(X1,X2),
inference(rw,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_35,axiom,
or(or(X1,X2),X3) = or(X1,or(X2,X3)),
or_associativity ).
cnf(c_0_36,plain,
implies(or(not(X1),X2),implies(X1,X2)) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_37,plain,
or(X1,falsehood) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_38,plain,
implies(falsehood,X1) = or(truth,X1),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_39,plain,
or(truth,X1) = truth,
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_40,plain,
or(not(X1),or(not(X2),X3)) = implies(and_star(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_34]),c_0_35]) ).
cnf(c_0_41,plain,
or(X1,implies(X1,falsehood)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_13]) ).
cnf(c_0_42,plain,
implies(falsehood,X1) = truth,
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
implies(and_star(X1,X2),X2) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]),c_0_13]),c_0_37]) ).
cnf(c_0_44,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_45,negated_conjecture,
and_star(x,falsehood) != falsehood,
prove_alternative_wajsberg_axiom ).
cnf(c_0_46,plain,
implies(implies(X1,falsehood),falsehood) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_42]),c_0_15]) ).
cnf(c_0_47,plain,
implies(and_star(X1,X2),X1) = truth,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
and_star(falsehood,x) != falsehood,
inference(rw,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_49,plain,
and_star(falsehood,X1) = falsehood,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_15]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL157-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n022.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 13:07:54 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.hJUCeTTr60/E---3.1_12410.p
% 136.31/136.57 # Version: 3.1pre001
% 136.31/136.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 136.31/136.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.31/136.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 136.31/136.57 # Starting new_bool_3 with 300s (1) cores
% 136.31/136.57 # Starting new_bool_1 with 300s (1) cores
% 136.31/136.57 # Starting sh5l with 300s (1) cores
% 136.31/136.57 # sh5l with pid 12492 completed with status 0
% 136.31/136.57 # Result found by sh5l
% 136.31/136.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 136.31/136.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.31/136.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 136.31/136.57 # Starting new_bool_3 with 300s (1) cores
% 136.31/136.57 # Starting new_bool_1 with 300s (1) cores
% 136.31/136.57 # Starting sh5l with 300s (1) cores
% 136.31/136.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 136.31/136.57 # Search class: FUUPM-FFSF21-MFFFFFNN
% 136.31/136.57 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 136.31/136.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 136.31/136.57 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 12495 completed with status 0
% 136.31/136.57 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 136.31/136.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 136.31/136.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.31/136.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 136.31/136.57 # Starting new_bool_3 with 300s (1) cores
% 136.31/136.57 # Starting new_bool_1 with 300s (1) cores
% 136.31/136.57 # Starting sh5l with 300s (1) cores
% 136.31/136.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 136.31/136.57 # Search class: FUUPM-FFSF21-MFFFFFNN
% 136.31/136.57 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 136.31/136.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 136.31/136.57 # Preprocessing time : 0.001 s
% 136.31/136.57 # Presaturation interreduction done
% 136.31/136.57
% 136.31/136.57 # Proof found!
% 136.31/136.57 # SZS status Unsatisfiable
% 136.31/136.57 # SZS output start CNFRefutation
% See solution above
% 136.31/136.57 # Parsed axioms : 17
% 136.31/136.57 # Removed by relevancy pruning/SinE : 0
% 136.31/136.57 # Initial clauses : 17
% 136.31/136.57 # Removed in clause preprocessing : 0
% 136.31/136.57 # Initial clauses in saturation : 17
% 136.31/136.57 # Processed clauses : 145
% 136.31/136.57 # ...of these trivial : 30
% 136.31/136.57 # ...subsumed : 14
% 136.31/136.57 # ...remaining for further processing : 101
% 136.31/136.57 # Other redundant clauses eliminated : 0
% 136.31/136.57 # Clauses deleted for lack of memory : 0
% 136.31/136.57 # Backward-subsumed : 0
% 136.31/136.57 # Backward-rewritten : 44
% 136.31/136.57 # Generated clauses : 1107
% 136.31/136.57 # ...of the previous two non-redundant : 799
% 136.31/136.57 # ...aggressively subsumed : 0
% 136.31/136.57 # Contextual simplify-reflections : 0
% 136.31/136.57 # Paramodulations : 1107
% 136.31/136.57 # Factorizations : 0
% 136.31/136.57 # NegExts : 0
% 136.31/136.57 # Equation resolutions : 0
% 136.31/136.57 # Total rewrite steps : 1118
% 136.31/136.57 # Propositional unsat checks : 0
% 136.31/136.57 # Propositional check models : 0
% 136.31/136.57 # Propositional check unsatisfiable : 0
% 136.31/136.57 # Propositional clauses : 0
% 136.31/136.57 # Propositional clauses after purity: 0
% 136.31/136.57 # Propositional unsat core size : 0
% 136.31/136.57 # Propositional preprocessing time : 0.000
% 136.31/136.57 # Propositional encoding time : 0.000
% 136.31/136.57 # Propositional solver time : 0.000
% 136.31/136.57 # Success case prop preproc time : 0.000
% 136.31/136.57 # Success case prop encoding time : 0.000
% 136.31/136.57 # Success case prop solver time : 0.000
% 136.31/136.57 # Current number of processed clauses : 42
% 136.31/136.57 # Positive orientable unit clauses : 35
% 136.31/136.57 # Positive unorientable unit clauses: 7
% 136.31/136.57 # Negative unit clauses : 0
% 136.31/136.57 # Non-unit-clauses : 0
% 136.31/136.57 # Current number of unprocessed clauses: 675
% 136.31/136.57 # ...number of literals in the above : 675
% 136.31/136.57 # Current number of archived formulas : 0
% 136.31/136.57 # Current number of archived clauses : 59
% 136.31/136.57 # Clause-clause subsumption calls (NU) : 0
% 136.31/136.57 # Rec. Clause-clause subsumption calls : 0
% 136.31/136.57 # Non-unit clause-clause subsumptions : 0
% 136.31/136.57 # Unit Clause-clause subsumption calls : 5
% 136.31/136.57 # Rewrite failures with RHS unbound : 0
% 136.31/136.57 # BW rewrite match attempts : 177
% 136.31/136.57 # BW rewrite match successes : 90
% 136.31/136.57 # Condensation attempts : 0
% 136.31/136.57 # Condensation successes : 0
% 136.31/136.57 # Termbank termtop insertions : 9813
% 136.31/136.57
% 136.31/136.57 # -------------------------------------------------
% 136.31/136.57 # User time : 0.009 s
% 136.31/136.57 # System time : 0.004 s
% 136.31/136.57 # Total time : 0.013 s
% 136.31/136.57 # Maximum resident set size: 1616 pages
% 136.31/136.57
% 136.31/136.57 # -------------------------------------------------
% 136.31/136.57 # User time : 0.009 s
% 136.31/136.57 # System time : 0.008 s
% 136.31/136.57 # Total time : 0.017 s
% 136.31/136.57 # Maximum resident set size: 1676 pages
% 136.31/136.57 % E---3.1 exiting
%------------------------------------------------------------------------------