%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n012.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:07 AM UTC 2026
% Result : Theorem 28.80s 4.05s
% Output : CNFRefutation 28.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 13 ( 2 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
'ord$uless'(int,'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),t),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),'zero$uzero'(int))) ).
fof(fact_3_t,axiom,
'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)) = 'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),t) ).
fof(fact_22_number__of__is__id,axiom,
! [X0] : 'number$unumber$uof'(int,X0) = X0 ).
fof(fact_23_zmult__commute,axiom,
! [X0,X1] : 'times$utimes'(int,X0,X1) = 'times$utimes'(int,X1,X0) ).
fof(fact_62_mult__Pls,axiom,
! [X0] : 'times$utimes'(int,pls,X0) = pls ).
fof(fact_96_zadd__commute,axiom,
! [X0,X1] : 'plus$uplus'(int,X0,X1) = 'plus$uplus'(int,X1,X0) ).
fof(fact_97_zero__is__num__zero,axiom,
'zero$uzero'(int) = 'number$unumber$uof'(int,pls) ).
fof(conj_0,conjecture,
'ord$uless'(int,'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)),'zero$uzero'(int)) ).
fof(negated_conjecture,negated_conjecture,
~ 'ord$uless'(int,'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)),'zero$uzero'(int)),
inference(negate_conjecture,[status(cth)],[conj_0]) ).
cnf(c51,plain,
'ord$uless'(int,'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),t),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),'zero$uzero'(int))),
inference(clausification,[status(esa)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
cnf(c52,plain,
'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)) = 'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),t),
inference(clausification,[status(esa)],[fact_3_t]) ).
cnf(c77,plain,
'number$unumber$uof'(int,X0) = X0,
inference(clausification,[status(esa)],[fact_22_number__of__is__id]) ).
cnf(c78,plain,
'times$utimes'(int,X0,X1) = 'times$utimes'(int,X1,X0),
inference(clausification,[status(esa)],[fact_23_zmult__commute]) ).
cnf(c140,plain,
'times$utimes'(int,pls,X0) = pls,
inference(clausification,[status(esa)],[fact_62_mult__Pls]) ).
cnf(c195,plain,
'plus$uplus'(int,X0,X1) = 'plus$uplus'(int,X1,X0),
inference(clausification,[status(esa)],[fact_96_zadd__commute]) ).
cnf(c196,plain,
'zero$uzero'(int) = 'number$unumber$uof'(int,pls),
inference(clausification,[status(esa)],[fact_97_zero__is__num__zero]) ).
cnf(c214,plain,
~ 'ord$uless'(int,'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)),'zero$uzero'(int)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
'times$utimes'(int,X0,pls) = pls,
inference(superposition,[status(thm)],[c78,c140]) ).
cnf(d1,plain,
'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)) = 'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),t),
inference(demodulation,[status(thm)],[c52,c77]) ).
cnf(d2,plain,
'zero$uzero'(int) = pls,
inference(demodulation,[status(thm)],[c196,c77]) ).
cnf(d3,plain,
'ord$uless'(int,'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),t),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls)))),m),'one$uone'(int)),'zero$uzero'(int))),
inference(demodulation,[status(thm)],[c51,c77]) ).
cnf(d4,plain,
'ord$uless'(int,'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),t),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),'zero$uzero'(int))),
inference(demodulation,[status(thm)],[d3,c77]) ).
cnf(d5,plain,
'ord$uless'(int,'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),t),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),pls)),
inference(demodulation,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
'ord$uless'(int,'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),pls)),
inference(demodulation,[status(thm)],[d5,d1]) ).
cnf(d7,plain,
'ord$uless'(int,'plus$uplus'(int,'one$uone'(int),'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls))))),'times$utimes'(int,'plus$uplus'(int,'times$utimes'(int,bit0(bit0(bit1(pls))),m),'one$uone'(int)),pls)),
inference(demodulation,[status(thm)],[d6,c195]) ).
cnf(d8,plain,
'ord$uless'(int,'plus$uplus'(int,'one$uone'(int),'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls))))),pls),
inference(demodulation,[status(thm)],[d7,d0]) ).
cnf(d9,plain,
~ 'ord$uless'(int,'plus$uplus'(int,'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls)))),'one$uone'(int)),pls),
inference(demodulation,[status(thm)],[c214,d2]) ).
cnf(d10,plain,
~ 'ord$uless'(int,'plus$uplus'(int,'one$uone'(int),'power$upower'(int,s,'number$unumber$uof'(nat,bit0(bit1(pls))))),pls),
inference(demodulation,[status(thm)],[d9,c195]) ).
cnf(d11,plain,
$false,
inference(resolution,[status(thm)],[d10,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.02 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sat Sep 26 04:18:20 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.80/4.05 % SZS status Theorem for theBenchmark.p
% 28.80/4.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------