%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE003+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 : n019.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 3.94s 0.99s
% Output : Proof 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 7 !; 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]) ).
fof(f12,conjecture,
( ! [X0] : addition(X0,X0) = X0
<=> addition(one,one) = one ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f12_neg,negated_conjecture,
~ ( ! [X0] : addition(X0,X0) = X0
<=> addition(one,one) = one ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f12_nnf,plain,
( ( addition(one,one) = one
& ? [X0] : addition(X0,X0) != X0 )
| ( addition(one,one) != one
& ! [X0] : addition(X0,X0) = X0 ) ),
inference(nnf_transformation,[status(thm)],[f12_neg]) ).
fof(f12_sk,plain,
! [X0] :
( ( addition(one,one) = one
& addition(sk0,sk0) != sk0 )
| ( addition(one,one) != one
& addition(X0,X0) = X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f12_nnf]) ).
cnf(c15,plain,
( addition(sk0,sk0) != sk0
| addition(one,one) != one ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p17,plain,
sk0 != sk0,
inference(resolution,[status(thm)],[c3,c15]) ).
cnf(p18,plain,
$false,
inference(equality_resolution,[status(thm)],[p17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE003+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n019.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:33:49 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.94/0.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.94/0.99 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------