TSTP Solution File: KLE040+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE040+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:03:59 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 31 unt; 0 def)
% Number of atoms : 57 ( 29 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 13 ~; 9 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',additive_idempotence) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',order) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',star_unfold_left) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',star_unfold_right) ).
fof(goals,conjecture,
! [X4] :
( leq(multiplication(star(X4),star(X4)),star(X4))
& leq(star(X4),multiplication(star(X4),star(X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',goals) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',star_induction_right) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.bxPorm37ff/E---3.1_24996.p',multiplicative_left_identity) ).
fof(c_0_10,plain,
! [X27,X28,X29] : addition(X29,addition(X28,X27)) = addition(addition(X29,X28),X27),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_11,plain,
! [X30] : addition(X30,X30) = X30,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_12,plain,
! [X25,X26] : addition(X25,X26) = addition(X26,X25),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
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,
! [X6,X7] :
( ( ~ leq(X6,X7)
| addition(X6,X7) = X7 )
& ( addition(X6,X7) != X7
| leq(X6,X7) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_16,plain,
! [X9] : leq(addition(one,multiplication(star(X9),X9)),star(X9)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
fof(c_0_17,plain,
! [X8] : leq(addition(one,multiplication(X8,star(X8))),star(X8)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_18,negated_conjecture,
~ ! [X4] :
( leq(multiplication(star(X4),star(X4)),star(X4))
& leq(star(X4),multiplication(star(X4),star(X4))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_19,plain,
! [X13,X14,X15] :
( ~ leq(addition(multiplication(X13,X14),X15),X13)
| leq(multiplication(X15,star(X14)),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
cnf(c_0_20,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),star(esk1_0)),star(esk1_0))
| ~ leq(star(esk1_0),multiplication(star(esk1_0),star(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_26,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_29,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_30,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13]),c_0_20]) ).
fof(c_0_31,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_32,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_13]),c_0_20]) ).
fof(c_0_33,plain,
! [X32] : multiplication(one,X32) = X32,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_34,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),star(esk1_0)),star(esk1_0))
| ~ leq(star(esk1_0),multiplication(star(esk1_0),star(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13]),c_0_28]) ).
cnf(c_0_36,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_13]),c_0_20]),c_0_21]) ).
cnf(c_0_37,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_39,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
~ leq(star(esk1_0),multiplication(star(esk1_0),star(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29]),c_0_20]),c_0_36])]) ).
cnf(c_0_41,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : KLE040+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n031.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 : Tue Oct 3 05:15:29 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.bxPorm37ff/E---3.1_24996.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # new_bool_1 with pid 25076 completed with status 0
% 0.20/0.53 # Result found by new_bool_1
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FHHSM-FFSF21-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.53 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 25079 completed with status 0
% 0.20/0.53 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FHHSM-FFSF21-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 17
% 0.20/0.53 # Removed by relevancy pruning/SinE : 3
% 0.20/0.53 # Initial clauses : 15
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 15
% 0.20/0.53 # Processed clauses : 253
% 0.20/0.53 # ...of these trivial : 12
% 0.20/0.53 # ...subsumed : 129
% 0.20/0.53 # ...remaining for further processing : 112
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 5
% 0.20/0.53 # Backward-rewritten : 9
% 0.20/0.53 # Generated clauses : 1656
% 0.20/0.53 # ...of the previous two non-redundant : 978
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 1656
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Total rewrite steps : 2150
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 83
% 0.20/0.53 # Positive orientable unit clauses : 30
% 0.20/0.53 # Positive unorientable unit clauses: 3
% 0.20/0.53 # Negative unit clauses : 4
% 0.20/0.53 # Non-unit-clauses : 46
% 0.20/0.53 # Current number of unprocessed clauses: 739
% 0.20/0.53 # ...number of literals in the above : 1358
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 29
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 443
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 443
% 0.20/0.53 # Non-unit clause-clause subsumptions : 118
% 0.20/0.53 # Unit Clause-clause subsumption calls : 18
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 55
% 0.20/0.53 # BW rewrite match successes : 37
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 18042
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.022 s
% 0.20/0.53 # System time : 0.003 s
% 0.20/0.53 # Total time : 0.025 s
% 0.20/0.53 # Maximum resident set size: 1736 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.022 s
% 0.20/0.53 # System time : 0.006 s
% 0.20/0.53 # Total time : 0.029 s
% 0.20/0.53 # Maximum resident set size: 1688 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------