TSTP Solution File: KLE035+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE035+1 : 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:03:58 EDT 2023
% Result : Theorem 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 33 unt; 0 def)
% Number of atoms : 58 ( 30 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 26 ( 8 ~; 4 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn; 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7] :
( ( test(X7)
& test(X6)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X6,X5),c(X7)),zero) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',order) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',additive_identity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',right_distributivity) ).
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.ellG4x40NW/E---3.1_390.p',left_distributivity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',additive_commutativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ellG4x40NW/E---3.1_390.p',additive_idempotence) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5,X6,X7] :
( ( test(X7)
& test(X6)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X6,X5),c(X7)),zero) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,negated_conjecture,
( test(esk5_0)
& test(esk4_0)
& leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)
& leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero)
& ~ leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X15,X16,X17] : multiplication(X15,multiplication(X16,X17)) = multiplication(multiplication(X15,X16),X17),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_11,plain,
! [X28,X29] :
( ( ~ leq(X28,X29)
| addition(X28,X29) = X29 )
& ( addition(X28,X29) != X29
| leq(X28,X29) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_12,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X13] : addition(X13,zero) = X13,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_15,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X20,X21,X22] : multiplication(X20,addition(X21,X22)) = addition(multiplication(X20,X21),multiplication(X20,X22)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_17,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
fof(c_0_21,plain,
! [X23,X24,X25] : multiplication(addition(X23,X24),X25) = addition(multiplication(X23,X25),multiplication(X24,X25)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_22,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_19]) ).
fof(c_0_25,plain,
! [X8,X9] : addition(X8,X9) = addition(X9,X8),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_26,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk4_0,addition(X1,multiplication(esk2_0,c(esk5_0)))) = multiplication(esk4_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk4_0,addition(X1,multiplication(esk3_0,c(esk5_0)))) = multiplication(esk4_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_19]) ).
cnf(c_0_29,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,plain,
! [X14] : addition(X14,X14) = X14,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_31,negated_conjecture,
~ leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
addition(multiplication(esk4_0,X1),multiplication(X2,addition(X1,multiplication(esk2_0,c(esk5_0))))) = multiplication(addition(esk4_0,X2),addition(X1,multiplication(esk2_0,c(esk5_0)))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
multiplication(esk4_0,addition(multiplication(esk3_0,c(esk5_0)),X1)) = multiplication(esk4_0,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,negated_conjecture,
~ leq(multiplication(esk4_0,multiplication(addition(esk2_0,esk3_0),c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_37,negated_conjecture,
multiplication(esk4_0,multiplication(addition(esk2_0,esk3_0),c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]),c_0_23]),c_0_34]),c_0_34]),c_0_26]),c_0_29]) ).
cnf(c_0_38,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE035+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 04:43:59 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.ellG4x40NW/E---3.1_390.p
% 0.19/0.53 # Version: 3.1pre001
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 469 completed with status 0
% 0.19/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # No SInE strategy applied
% 0.19/0.53 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.19/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 811s (1) cores
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.53 # Starting sh5l with 136s (1) cores
% 0.19/0.53 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 474 completed with status 0
% 0.19/0.53 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # No SInE strategy applied
% 0.19/0.53 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.19/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 811s (1) cores
% 0.19/0.53 # Preprocessing time : 0.001 s
% 0.19/0.53 # Presaturation interreduction done
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Theorem
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 17
% 0.19/0.53 # Removed by relevancy pruning/SinE : 0
% 0.19/0.53 # Initial clauses : 27
% 0.19/0.53 # Removed in clause preprocessing : 0
% 0.19/0.53 # Initial clauses in saturation : 27
% 0.19/0.53 # Processed clauses : 607
% 0.19/0.53 # ...of these trivial : 55
% 0.19/0.53 # ...subsumed : 250
% 0.19/0.53 # ...remaining for further processing : 302
% 0.19/0.53 # Other redundant clauses eliminated : 0
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 8
% 0.19/0.53 # Backward-rewritten : 14
% 0.19/0.53 # Generated clauses : 3751
% 0.19/0.53 # ...of the previous two non-redundant : 2879
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 0
% 0.19/0.53 # Paramodulations : 3741
% 0.19/0.53 # Factorizations : 0
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 10
% 0.19/0.53 # Total rewrite steps : 4476
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 253
% 0.19/0.53 # Positive orientable unit clauses : 149
% 0.19/0.53 # Positive unorientable unit clauses: 5
% 0.19/0.53 # Negative unit clauses : 0
% 0.19/0.53 # Non-unit-clauses : 99
% 0.19/0.53 # Current number of unprocessed clauses: 2321
% 0.19/0.53 # ...number of literals in the above : 3460
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 49
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 1691
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 1615
% 0.19/0.53 # Non-unit clause-clause subsumptions : 232
% 0.19/0.53 # Unit Clause-clause subsumption calls : 120
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 208
% 0.19/0.53 # BW rewrite match successes : 38
% 0.19/0.53 # Condensation attempts : 0
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 57583
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.045 s
% 0.19/0.53 # System time : 0.002 s
% 0.19/0.53 # Total time : 0.047 s
% 0.19/0.53 # Maximum resident set size: 1748 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.210 s
% 0.19/0.53 # System time : 0.011 s
% 0.19/0.53 # Total time : 0.221 s
% 0.19/0.53 # Maximum resident set size: 1688 pages
% 0.19/0.53 % E---3.1 exiting
% 0.19/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------