TSTP Solution File: KLE034+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE034+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 01:55:30 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 33 unt; 0 def)
% Number of atoms : 93 ( 45 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 69 ( 24 ~; 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 : 73 ( 7 sgn 49 !; 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',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/benchmark/Axioms/KLE001+0.ax',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/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_10,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_11,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_10])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_13,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).
cnf(c_0_14,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_17,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_18,plain,
! [X6,X7,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])])]) ).
cnf(c_0_19,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_21,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X6,X7,X6,X7] :
( ( multiplication(X6,X7) = zero
| ~ complement(X7,X6) )
& ( multiplication(X7,X6) = zero
| ~ complement(X7,X6) )
& ( addition(X6,X7) = one
| ~ complement(X7,X6) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])])]) ).
cnf(c_0_26,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
leq(multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))),zero),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
fof(c_0_28,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_29,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_31,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
fof(c_0_34,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_35,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk3_0,esk1_0),esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
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_21,c_0_27]),c_0_23]) ).
cnf(c_0_37,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
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_29,c_0_30]),c_0_31]) ).
cnf(c_0_39,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]) ).
cnf(c_0_40,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,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_35,c_0_15]),c_0_15]) ).
cnf(c_0_43,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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_15,c_0_36]),c_0_37]),c_0_15]) ).
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,negated_conjecture,
multiplication(esk3_0,multiplication(esk1_0,multiplication(esk2_0,c(esk5_0)))) != zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_23]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE034+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 12:27:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 48
% 0.24/1.42 # Proof object clause steps : 27
% 0.24/1.42 # Proof object formula steps : 21
% 0.24/1.42 # Proof object conjectures : 17
% 0.24/1.42 # Proof object clause conjectures : 14
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 14
% 0.24/1.42 # Proof object initial formulas used : 10
% 0.24/1.42 # Proof object generating inferences : 10
% 0.24/1.42 # Proof object simplifying inferences : 15
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 17
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 28
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 28
% 0.24/1.42 # Processed clauses : 339
% 0.24/1.42 # ...of these trivial : 50
% 0.24/1.42 # ...subsumed : 81
% 0.24/1.42 # ...remaining for further processing : 208
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 3
% 0.24/1.42 # Backward-rewritten : 29
% 0.24/1.42 # Generated clauses : 3498
% 0.24/1.42 # ...of the previous two non-trivial : 2545
% 0.24/1.42 # Contextual simplify-reflections : 30
% 0.24/1.42 # Paramodulations : 3489
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 9
% 0.24/1.42 # Current number of processed clauses : 176
% 0.24/1.42 # Positive orientable unit clauses : 79
% 0.24/1.42 # Positive unorientable unit clauses: 7
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 87
% 0.24/1.42 # Current number of unprocessed clauses: 2137
% 0.24/1.42 # ...number of literals in the above : 3574
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 32
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 914
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 846
% 0.24/1.42 # Non-unit clause-clause subsumptions : 85
% 0.24/1.42 # Unit Clause-clause subsumption calls : 67
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 86
% 0.24/1.42 # BW rewrite match successes : 34
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 43308
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.082 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.085 s
% 0.24/1.42 # Maximum resident set size: 5724 pages
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------