%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE009+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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:19 PM UTC 2026
% Result : Theorem 50.73s 7.72s
% Output : Proof 50.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 22 unt; 0 def)
% Number of atoms : 74 ( 46 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 26 ~; 18 |; 16 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 40 !; 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(f14,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f14_nnf,plain,
! [X0,X1] :
( ( ( ~ complement(X0,X1)
| c(X0) = X1 )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [X0,X1] :
( ( ( ~ complement(X0,X1)
| c(X0) = X1 )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c19,plain,
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
fof(f18,conjecture,
! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18_neg,negated_conjecture,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f18_nnf,plain,
? [X0,X1] :
( one != addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))
& test(X0)
& test(X1) ),
inference(nnf_transformation,[status(thm)],[f18_neg]) ).
fof(f18_sk,plain,
( one != addition(addition(addition(multiplication(sk1,sk2),multiplication(sk1,c(sk2))),multiplication(c(sk1),sk2)),multiplication(c(sk1),c(sk2)))
& test(sk1)
& test(sk2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2])],[f18_nnf]) ).
cnf(c24,plain,
test(sk2),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(p136,plain,
( complement(sk2,X0)
| c(sk2) != X0 ),
inference(resolution,[status(thm)],[c19,c24]) ).
cnf(p138,plain,
complement(sk2,c(sk2)),
inference(equality_resolution,[status(thm)],[p136]) ).
fof(f13,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f13_nnf,plain,
! [X0,X1] :
( ( addition(X0,X1) != one
| multiplication(X1,X0) != zero
| multiplication(X0,X1) != zero
| complement(X1,X0) )
& ( ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [X1,X0] :
( ( addition(X0,X1) != one
| multiplication(X1,X0) != zero
| multiplication(X0,X1) != zero
| complement(X1,X0) )
& ( ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero )
| ~ complement(X1,X0) ) ),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c17,plain,
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(p142,plain,
addition(sk2,c(sk2)) = one,
inference(resolution,[status(thm)],[p138,c17]) ).
fof(f1,axiom,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f1_nnf,plain,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B,C] : addition(A,addition(B,C)) = addition(addition(A,B),C),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
fof(f7,axiom,
! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).
fof(f7_nnf,plain,
! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p55,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X2,X1)),
inference(superposition,[status(thm)],[c7,c0]) ).
cnf(c26,plain,
one != addition(addition(addition(multiplication(sk1,sk2),multiplication(sk1,c(sk2))),multiplication(c(sk1),sk2)),multiplication(c(sk1),c(sk2))),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(p57,plain,
one != addition(addition(multiplication(sk1,addition(c(sk2),sk2)),multiplication(c(sk1),sk2)),multiplication(c(sk1),c(sk2))),
inference(demodulation,[status(thm)],[p55,c26]) ).
cnf(p63,plain,
one != addition(multiplication(sk1,addition(sk2,c(sk2))),addition(multiplication(c(sk1),sk2),multiplication(c(sk1),c(sk2)))),
inference(superposition,[status(thm)],[c1,p57]) ).
cnf(p145,plain,
one != addition(multiplication(sk1,one),addition(multiplication(c(sk1),sk2),multiplication(c(sk1),c(sk2)))),
inference(demodulation,[status(thm)],[p142,p63]) ).
cnf(p897,plain,
one != one,
inference(superposition,[status(thm)],[c0,p145]) ).
cnf(p898,plain,
$false,
inference(equality_resolution,[status(thm)],[p897]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE009+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n016.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 18:39:11 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 50.73/7.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.73/7.72 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------