%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE058+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n015.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:30 PM UTC 2026
% Result : Theorem 0.16s 5.87s
% Output : Proof 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 45 unt; 0 def)
% Number of atoms : 59 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 6 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-4 aty)
% Number of variables : 54 ( 6 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f11_nnf,plain,
! [A,B] :
( ( addition(A,B) != B
| leq(A,B) )
& ( addition(A,B) = B
| ~ leq(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
! [A,B] :
( ( addition(A,B) != B
| leq(A,B) )
& ( addition(A,B) = B
| ~ leq(A,B) ) ),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(t20,plain,
ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(t29,plain,
ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
inference(orient,[status(thm)],[t20]) ).
cnf(c12,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(hi12,axiom,
ifeq(addition(X0,X1),X1,leq(X0,X1),true) = true,
inference(equality_encoding,[status(esa)],[c12]) ).
fof(f12,axiom,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).
fof(f12_nnf,plain,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c13,plain,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(hi13,axiom,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(t14,plain,
leq(X1,multiplication(domain(X1),X1)) = true,
inference(hyper_resolution,[status(thm)],[hi12,hi13]) ).
cnf(t84,plain,
leq(X1,multiplication(domain(X1),X1)) = true,
inference(orient,[status(thm)],[t14]) ).
fof(f5,axiom,
! [A] : multiplication(A,one) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f5_nnf,plain,
! [A] : multiplication(A,one) = A,
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [A] : multiplication(A,one) = A,
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(t6,plain,
multiplication(X1,one) = X1,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t26,plain,
multiplication(X1,one) = X1,
inference(orient,[status(thm)],[t6]) ).
cnf(t85,plain,
true = leq(one,domain(one)),
inference(cp,[status(thm)],[t84,t26]) ).
cnf(t109,plain,
leq(one,domain(one)) = true,
inference(orient,[status(thm)],[t85]) ).
cnf(t110,plain,
domain(one) = ifeq(true,true,addition(one,domain(one)),domain(one)),
inference(cp,[status(thm)],[t29,t109]) ).
cnf(t13,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t28,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t13]) ).
cnf(t118,plain,
domain(one) = addition(one,domain(one)),
inference(step,[status(thm)],[t110,t28]) ).
fof(f14,axiom,
! [X0] : addition(domain(X0),one) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain3) ).
fof(f14_nnf,plain,
! [X0] : addition(domain(X0),one) = one,
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [X0] : addition(domain(X0),one) = one,
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c15,plain,
addition(domain(X0),one) = one,
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
cnf(t10,plain,
addition(domain(X1),one) = one,
inference(equality_encoding,[status(esa)],[c15]) ).
fof(f0,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox2/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(t12,plain,
addition(X1,X2) = addition(X2,X1),
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t32,plain,
addition(X1,X2) = addition(X2,X1),
inference(orient,[status(thm)],[t12]) ).
cnf(t115,plain,
addition(one,domain(X1)) = one,
inference(step,[status(thm)],[t10,t32]) ).
cnf(t63,plain,
addition(one,domain(X1)) = one,
inference(orient,[status(thm)],[t115]) ).
cnf(t119,plain,
domain(one) = one,
inference(step,[status(thm)],[t118,t63]) ).
cnf(t112,plain,
domain(one) = one,
inference(orient,[status(thm)],[t119]) ).
fof(f17,conjecture,
domain(one) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f17_neg,negated_conjecture,
domain(one) != one,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f17_nnf,plain,
domain(one) != one,
inference(nnf_transformation,[status(thm)],[f17_neg]) ).
fof(f17_sk,plain,
domain(one) != one,
inference(skolemisation,[status(esa)],[f17_nnf]) ).
cnf(c18,plain,
domain(one) != one,
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
cnf(goal_0,negated_conjecture,
domain(one) != one,
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(g0_0,plain,
one != one,
inference(rw,[status(thm)],[goal_0,t112]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE058+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/5.38 % Computer : n015.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Wed Sep 23 18:52:15 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/5.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/5.87 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------