TSTP Solution File: KLE148+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE148+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:05:17 EDT 2023
% Result : Timeout 0.34s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 36 unt; 0 def)
% Number of atoms : 64 ( 48 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 33 ( 16 ~; 10 |; 4 &)
% ( 1 <=>; 2 =>; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 2 sgn; 40 !; 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.n9MLV7ZLQU/E---3.1_5172.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',idempotence) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',additive_commutativity) ).
fof(goals,conjecture,
! [X4,X5] :
( ( multiplication(X4,X5) = zero
=> leq(multiplication(X4,strong_iteration(X5)),X4) )
& leq(X4,multiplication(X4,strong_iteration(X5))) ),
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.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.n9MLV7ZLQU/E---3.1_5172.p',distributivity1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',multiplicative_right_identity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.n9MLV7ZLQU/E---3.1_5172.p',additive_identity) ).
fof(c_0_11,plain,
! [X36,X37,X38] : addition(X38,addition(X37,X36)) = addition(addition(X38,X37),X36),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_12,plain,
! [X39] : addition(X39,X39) = X39,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_13,plain,
! [X28] : strong_iteration(X28) = addition(multiplication(X28,strong_iteration(X28)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_14,plain,
! [X34,X35] : addition(X34,X35) = addition(X35,X34),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,negated_conjecture,
~ ! [X4,X5] :
( ( multiplication(X4,X5) = zero
=> leq(multiplication(X4,strong_iteration(X5)),X4) )
& leq(X4,multiplication(X4,strong_iteration(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_16,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,negated_conjecture,
( ( multiplication(esk1_0,esk2_0) = zero
| ~ leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) )
& ( ~ leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0)
| ~ leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_21,plain,
! [X17,X18] :
( ( ~ leq(X17,X18)
| addition(X17,X18) = X18 )
& ( addition(X17,X18) != X18
| leq(X17,X18) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_22,plain,
! [X22,X23,X24] : multiplication(X22,addition(X23,X24)) = addition(multiplication(X22,X23),multiplication(X22,X24)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
cnf(c_0_23,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X40] : multiplication(X40,one) = X40,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_26,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
| ~ leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0)
| ~ leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
! [X19,X20,X21] : multiplication(X19,multiplication(X20,X21)) = multiplication(multiplication(X19,X20),X21),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_33,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
| addition(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) != multiplication(esk1_0,strong_iteration(esk2_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
addition(X1,multiplication(X1,strong_iteration(X2))) = multiplication(X1,strong_iteration(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
fof(c_0_35,plain,
! [X31] : multiplication(zero,X31) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_36,negated_conjecture,
( addition(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) != esk1_0
| ~ leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_19]) ).
cnf(c_0_37,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_40,plain,
! [X30] : addition(X30,zero) = X30,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_41,negated_conjecture,
( addition(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) != multiplication(esk1_0,strong_iteration(esk2_0))
| addition(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))) != esk1_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_42,plain,
addition(X1,multiplication(X1,multiplication(X2,strong_iteration(X2)))) = multiplication(X1,strong_iteration(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_30]) ).
cnf(c_0_43,negated_conjecture,
multiplication(esk1_0,multiplication(esk2_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_34]),c_0_34])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE148+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 04:45:59 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.n9MLV7ZLQU/E---3.1_5172.p
% 0.34/300.15 # Version: 3.1pre001
% 0.34/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.34/300.15 # Starting sh5l with 300s (1) cores
% 0.34/300.15 # new_bool_1 with pid 5256 completed with status 0
% 0.34/300.15 # Result found by new_bool_1
% 0.34/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.34/300.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/300.15 # Search class: FHHSM-FFSF21-MFFFFFNN
% 0.34/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/300.15 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 0.34/300.15 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with pid 5260 completed with status 0
% 0.34/300.15 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 0.34/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.34/300.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/300.15 # Search class: FHHSM-FFSF21-MFFFFFNN
% 0.34/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/300.15 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 181s (1) cores
% 0.34/300.15 # Preprocessing time : 0.001 s
% 0.34/300.15 # Presaturation interreduction done
% 0.34/300.15
% 0.34/300.15 # Proof found!
% 0.34/300.15 # SZS status Theorem
% 0.34/300.15 # SZS output start CNFRefutation
% See solution above
% 0.34/300.15 # Parsed axioms : 19
% 0.34/300.15 # Removed by relevancy pruning/SinE : 0
% 0.34/300.15 # Initial clauses : 21
% 0.34/300.15 # Removed in clause preprocessing : 0
% 0.34/300.15 # Initial clauses in saturation : 21
% 0.34/300.15 # Processed clauses : 126
% 0.34/300.15 # ...of these trivial : 12
% 0.34/300.15 # ...subsumed : 9
% 0.34/300.15 # ...remaining for further processing : 105
% 0.34/300.15 # Other redundant clauses eliminated : 0
% 0.34/300.15 # Clauses deleted for lack of memory : 0
% 0.34/300.15 # Backward-subsumed : 1
% 0.34/300.15 # Backward-rewritten : 17
% 0.34/300.15 # Generated clauses : 648
% 0.34/300.15 # ...of the previous two non-redundant : 374
% 0.34/300.15 # ...aggressively subsumed : 0
% 0.34/300.15 # Contextual simplify-reflections : 0
% 0.34/300.15 # Paramodulations : 648
% 0.34/300.15 # Factorizations : 0
% 0.34/300.15 # NegExts : 0
% 0.34/300.15 # Equation resolutions : 0
% 0.34/300.15 # Total rewrite steps : 998
% 0.34/300.15 # Propositional unsat checks : 0
% 0.34/300.15 # Propositional check models : 0
% 0.34/300.15 # Propositional check unsatisfiable : 0
% 0.34/300.15 # Propositional clauses : 0
% 0.34/300.15 # Propositional clauses after purity: 0
% 0.34/300.15 # Propositional unsat core size : 0
% 0.34/300.15 # Propositional preprocessing time : 0.000
% 0.34/300.15 # Propositional encoding time : 0.000
% 0.34/300.15 # Propositional solver time : 0.000
% 0.34/300.15 # Success case prop preproc time : 0.000
% 0.34/300.15 # Success case prop encoding time : 0.000
% 0.34/300.15 # Success case prop solver time : 0.000
% 0.34/300.15 # Current number of processed clauses : 66
% 0.34/300.15 # Positive orientable unit clauses : 43
% 0.34/300.15 # Positive unorientable unit clauses: 1
% 0.34/300.15 # Negative unit clauses : 1
% 0.34/300.15 # Non-unit-clauses : 21
% 0.34/300.15 # Current number of unprocessed clauses: 274
% 0.34/300.15 # ...number of literals in the above : 381
% 0.34/300.15 # Current number of archived formulas : 0
% 0.34/300.15 # Current number of archived clauses : 39
% 0.34/300.15 # Clause-clause subsumption calls (NU) : 60
% 0.34/300.15 # Rec. Clause-clause subsumption calls : 60
% 0.34/300.15 # Non-unit clause-clause subsumptions : 9
% 0.34/300.15 # Unit Clause-clause subsumption calls : 17
% 0.34/300.15 # Rewrite failures with RHS unbound : 0
% 0.34/300.15 # BW rewrite match attempts : 43
% 0.34/300.15 # BW rewrite match successes : 24
% 0.34/300.15 # Condensation attempts : 0
% 0.34/300.15 # Condensation successes : 0
% 0.34/300.15 # Termbank termtop insertions : 8395
% 0.34/300.15
% 0.34/300.15 # -------------------------------------------------
% 0.34/300.15 # User time : 0.011 s
% 0.34/300.15 # System time : 0.003 s
% 0.34/300.15 # Total time : 0.014 s
% 0.34/300.15 # Maximum resident set size: 1716 pages
% 0.34/300.15
% 0.34/300.15 # -------------------------------------------------
% 0.34/300.15 # User time : 0.013 s
% 0.34/300.15 # System time : 0.004 s
% 0.34/300.15 # Total time : 0.017 s
% 0.34/300.15 # Maximum resident set size: 1696 pages
% 0.34/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------