%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE051+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 : n008.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:29 PM UTC 2026
% Result : Theorem 3.18s 0.84s
% Output : Proof 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 5 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A] : addition(A,A) = A,
file('/export/starexec/sandbox/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(t1,plain,
addition(X1,X1) = X1,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t24,plain,
addition(X1,X1) = X1,
inference(orient,[status(thm)],[t1]) ).
fof(f17,conjecture,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f17_neg,negated_conjecture,
~ ! [X0] : addition(X0,X0) = X0,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f17_nnf,plain,
? [X0] : addition(X0,X0) != X0,
inference(nnf_transformation,[status(thm)],[f17_neg]) ).
fof(f17_sk,plain,
addition(sk0,sk0) != sk0,
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f17_nnf]) ).
cnf(c18,plain,
addition(sk0,sk0) != sk0,
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
cnf(goal_0,negated_conjecture,
addition(sk0,sk0) != sk0,
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(g0_0,plain,
sk0 != sk0,
inference(rw,[status(thm)],[goal_0,t24]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE051+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 18:48:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.18/0.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.18/0.84 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------