%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE021+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n002.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:23 PM UTC 2026
% Result : Theorem 15.86s 2.46s
% Output : Proof 15.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 46 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 17 ~; 10 |; 6 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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]) ).
fof(f8,axiom,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
fof(f8_nnf,plain,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p52,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X2,X0),X1),
inference(superposition,[status(thm)],[c8,c0]) ).
fof(f18,conjecture,
! [X0,X1] :
( test(X1)
=> ( leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
& leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18_neg,negated_conjecture,
~ ! [X0,X1] :
( test(X1)
=> ( leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
& leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f18_nnf,plain,
? [X0,X1] :
( ( ~ leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
| ~ leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) )
& test(X1) ),
inference(nnf_transformation,[status(thm)],[f18_neg]) ).
fof(f18_sk,plain,
( ( ~ leq(addition(multiplication(sk2,sk1),multiplication(c(sk2),sk1)),sk1)
| ~ leq(sk1,addition(multiplication(sk2,sk1),multiplication(c(sk2),sk1))) )
& test(sk2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2])],[f18_nnf]) ).
cnf(c25,plain,
( ~ leq(addition(multiplication(sk2,sk1),multiplication(c(sk2),sk1)),sk1)
| ~ leq(sk1,addition(multiplication(sk2,sk1),multiplication(c(sk2),sk1))) ),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(p54,plain,
( ~ leq(multiplication(addition(c(sk2),sk2),sk1),sk1)
| ~ leq(sk1,multiplication(addition(c(sk2),sk2),sk1)) ),
inference(demodulation,[status(thm)],[p52,c25]) ).
cnf(p591,plain,
( ~ leq(sk1,sk1)
| ~ leq(sk1,sk1) ),
inference(superposition,[status(thm)],[c0,p54]) ).
cnf(p592,plain,
~ leq(sk1,sk1),
inference(factoring,[status(thm)],[p591]) ).
fof(f11,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('/export/starexec/sandbox/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]) ).
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(p40,plain,
leq(X0,X0),
inference(resolution,[status(thm)],[c12,c3]) ).
cnf(p593,plain,
$false,
inference(resolution,[status(thm)],[p592,p40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE021+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n002.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 18:41:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 15.86/2.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.86/2.46 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------