%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : NUM925+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n003.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 02:21:20 PM UTC 2026
% Result : Theorem 25.96s 3.87s
% Output : Proof 25.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 30 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 13 ~; 5 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [A_1] :
( power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int
<=> A_1 = zero_zero_int ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_zero__eq__power2) ).
fof(f7_nnf,plain,
! [A_1] :
( ( A_1 != zero_zero_int
| power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int )
& ( A_1 = zero_zero_int
| power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [A_1] :
( ( A_1 != zero_zero_int
| power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int )
& ( A_1 = zero_zero_int
| power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c9,plain,
( X0 = zero_zero_int
| power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
fof(f106,conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f106_neg,negated_conjecture,
~ ( power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
inference(negated_conjecture,[status(cth)],[f106]) ).
fof(f106_nnf,plain,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(nnf_transformation,[status(thm)],[f106_neg]) ).
cnf(c151,plain,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f106_nnf]) ).
cnf(p186,plain,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = zero_zero_int,
inference(resolution,[status(thm)],[c9,c151]) ).
fof(f0,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_n1pos) ).
fof(f0_nnf,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(p187,plain,
ord_less_int(zero_zero_int,zero_zero_int),
inference(demodulation,[status(thm)],[p186,c0]) ).
fof(f78,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_78_Pls__def) ).
fof(f78_nnf,plain,
pls = zero_zero_int,
inference(nnf_transformation,[status(thm)],[f78]) ).
cnf(c116,plain,
pls = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f78_nnf]) ).
fof(f36,axiom,
~ ord_less_int(pls,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_36_rel__simps_I2_J) ).
fof(f36_nnf,plain,
~ ord_less_int(pls,pls),
inference(nnf_transformation,[status(thm)],[f36]) ).
fof(f36_sk,plain,
~ ord_less_int(pls,pls),
inference(skolemisation,[status(esa)],[f36_nnf]) ).
cnf(c46,plain,
~ ord_less_int(pls,pls),
inference(cnf_transformation,[status(esa)],[f36_sk]) ).
cnf(p153,plain,
~ ord_less_int(zero_zero_int,zero_zero_int),
inference(superposition,[status(thm)],[c116,c46]) ).
cnf(p188,plain,
$false,
inference(resolution,[status(thm)],[p187,p153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM925+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.38 % Computer : n003.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Thu Sep 24 05:44:20 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 25.96/3.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.96/3.87 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------