%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : KLE146+1 : TPTP v9.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 : 300s
% DateTime : Thu Jul 24 07:31:45 PM UTC 2025
% Result : Theorem 3.61s 0.82s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 21 unt; 0 def)
% Number of atoms : 27 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,plain,
! [X0] : leq(one,strong_iteration(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(goals_negated,plain,
~ ! [X0] : leq(one,strong_iteration(X0)),
inference(negate_conjecture,[status(cth)],[goals]) ).
cnf(19,plain,
~ leq(one,strong_iteration(sK1)),
inference(cnf,[status(esa)],[goals_negated]) ).
cnf(l0,plain,
~ leq(one,strong_iteration(sK1)),
inference(instantiation,[status(thm)],[19]) ).
fof(order,plain,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('Axioms/KLE004+0.ax',order) ).
cnf(18,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf,[status(esa)],[order]) ).
cnf(l3,plain,
( addition(one,addition(one,multiplication(sK1,strong_iteration(sK1)))) != addition(one,multiplication(sK1,strong_iteration(sK1)))
| leq(one,addition(one,multiplication(sK1,strong_iteration(sK1)))) ),
inference(instantiation,[status(thm)],[18]) ).
fof(multiplicative_right_identity,plain,
! [A] : multiplication(A,one) = A,
file('Axioms/KLE004+0.ax',multiplicative_right_identity) ).
cnf(5,plain,
multiplication(X0,one) = X0,
inference(cnf,[status(esa)],[multiplicative_right_identity]) ).
cnf(l7,plain,
multiplication(addition(multiplication(sK1,strong_iteration(sK1)),one),one) = addition(multiplication(sK1,strong_iteration(sK1)),one),
inference(instantiation,[status(thm)],[5]) ).
fof(infty_unfold1,plain,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
file('Axioms/KLE004+0.ax',infty_unfold1) ).
cnf(14,plain,
strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf,[status(esa)],[infty_unfold1]) ).
cnf(l14,plain,
strong_iteration(sK1) = addition(multiplication(sK1,strong_iteration(sK1)),one),
inference(instantiation,[status(thm)],[14]) ).
cnf(l18,plain,
multiplication(addition(multiplication(sK1,strong_iteration(sK1)),one),one) = addition(multiplication(sK1,strong_iteration(sK1)),one),
inference(instantiation,[status(thm)],[5]) ).
fof(additive_commutativity,plain,
! [A,B] : addition(A,B) = addition(B,A),
file('Axioms/KLE004+0.ax',additive_commutativity) ).
cnf(0,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf,[status(esa)],[additive_commutativity]) ).
cnf(l17,plain,
addition(multiplication(sK1,strong_iteration(sK1)),one) = addition(one,multiplication(sK1,strong_iteration(sK1))),
inference(instantiation,[status(thm)],[0]) ).
fof(idempotence,plain,
! [A] : addition(A,A) = A,
file('Axioms/KLE004+0.ax',idempotence) ).
cnf(3,plain,
addition(X0,X0) = X0,
inference(cnf,[status(esa)],[idempotence]) ).
cnf(l20,plain,
addition(one,one) = one,
inference(instantiation,[status(thm)],[3]) ).
fof(additive_associativity,plain,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
file('Axioms/KLE004+0.ax',additive_associativity) ).
cnf(1,plain,
addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
inference(cnf,[status(esa)],[additive_associativity]) ).
cnf(l10,plain,
addition(one,addition(one,multiplication(sK1,strong_iteration(sK1)))) = addition(addition(one,one),multiplication(sK1,strong_iteration(sK1))),
inference(instantiation,[status(thm)],[1]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l3,l7,l14,l18,l17,l20,l10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE146+1 : TPTP v9.0.0. Released v4.0.0.
% 0.03/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jul 20 21:46:04 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.33 % launching worker at depth: 2
% 0.12/0.33 % launching worker at depth: 4
% 0.12/0.33 % launching worker at depth: 7
% 0.12/0.33 % launching worker at depth: 5
% 0.12/0.33 % launching worker at depth: 3
% 0.12/0.33 % launching worker at depth: 6
% 0.12/0.33 % launching worker at depth: 1
% 0.12/0.33 % launching worker at depth: 8
% 0.12/0.33 % launching worker at depth: 9
% 0.12/0.34 % launching worker at depth: 10
% 0.19/0.42 % launching worker at depth: 11
% 3.61/0.82 % SZS status Theorem for theBenchmark
% 3.61/0.82 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------