TSTP Solution File: KLE034+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE034+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:45 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% 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 ( 1 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.QGjR026Q1M/E---3.1_10037.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.QGjR026Q1M/E---3.1_10037.p',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.p',order) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.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/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.p',right_distributivity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.p',test_3) ).
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.QGjR026Q1M/E---3.1_10037.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.p',multiplicative_right_identity) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.p',right_annihilation) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.QGjR026Q1M/E---3.1_10037.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(esk5_0)
& test(esk4_0)
& test(esk6_0)
& leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)
& leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero)
& ~ leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X16,X17,X18] : multiplication(X16,multiplication(X17,X18)) = multiplication(multiplication(X16,X17),X18),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_14,plain,
! [X29,X30] :
( ( ~ leq(X29,X30)
| addition(X29,X30) = X30 )
& ( addition(X29,X30) != X30
| leq(X29,X30) ) ),
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,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_18,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_19,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,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_21,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,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_23,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
fof(c_0_25,plain,
! [X35,X36] :
( ( multiplication(X35,X36) = zero
| ~ complement(X36,X35) )
& ( multiplication(X36,X35) = zero
| ~ complement(X36,X35) )
& ( addition(X35,X36) = one
| ~ complement(X36,X35) )
& ( multiplication(X35,X36) != zero
| multiplication(X36,X35) != zero
| addition(X35,X36) != one
| complement(X36,X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_26,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_27,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_28,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_23,c_0_24]),c_0_21]) ).
cnf(c_0_29,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X19] : multiplication(X19,one) = X19,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_33,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,addition(X1,c(esk5_0)))) = multiplication(esk4_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_34,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,negated_conjecture,
leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,esk5_0)) = multiplication(esk4_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
leq(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))),zero),
inference(rw,[status(thm)],[c_0_37,c_0_16]) ).
fof(c_0_40,plain,
! [X27] : multiplication(X27,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
fof(c_0_41,plain,
! [X15] : addition(X15,X15) = X15,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_42,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_43,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,multiplication(esk5_0,X1))) = multiplication(esk4_0,multiplication(esk2_0,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_38]),c_0_16]),c_0_16]) ).
cnf(c_0_44,negated_conjecture,
multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_39]),c_0_21]) ).
cnf(c_0_45,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
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_41]) ).
cnf(c_0_48,negated_conjecture,
~ leq(multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_16]),c_0_16]) ).
cnf(c_0_49,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),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.05/0.10 % Problem : KLE034+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:43:55 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.QGjR026Q1M/E---3.1_10037.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10116 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 811s (1) cores
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.44 # Starting sh5l with 136s (1) cores
% 0.15/0.44 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 10120 completed with status 0
% 0.15/0.44 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 811s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 17
% 0.15/0.44 # Removed by relevancy pruning/SinE : 0
% 0.15/0.44 # Initial clauses : 28
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 28
% 0.15/0.44 # Processed clauses : 146
% 0.15/0.44 # ...of these trivial : 3
% 0.15/0.44 # ...subsumed : 23
% 0.15/0.44 # ...remaining for further processing : 120
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 0
% 0.15/0.44 # Backward-rewritten : 8
% 0.15/0.44 # Generated clauses : 478
% 0.15/0.44 # ...of the previous two non-redundant : 324
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 469
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 9
% 0.15/0.44 # Total rewrite steps : 510
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 84
% 0.15/0.44 # Positive orientable unit clauses : 42
% 0.15/0.44 # Positive unorientable unit clauses: 2
% 0.15/0.44 # Negative unit clauses : 0
% 0.15/0.44 # Non-unit-clauses : 40
% 0.15/0.44 # Current number of unprocessed clauses: 234
% 0.15/0.44 # ...number of literals in the above : 336
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 36
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 176
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 156
% 0.15/0.44 # Non-unit clause-clause subsumptions : 20
% 0.15/0.44 # Unit Clause-clause subsumption calls : 5
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 41
% 0.15/0.44 # BW rewrite match successes : 22
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 6131
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.009 s
% 0.15/0.44 # System time : 0.005 s
% 0.15/0.44 # Total time : 0.014 s
% 0.15/0.44 # Maximum resident set size: 1760 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.049 s
% 0.15/0.44 # System time : 0.011 s
% 0.15/0.44 # Total time : 0.060 s
% 0.15/0.44 # Maximum resident set size: 1688 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------