%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE001+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 : n017.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:18 PM UTC 2026
% Result : Theorem 6.02s 1.24s
% Output : Proof 6.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 32 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 11 ~; 5 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 26 ( 0 sgn 15 !; 3 ?)
% 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(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(f3,axiom,
! [A] : addition(A,A) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f3_nnf,plain,
! [A] : addition(A,A) = A,
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A] : addition(A,A) = A,
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
addition(X0,X0) = X0,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t2,plain,
leq(X1,X1) = true,
inference(hyper_resolution,[status(thm)],[hi12,hi3]) ).
cnf(t55,plain,
leq(X1,X1) = true,
inference(orient,[status(thm)],[t2]) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( leq(X0,X1)
=> leq(addition(X0,X2),addition(X0,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f12_neg,negated_conjecture,
~ ! [X0,X1,X2] :
( leq(X0,X1)
=> leq(addition(X0,X2),addition(X0,X2)) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f12_nnf,plain,
? [X0,X1,X2] :
( ~ leq(addition(X0,X2),addition(X0,X2))
& leq(X0,X1) ),
inference(nnf_transformation,[status(thm)],[f12_neg]) ).
fof(f12_sk,plain,
( ~ leq(addition(sk0,sk2),addition(sk0,sk2))
& leq(sk0,sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f12_nnf]) ).
cnf(c14,plain,
~ leq(addition(sk0,sk2),addition(sk0,sk2)),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(goal_0,negated_conjecture,
leq(addition(sk0,sk2),addition(sk0,sk2)) != true,
inference(equality_encoding,[status(esa)],[c14]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t55]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE001+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 18:29:00 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.02/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.02/1.24 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------