%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM926+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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 : Sun Sep 27 08:14:11 AM UTC 2026
% Result : Theorem 18.25s 12.67s
% Output : CNFRefutation 18.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 48 ( 25 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 13 |; 1 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 26 ( 4 sgn 7 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_0_tpos,axiom,
'ord$uless$ueq'(int,'one$uone'(int),t) ).
fof(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( t = 'one$uone'(int)
=> ? [X0,X1] : 'plus$uplus'(int,'power$upower'(int,X0,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,X1,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)) ) ).
fof(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( 'ord$uless'(int,'one$uone'(int),t)
=> ? [X0,X1] : 'plus$uplus'(int,'power$upower'(int,X0,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,X1,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)) ) ).
fof(fact_22_zless__le,axiom,
! [X0,X1] :
( 'ord$uless'(int,X0,X1)
<=> ( X0 != X1
& 'ord$uless$ueq'(int,X0,X1) ) ) ).
fof(fact_23_zless__linear,axiom,
! [X0,X1] :
( 'ord$uless'(int,X1,X0)
| X0 = X1
| 'ord$uless'(int,X0,X1) ) ).
fof(fact_25_zle__antisym,axiom,
! [X0,X1] :
( 'ord$uless$ueq'(int,X0,X1)
=> ( 'ord$uless$ueq'(int,X1,X0)
=> X0 = X1 ) ) ).
fof(fact_86_number__of__is__id,axiom,
! [X0] : 'number$unumber$uof'(int,X0) = X0 ).
fof(conj_0,conjecture,
? [X0,X1] : 'plus$uplus'(int,'power$upower'(int,X0,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,X1,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0,X1] : 'plus$uplus'(int,'power$upower'(int,X0,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,X1,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),
inference(negate_conjecture,[status(cth)],[conj_0]) ).
cnf(c33,plain,
'ord$uless$ueq'(int,'one$uone'(int),t),
inference(clausification,[status(esa)],[fact_0_tpos]) ).
cnf(c34,plain,
( 'plus$uplus'(int,'power$upower'(int,sK51,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,sK52,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int))
| t != 'one$uone'(int) ),
inference(clausification,[status(esa)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06]) ).
cnf(c35,plain,
( 'plus$uplus'(int,'power$upower'(int,sK53,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,sK54,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int))
| ~ 'ord$uless'(int,'one$uone'(int),t) ),
inference(clausification,[status(esa)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06]) ).
cnf(c55,plain,
( 'ord$uless$ueq'(int,X0,X1)
| ~ 'ord$uless'(int,X0,X1) ),
inference(clausification,[status(esa)],[fact_22_zless__le]) ).
cnf(c58,plain,
( 'ord$uless'(int,X1,X0)
| X0 = X1
| 'ord$uless'(int,X0,X1) ),
inference(clausification,[status(esa)],[fact_23_zless__linear]) ).
cnf(c60,plain,
( X0 = X1
| ~ 'ord$uless$ueq'(int,X1,X0)
| ~ 'ord$uless$ueq'(int,X0,X1) ),
inference(clausification,[status(esa)],[fact_25_zle__antisym]) ).
cnf(c148,plain,
'number$unumber$uof'(int,X0) = X0,
inference(clausification,[status(esa)],[fact_86_number__of__is__id]) ).
cnf(c184,plain,
'plus$uplus'(int,'power$upower'(int,X0,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,X1,'number$unumber$uof'(nat,bit0(bit1(pls))))) != 'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ 'ord$uless'(int,'one$uone'(int),t)
| 'plus$uplus'(int,'power$upower'(int,sK53,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,sK54,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)) ),
inference(demodulation,[status(thm)],[c35,c148]) ).
cnf(d1,plain,
'plus$uplus'(int,'power$upower'(int,X0,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,X1,'number$unumber$uof'(nat,bit0(bit1(pls))))) != 'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),
inference(demodulation,[status(thm)],[c184,c148]) ).
cnf(d2,plain,
~ 'ord$uless'(int,'one$uone'(int),t),
inference(resolution,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
( 'ord$uless'(int,t,'one$uone'(int))
| t = 'one$uone'(int) ),
inference(resolution,[status(thm)],[c58,d2]) ).
cnf(d4,plain,
( t != 'one$uone'(int)
| 'plus$uplus'(int,'power$upower'(int,sK51,'number$unumber$uof'(nat,bit0(bit1(pls)))),'power$upower'(int,sK52,'number$unumber$uof'(nat,bit0(bit1(pls))))) = 'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)) ),
inference(demodulation,[status(thm)],[c34,c148]) ).
cnf(d5,plain,
t != 'one$uone'(int),
inference(resolution,[status(thm)],[d1,d4]) ).
cnf(d6,plain,
'ord$uless'(int,t,'one$uone'(int)),
inference(resolution,[status(thm)],[d5,d3]) ).
cnf(d7,plain,
'ord$uless$ueq'(int,t,'one$uone'(int)),
inference(resolution,[status(thm)],[d6,c55]) ).
cnf(d8,plain,
( ~ 'ord$uless$ueq'(int,'one$uone'(int),t)
| 'one$uone'(int) = t ),
inference(resolution,[status(thm)],[c60,d7]) ).
cnf(d9,plain,
'one$uone'(int) = t,
inference(resolution,[status(thm)],[c33,d8]) ).
cnf(d10,plain,
t != t,
inference(demodulation,[status(thm)],[d5,d9]) ).
cnf(d11,plain,
$false,
inference(equality_resolution,[status(thm)],[d10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/10.38 % Computer : n017.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Sat Sep 26 04:16:29 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.25/12.67 % SZS status Theorem for theBenchmark.p
% 18.25/12.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------