%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : NUM925+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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 : Thu Sep 24 01:41:59 PM UTC 2026
% Result : Theorem 0.08s 0.40s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 15 unt; 0 def)
% Number of atoms : 29 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 6 |; 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 : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,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') ).
fof(f37,axiom,
~ ord_less_int(pls,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f79,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f107,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') ).
fof(f108,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)],[f107]) ).
fof(f109,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f120,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)],[f8]) ).
fof(f121,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] :
( A_1 = zero_zero_int
| power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
inference(miniscoping,[status(thm)],[f120]) ).
fof(f122,plain,
! [X0] :
( X0 = zero_zero_int
| power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
inference(cnf_transformation,[status(thm)],[f121]) ).
fof(f173,plain,
~ ord_less_int(pls,pls),
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f297,plain,
pls = zero_zero_int,
inference(cnf_transformation,[status(thm)],[f79]) ).
fof(f340,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(thm)],[f108]) ).
fof(f352,plain,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(zero_zero_int)))) = zero_zero_int,
inference(backward_demodulation,[status(thm)],[f297,f340]) ).
fof(f384,plain,
~ ord_less_int(zero_zero_int,pls),
inference(forward_demodulation,[status(thm)],[f297,f173]) ).
fof(f385,plain,
~ ord_less_int(zero_zero_int,zero_zero_int),
inference(forward_demodulation,[status(thm)],[f297,f384]) ).
fof(f396,plain,
! [X0] :
( X0 = zero_zero_int
| power_power_int(X0,number_number_of_nat(bit0(bit1(zero_zero_int)))) != zero_zero_int ),
inference(forward_demodulation,[status(thm)],[f297,f122]) ).
fof(f398,plain,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = zero_zero_int,
inference(resolution,[status(thm)],[f396,f352]) ).
fof(f416,plain,
ord_less_int(zero_zero_int,zero_zero_int),
inference(backward_demodulation,[status(thm)],[f398,f109]) ).
fof(f418,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f416,f385]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM925+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 03:23:14 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.08/0.40 % Refutation found
% 0.08/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.43 % Elapsed time: 0.075998 seconds
% 0.12/0.43 % CPU time: 0.177793 seconds
% 0.12/0.43 % Total memory used: 106.865 MB
% 0.12/0.43 % Net memory used: 106.717 MB
%------------------------------------------------------------------------------