%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE009+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:15 EDT 2022
% Result : Theorem 0.22s 1.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 21 unt; 0 def)
% Number of atoms : 89 ( 47 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 81 ( 35 ~; 27 |; 13 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 5 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))
& leq(addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
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(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(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_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_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_9,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))
& leq(addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,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])])])])]) ).
fof(c_0_11,negated_conjecture,
( test(esk2_0)
& test(esk1_0)
& ( ~ leq(one,addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))))
| ~ leq(addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),one) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,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_13,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_16,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_17,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( complement(esk2_0,X1)
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ leq(addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),one)
| ~ leq(one,addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( addition(X1,esk2_0) = one
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_24,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_25,negated_conjecture,
( ~ leq(one,addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),multiplication(esk1_0,addition(esk2_0,c(esk2_0))))))
| ~ leq(addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),multiplication(esk1_0,addition(esk2_0,c(esk2_0))))),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_21]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_20]) ).
cnf(c_0_27,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,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_30,negated_conjecture,
( ~ leq(one,addition(esk1_0,c(esk1_0)))
| ~ leq(addition(esk1_0,c(esk1_0)),one) ),
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(rw,[status(thm)],[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_20]),c_0_20]),c_0_28]),c_0_21]),c_0_26]),c_0_27]),c_0_26]),c_0_27]),c_0_20]),c_0_20]),c_0_28]),c_0_21]),c_0_26]),c_0_27]) ).
cnf(c_0_31,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
( addition(esk1_0,addition(one,c(esk1_0))) != one
| ~ leq(one,addition(esk1_0,c(esk1_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( complement(esk1_0,X1)
| c(esk1_0) != X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( addition(one,addition(esk1_0,c(esk1_0))) != addition(esk1_0,c(esk1_0))
| addition(esk1_0,addition(one,c(esk1_0))) != one ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_36,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( addition(X1,esk1_0) = one
| c(esk1_0) != X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
fof(c_0_38,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_39,negated_conjecture,
( addition(one,addition(esk1_0,c(esk1_0))) != addition(esk1_0,c(esk1_0))
| addition(one,addition(esk1_0,c(esk1_0))) != one ),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
addition(esk1_0,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_37]),c_0_20]) ).
cnf(c_0_41,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_40]),c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE009+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 16 08:38:03 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.22/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.39 # Preprocessing time : 0.015 s
% 0.22/1.39
% 0.22/1.39 # Proof found!
% 0.22/1.39 # SZS status Theorem
% 0.22/1.39 # SZS output start CNFRefutation
% See solution above
% 0.22/1.39 # Proof object total steps : 43
% 0.22/1.39 # Proof object clause steps : 24
% 0.22/1.39 # Proof object formula steps : 19
% 0.22/1.39 # Proof object conjectures : 18
% 0.22/1.39 # Proof object clause conjectures : 15
% 0.22/1.39 # Proof object formula conjectures : 3
% 0.22/1.39 # Proof object initial clauses used : 11
% 0.22/1.39 # Proof object initial formulas used : 9
% 0.22/1.39 # Proof object generating inferences : 9
% 0.22/1.39 # Proof object simplifying inferences : 34
% 0.22/1.39 # Training examples: 0 positive, 0 negative
% 0.22/1.39 # Parsed axioms : 17
% 0.22/1.39 # Removed by relevancy pruning/SinE : 0
% 0.22/1.39 # Initial clauses : 25
% 0.22/1.39 # Removed in clause preprocessing : 0
% 0.22/1.39 # Initial clauses in saturation : 25
% 0.22/1.39 # Processed clauses : 87
% 0.22/1.39 # ...of these trivial : 7
% 0.22/1.39 # ...subsumed : 11
% 0.22/1.39 # ...remaining for further processing : 69
% 0.22/1.39 # Other redundant clauses eliminated : 0
% 0.22/1.39 # Clauses deleted for lack of memory : 0
% 0.22/1.39 # Backward-subsumed : 0
% 0.22/1.39 # Backward-rewritten : 7
% 0.22/1.39 # Generated clauses : 352
% 0.22/1.39 # ...of the previous two non-trivial : 245
% 0.22/1.39 # Contextual simplify-reflections : 4
% 0.22/1.39 # Paramodulations : 346
% 0.22/1.39 # Factorizations : 0
% 0.22/1.39 # Equation resolutions : 6
% 0.22/1.39 # Current number of processed clauses : 62
% 0.22/1.39 # Positive orientable unit clauses : 26
% 0.22/1.39 # Positive unorientable unit clauses: 3
% 0.22/1.39 # Negative unit clauses : 0
% 0.22/1.39 # Non-unit-clauses : 33
% 0.22/1.39 # Current number of unprocessed clauses: 182
% 0.22/1.39 # ...number of literals in the above : 217
% 0.22/1.39 # Current number of archived formulas : 0
% 0.22/1.39 # Current number of archived clauses : 7
% 0.22/1.39 # Clause-clause subsumption calls (NU) : 80
% 0.22/1.39 # Rec. Clause-clause subsumption calls : 75
% 0.22/1.39 # Non-unit clause-clause subsumptions : 11
% 0.22/1.39 # Unit Clause-clause subsumption calls : 16
% 0.22/1.39 # Rewrite failures with RHS unbound : 0
% 0.22/1.39 # BW rewrite match attempts : 45
% 0.22/1.39 # BW rewrite match successes : 38
% 0.22/1.39 # Condensation attempts : 0
% 0.22/1.39 # Condensation successes : 0
% 0.22/1.39 # Termbank termtop insertions : 3758
% 0.22/1.39
% 0.22/1.39 # -------------------------------------------------
% 0.22/1.39 # User time : 0.021 s
% 0.22/1.39 # System time : 0.002 s
% 0.22/1.39 # Total time : 0.023 s
% 0.22/1.39 # Maximum resident set size: 3080 pages
%------------------------------------------------------------------------------