%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE150+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:51:44 PM UTC 2026
% Result : Theorem 8.58s 1.79s
% Output : Proof 8.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 37 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 3 sgn 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f14_nnf,plain,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c14,plain,
strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
cnf(t10,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
inference(equality_encoding,[status(esa)],[c14]) ).
fof(f0,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f0_nnf,plain,
! [A,B] : addition(A,B) = addition(B,A),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A,B] : addition(A,B) = addition(B,A),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t8,plain,
addition(X1,X2) = addition(X2,X1),
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t44,plain,
addition(X1,X2) = addition(X2,X1),
inference(orient,[status(thm)],[t8]) ).
cnf(t11260,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(step,[status(thm)],[t10,t44]) ).
cnf(t58,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(orient,[status(thm)],[t11260]) ).
fof(f4,axiom,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f4_nnf,plain,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(t17,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t31,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
inference(orient,[status(thm)],[t17]) ).
cnf(t60,plain,
strong_iteration(multiplication(X1,X2)) = addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))),
inference(cp,[status(thm)],[t58,t31]) ).
cnf(t11094,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(orient,[status(thm)],[t60]) ).
fof(f9,axiom,
! [A] : multiplication(zero,A) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f9_nnf,plain,
! [A] : multiplication(zero,A) = zero,
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
! [A] : multiplication(zero,A) = zero,
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(t7,plain,
multiplication(zero,X1) = zero,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(t42,plain,
multiplication(zero,X1) = zero,
inference(orient,[status(thm)],[t7]) ).
cnf(t11096,plain,
strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
inference(cp,[status(thm)],[t11094,t42]) ).
cnf(t11209,plain,
addition(one,multiplication(X1,zero)) = strong_iteration(multiplication(X1,zero)),
inference(orient,[status(thm)],[t11096]) ).
fof(f18,conjecture,
! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18_neg,negated_conjecture,
~ ! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f18_nnf,plain,
? [X0] : strong_iteration(multiplication(X0,zero)) != addition(one,multiplication(X0,zero)),
inference(nnf_transformation,[status(thm)],[f18_neg]) ).
fof(f18_sk,plain,
strong_iteration(multiplication(sk0,zero)) != addition(one,multiplication(sk0,zero)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f18_nnf]) ).
cnf(c19,plain,
strong_iteration(multiplication(sk0,zero)) != addition(one,multiplication(sk0,zero)),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(goal_0,negated_conjecture,
addition(one,multiplication(sk0,zero)) != strong_iteration(multiplication(sk0,zero)),
inference(equality_encoding,[status(esa)],[c19]) ).
cnf(g0_0,plain,
strong_iteration(multiplication(sk0,zero)) != strong_iteration(multiplication(sk0,zero)),
inference(rw,[status(thm)],[goal_0,t11209]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE150+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 19:06:37 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.58/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.58/1.79 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------