TSTP Solution File: KLE167+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE167+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:04:32 EDT 2023
% Result : Timeout 0.37s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 28 unt; 0 def)
% Number of atoms : 62 ( 36 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 17 ~; 12 |; 4 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn; 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',idempotence) ).
fof(goals,conjecture,
! [X4,X5] :
( ( multiplication(X4,X5) = zero
=> leq(multiplication(X4,star(X5)),X4) )
& leq(X4,multiplication(X4,star(X5))) ),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',goals) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',star_unfold2) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',order) ).
fof(distributivity1,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',distributivity1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',multiplicative_right_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',additive_commutativity) ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox/tmp/tmp.FwFgDKcI39/E---3.1_23577.p',star_induction2) ).
fof(c_0_10,plain,
! [X32,X33,X34] : addition(X34,addition(X33,X32)) = addition(addition(X34,X33),X32),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_11,plain,
! [X35] : addition(X35,X35) = X35,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5] :
( ( multiplication(X4,X5) = zero
=> leq(multiplication(X4,star(X5)),X4) )
& leq(X4,multiplication(X4,star(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_13,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X26] : addition(one,multiplication(star(X26),X26)) = star(X26),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
fof(c_0_16,negated_conjecture,
( ( multiplication(esk1_0,esk2_0) = zero
| ~ leq(esk1_0,multiplication(esk1_0,star(esk2_0))) )
& ( ~ leq(multiplication(esk1_0,star(esk2_0)),esk1_0)
| ~ leq(esk1_0,multiplication(esk1_0,star(esk2_0))) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_17,plain,
! [X14,X15] :
( ( ~ leq(X14,X15)
| addition(X14,X15) = X15 )
& ( addition(X14,X15) != X15
| leq(X14,X15) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_18,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
cnf(c_0_19,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X36] : multiplication(X36,one) = X36,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_22,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
| ~ leq(esk1_0,multiplication(esk1_0,star(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
! [X27] : addition(X27,zero) = X27,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_28,plain,
! [X30,X31] : addition(X30,X31) = addition(X31,X30),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_29,plain,
! [X11,X12,X13] :
( ~ leq(addition(multiplication(X13,X11),X12),X13)
| leq(multiplication(X12,star(X11)),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
cnf(c_0_30,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
| addition(esk1_0,multiplication(esk1_0,star(esk2_0))) != multiplication(esk1_0,star(esk2_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
addition(X1,multiplication(X1,star(X2))) = multiplication(X1,star(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_32,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_36,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( ~ leq(multiplication(esk1_0,star(esk2_0)),esk1_0)
| ~ leq(esk1_0,multiplication(esk1_0,star(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_38,negated_conjecture,
( leq(multiplication(X1,star(esk2_0)),esk1_0)
| ~ leq(X1,esk1_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( ~ leq(esk1_0,multiplication(esk1_0,star(esk2_0)))
| ~ leq(esk1_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
~ leq(esk1_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_23]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_23]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE167+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Oct 3 04:50:01 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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/tmp/tmp.FwFgDKcI39/E---3.1_23577.p
% 0.37/300.09 # Version: 3.1pre001
% 0.37/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.09 # Starting new_bool_1 with 300s (1) cores
% 0.37/300.09 # Starting sh5l with 300s (1) cores
% 0.37/300.09 # new_bool_3 with pid 23676 completed with status 0
% 0.37/300.09 # Result found by new_bool_3
% 0.37/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/300.09 # Search class: FHHSM-FFSF21-MFFFFFNN
% 0.37/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.09 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 0.37/300.09 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 23682 completed with status 0
% 0.37/300.09 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 0.37/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/300.09 # Search class: FHHSM-FFSF21-MFFFFFNN
% 0.37/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.09 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 0.37/300.09 # Preprocessing time : 0.001 s
% 0.37/300.09 # Presaturation interreduction done
% 0.37/300.09
% 0.37/300.09 # Proof found!
% 0.37/300.09 # SZS status Theorem
% 0.37/300.09 # SZS output start CNFRefutation
% See solution above
% 0.37/300.09 # Parsed axioms : 19
% 0.37/300.09 # Removed by relevancy pruning/SinE : 0
% 0.37/300.09 # Initial clauses : 21
% 0.37/300.09 # Removed in clause preprocessing : 0
% 0.37/300.09 # Initial clauses in saturation : 21
% 0.37/300.09 # Processed clauses : 137
% 0.37/300.09 # ...of these trivial : 9
% 0.37/300.09 # ...subsumed : 2
% 0.37/300.09 # ...remaining for further processing : 126
% 0.37/300.09 # Other redundant clauses eliminated : 2
% 0.37/300.09 # Clauses deleted for lack of memory : 0
% 0.37/300.09 # Backward-subsumed : 1
% 0.37/300.09 # Backward-rewritten : 21
% 0.37/300.09 # Generated clauses : 704
% 0.37/300.09 # ...of the previous two non-redundant : 386
% 0.37/300.09 # ...aggressively subsumed : 0
% 0.37/300.09 # Contextual simplify-reflections : 0
% 0.37/300.09 # Paramodulations : 702
% 0.37/300.09 # Factorizations : 0
% 0.37/300.09 # NegExts : 0
% 0.37/300.09 # Equation resolutions : 2
% 0.37/300.09 # Total rewrite steps : 1128
% 0.37/300.09 # Propositional unsat checks : 0
% 0.37/300.09 # Propositional check models : 0
% 0.37/300.09 # Propositional check unsatisfiable : 0
% 0.37/300.09 # Propositional clauses : 0
% 0.37/300.09 # Propositional clauses after purity: 0
% 0.37/300.09 # Propositional unsat core size : 0
% 0.37/300.09 # Propositional preprocessing time : 0.000
% 0.37/300.09 # Propositional encoding time : 0.000
% 0.37/300.09 # Propositional solver time : 0.000
% 0.37/300.09 # Success case prop preproc time : 0.000
% 0.37/300.09 # Success case prop encoding time : 0.000
% 0.37/300.09 # Success case prop solver time : 0.000
% 0.37/300.09 # Current number of processed clauses : 83
% 0.37/300.09 # Positive orientable unit clauses : 47
% 0.37/300.09 # Positive unorientable unit clauses: 1
% 0.37/300.09 # Negative unit clauses : 2
% 0.37/300.09 # Non-unit-clauses : 33
% 0.37/300.09 # Current number of unprocessed clauses: 279
% 0.37/300.09 # ...number of literals in the above : 375
% 0.37/300.09 # Current number of archived formulas : 0
% 0.37/300.09 # Current number of archived clauses : 43
% 0.37/300.09 # Clause-clause subsumption calls (NU) : 118
% 0.37/300.09 # Rec. Clause-clause subsumption calls : 118
% 0.37/300.09 # Non-unit clause-clause subsumptions : 1
% 0.37/300.09 # Unit Clause-clause subsumption calls : 24
% 0.37/300.09 # Rewrite failures with RHS unbound : 0
% 0.37/300.09 # BW rewrite match attempts : 73
% 0.37/300.09 # BW rewrite match successes : 28
% 0.37/300.09 # Condensation attempts : 0
% 0.37/300.09 # Condensation successes : 0
% 0.37/300.09 # Termbank termtop insertions : 9109
% 0.37/300.09
% 0.37/300.09 # -------------------------------------------------
% 0.37/300.09 # User time : 0.010 s
% 0.37/300.09 # System time : 0.004 s
% 0.37/300.09 # Total time : 0.014 s
% 0.37/300.09 # Maximum resident set size: 1712 pages
% 0.37/300.09
% 0.37/300.09 # -------------------------------------------------
% 0.37/300.09 # User time : 0.010 s
% 0.37/300.09 # System time : 0.007 s
% 0.37/300.09 # Total time : 0.018 s
% 0.37/300.09 # Maximum resident set size: 1692 pages
% 0.37/300.09 % E---3.1 exiting
% 0.37/300.09 % E---3.1 exiting
%------------------------------------------------------------------------------