TSTP Solution File: KLE034+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE034+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : Timeout 408.51s 300.23s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 37 unt; 0 def)
% Number of atoms : 97 ( 48 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 68 ( 23 ~; 19 |; 20 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 72 ( 2 sgn; 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X6)
& test(X8)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X7,X5),c(X8)),zero) )
=> leq(multiplication(multiplication(multiplication(X6,X4),X5),c(X8)),zero) ),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',order) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',additive_commutativity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',test_3) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',left_distributivity) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',test_2) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',left_annihilation) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',multiplicative_left_identity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.pM1X8CXUg4/E---3.1_28983.p',additive_idempotence) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X6)
& test(X8)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X7,X5),c(X8)),zero) )
=> leq(multiplication(multiplication(multiplication(X6,X4),X5),c(X8)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,negated_conjecture,
( test(esk4_0)
& test(esk3_0)
& test(esk5_0)
& leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero)
& leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)
& ~ leq(multiplication(multiplication(multiplication(esk3_0,esk1_0),esk2_0),c(esk5_0)),zero) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X22,X23,X24] : multiplication(X22,multiplication(X23,X24)) = multiplication(multiplication(X22,X23),X24),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_14,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])]) ).
cnf(c_0_15,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X16] : addition(X16,zero) = X16,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_18,plain,
! [X43,X44] : addition(X43,X44) = addition(X44,X43),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_19,plain,
! [X37,X38] :
( ( c(X37) != X38
| complement(X37,X38)
| ~ test(X37) )
& ( ~ complement(X37,X38)
| c(X37) = X38
| ~ test(X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_20,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X30,X31,X32] : multiplication(addition(X30,X31),X32) = addition(multiplication(X30,X32),multiplication(X31,X32)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X19,X20] :
( ( multiplication(X19,X20) = zero
| ~ complement(X20,X19) )
& ( multiplication(X20,X19) = zero
| ~ complement(X20,X19) )
& ( addition(X19,X20) = one
| ~ complement(X20,X19) )
& ( multiplication(X19,X20) != zero
| multiplication(X20,X19) != zero
| addition(X19,X20) != one
| complement(X20,X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_27,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
leq(multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))),zero),
inference(rw,[status(thm)],[c_0_20,c_0_16]) ).
fof(c_0_29,plain,
! [X18] : multiplication(zero,X18) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_30,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_27]) ).
fof(c_0_35,plain,
! [X26] : multiplication(one,X26) = X26,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_36,negated_conjecture,
multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_24]) ).
cnf(c_0_37,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
multiplication(addition(esk4_0,X1),multiplication(esk2_0,c(esk5_0))) = multiplication(X1,multiplication(esk2_0,c(esk5_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25]) ).
cnf(c_0_40,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_42,plain,
! [X48] : addition(X48,X48) = X48,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_43,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk3_0,esk1_0),esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,negated_conjecture,
multiplication(esk3_0,multiplication(esk1_0,multiplication(c(esk4_0),X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_36]),c_0_37]),c_0_16]) ).
cnf(c_0_45,negated_conjecture,
multiplication(c(esk4_0),multiplication(esk2_0,c(esk5_0))) = multiplication(esk2_0,c(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_46,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_47,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
~ leq(multiplication(esk3_0,multiplication(esk1_0,multiplication(esk2_0,c(esk5_0)))),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_16]),c_0_16]) ).
cnf(c_0_49,negated_conjecture,
multiplication(esk3_0,multiplication(esk1_0,multiplication(esk2_0,c(esk5_0)))) = zero,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : KLE034+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n004.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:43:15 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/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.pM1X8CXUg4/E---3.1_28983.p
% 408.51/300.23 # Version: 3.1pre001
% 408.51/300.23 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.51/300.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.51/300.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.51/300.23 # Starting new_bool_3 with 300s (1) cores
% 408.51/300.23 # Starting new_bool_1 with 300s (1) cores
% 408.51/300.23 # Starting sh5l with 300s (1) cores
% 408.51/300.23 # sh5l with pid 29064 completed with status 0
% 408.51/300.23 # Result found by sh5l
% 408.51/300.23 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.51/300.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.51/300.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.51/300.23 # Starting new_bool_3 with 300s (1) cores
% 408.51/300.23 # Starting new_bool_1 with 300s (1) cores
% 408.51/300.23 # Starting sh5l with 300s (1) cores
% 408.51/300.23 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.51/300.23 # Search class: FGUSM-FFMS21-MFFFFFNN
% 408.51/300.23 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.51/300.23 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 181s (1) cores
% 408.51/300.23 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 29072 completed with status 0
% 408.51/300.23 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 408.51/300.23 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.51/300.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.51/300.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.51/300.23 # Starting new_bool_3 with 300s (1) cores
% 408.51/300.23 # Starting new_bool_1 with 300s (1) cores
% 408.51/300.23 # Starting sh5l with 300s (1) cores
% 408.51/300.23 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.51/300.23 # Search class: FGUSM-FFMS21-MFFFFFNN
% 408.51/300.23 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.51/300.23 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 181s (1) cores
% 408.51/300.23 # Preprocessing time : 0.001 s
% 408.51/300.23 # Presaturation interreduction done
% 408.51/300.23
% 408.51/300.23 # Proof found!
% 408.51/300.23 # SZS status Theorem
% 408.51/300.23 # SZS output start CNFRefutation
% See solution above
% 408.51/300.23 # Parsed axioms : 19
% 408.51/300.23 # Removed by relevancy pruning/SinE : 0
% 408.51/300.23 # Initial clauses : 30
% 408.51/300.23 # Removed in clause preprocessing : 0
% 408.51/300.23 # Initial clauses in saturation : 30
% 408.51/300.23 # Processed clauses : 562
% 408.51/300.23 # ...of these trivial : 17
% 408.51/300.23 # ...subsumed : 266
% 408.51/300.23 # ...remaining for further processing : 279
% 408.51/300.23 # Other redundant clauses eliminated : 0
% 408.51/300.23 # Clauses deleted for lack of memory : 0
% 408.51/300.23 # Backward-subsumed : 7
% 408.51/300.23 # Backward-rewritten : 12
% 408.51/300.23 # Generated clauses : 3464
% 408.51/300.23 # ...of the previous two non-redundant : 2552
% 408.51/300.23 # ...aggressively subsumed : 0
% 408.51/300.23 # Contextual simplify-reflections : 14
% 408.51/300.23 # Paramodulations : 3455
% 408.51/300.23 # Factorizations : 0
% 408.51/300.23 # NegExts : 0
% 408.51/300.23 # Equation resolutions : 9
% 408.51/300.23 # Total rewrite steps : 4179
% 408.51/300.23 # Propositional unsat checks : 0
% 408.51/300.23 # Propositional check models : 0
% 408.51/300.23 # Propositional check unsatisfiable : 0
% 408.51/300.23 # Propositional clauses : 0
% 408.51/300.23 # Propositional clauses after purity: 0
% 408.51/300.23 # Propositional unsat core size : 0
% 408.51/300.23 # Propositional preprocessing time : 0.000
% 408.51/300.23 # Propositional encoding time : 0.000
% 408.51/300.23 # Propositional solver time : 0.000
% 408.51/300.23 # Success case prop preproc time : 0.000
% 408.51/300.23 # Success case prop encoding time : 0.000
% 408.51/300.23 # Success case prop solver time : 0.000
% 408.51/300.23 # Current number of processed clauses : 230
% 408.51/300.23 # Positive orientable unit clauses : 78
% 408.51/300.23 # Positive unorientable unit clauses: 3
% 408.51/300.23 # Negative unit clauses : 0
% 408.51/300.23 # Non-unit-clauses : 149
% 408.51/300.23 # Current number of unprocessed clauses: 2048
% 408.51/300.23 # ...number of literals in the above : 4951
% 408.51/300.23 # Current number of archived formulas : 0
% 408.51/300.23 # Current number of archived clauses : 49
% 408.51/300.23 # Clause-clause subsumption calls (NU) : 2968
% 408.51/300.23 # Rec. Clause-clause subsumption calls : 2445
% 408.51/300.23 # Non-unit clause-clause subsumptions : 272
% 408.51/300.23 # Unit Clause-clause subsumption calls : 59
% 408.51/300.23 # Rewrite failures with RHS unbound : 0
% 408.51/300.23 # BW rewrite match attempts : 102
% 408.51/300.23 # BW rewrite match successes : 38
% 408.51/300.23 # Condensation attempts : 0
% 408.51/300.23 # Condensation successes : 0
% 408.51/300.23 # Termbank termtop insertions : 50416
% 408.51/300.23
% 408.51/300.23 # -------------------------------------------------
% 408.51/300.23 # User time : 0.051 s
% 408.51/300.23 # System time : 0.006 s
% 408.51/300.23 # Total time : 0.057 s
% 408.51/300.23 # Maximum resident set size: 1712 pages
% 408.51/300.23
% 408.51/300.23 # -------------------------------------------------
% 408.51/300.23 # User time : 0.052 s
% 408.51/300.23 # System time : 0.008 s
% 408.51/300.23 # Total time : 0.060 s
% 408.51/300.23 # Maximum resident set size: 1692 pages
% 408.51/300.24 % E---3.1 exiting
% 408.51/300.24 % E---3.1 exiting
%------------------------------------------------------------------------------