↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : NUM926+7 : 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 : n002.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 14.48s 7.48s
% Output   : CNFRefutation 14.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   93 (  68 unt;   0 def)
%            Number of atoms       :  125 ( 102 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   53 (  21   ~;  25   |;   1   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  10 con; 0-4 aty)
%            Number of variables   :   78 (   3 sgn  27   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(tsy_c_Int_OBit0_arg1,hypothesis,
    ! [X0] : bit0(ti(int,X0)) = bit0(X0) ).

fof(tsy_c_hAPP_arg2,axiom,
    ! [X0,X1,X2,X3] : hAPP(X0,X1,X2,ti(X0,X3)) = hAPP(X0,X1,X2,X3) ).

fof(tsy_v_t_____res,axiom,
    ti(int,t) = t ).

fof(fact_0_tpos,axiom,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'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] : hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,X0),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,X1),'number$unumber$uof'(nat,bit0(bit1(pls))))) = hAPP(int,int,'plus$uplus'(int,hAPP(int,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,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),'one$uone'(int)),t))
   => ? [X0,X1] : hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,X0),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,X1),'number$unumber$uof'(nat,bit0(bit1(pls))))) = hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls))))),m)),'one$uone'(int)) ) ).

fof(fact_22_zless__le,axiom,
    ! [X0,X1] :
      ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),X0),X1))
    <=> ( ti(int,X0) != ti(int,X1)
        & hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),X0),X1)) ) ) ).

fof(fact_23_zless__linear,axiom,
    ! [X0,X1] :
      ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),X1),X0))
      | ti(int,X0) = ti(int,X1)
      | hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),X0),X1)) ) ).

fof(fact_25_zle__antisym,axiom,
    ! [X0,X1] :
      ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),X0),X1))
     => ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),X1),X0))
       => ti(int,X0) = ti(int,X1) ) ) ).

fof(fact_85_rel__simps_I48_J,axiom,
    ! [X0,X1] :
      ( bit0(X0) = bit0(X1)
    <=> ti(int,X0) = ti(int,X1) ) ).

fof(fact_88_number__of__is__id,axiom,
    ! [X0] : 'number$unumber$uof'(int,X0) = ti(int,X0) ).

fof(fact_89_zadd__assoc,axiom,
    ! [X0,X1,X2] : hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'plus$uplus'(int,X0),X1)),X2) = hAPP(int,int,'plus$uplus'(int,X0),hAPP(int,int,'plus$uplus'(int,X1),X2)) ).

fof(fact_91_zadd__commute,axiom,
    ! [X0,X1] : hAPP(int,int,'plus$uplus'(int,X0),X1) = hAPP(int,int,'plus$uplus'(int,X1),X0) ).

fof(fact_122_Bit0__Pls,axiom,
    bit0(pls) = pls ).

fof(fact_123_mult__Pls,axiom,
    ! [X0] : hAPP(int,int,'times$utimes'(int,pls),X0) = pls ).

fof(fact_124_mult__Bit0,axiom,
    ! [X0,X1] : hAPP(int,int,'times$utimes'(int,bit0(X0)),X1) = bit0(hAPP(int,int,'times$utimes'(int,X0),X1)) ).

fof(fact_125_add__Pls__right,axiom,
    ! [X0] : hAPP(int,int,'plus$uplus'(int,X0),pls) = ti(int,X0) ).

fof(fact_128_Bit0__def,axiom,
    ! [X0] : bit0(X0) = hAPP(int,int,'plus$uplus'(int,X0),X0) ).

fof(fact_129_zmult__1__right,axiom,
    ! [X0] : hAPP(int,int,'times$utimes'(int,X0),'one$uone'(int)) = ti(int,X0) ).

fof(fact_130_zmult__1,axiom,
    ! [X0] : hAPP(int,int,'times$utimes'(int,'one$uone'(int)),X0) = ti(int,X0) ).

fof(fact_153_Bit1__def,axiom,
    ! [X0] : bit1(X0) = hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),X0)),X0) ).

fof(fact_160_one__is__num__one,axiom,
    'one$uone'(int) = 'number$unumber$uof'(int,bit1(pls)) ).

fof(conj_0,conjecture,
    ? [X0,X1] : hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,X0),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,X1),'number$unumber$uof'(nat,bit0(bit1(pls))))) = hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls))))),m)),'one$uone'(int)) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0,X1] : hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,X0),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,X1),'number$unumber$uof'(nat,bit0(bit1(pls))))) = hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls))))),m)),'one$uone'(int)),
    inference(negate_conjecture,[status(cth)],[conj_0]) ).

cnf(c49,plain,
    bit0(ti(int,X0)) = bit0(X0),
    inference(clausification,[status(esa)],[tsy_c_Int_OBit0_arg1]) ).

cnf(c88,plain,
    hAPP(X0,X1,X2,ti(X0,X3)) = hAPP(X0,X1,X2,X3),
    inference(clausification,[status(esa)],[tsy_c_hAPP_arg2]) ).

cnf(c97,plain,
    ti(int,t) = t,
    inference(clausification,[status(esa)],[tsy_v_t_____res]) ).

cnf(c98,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),'one$uone'(int)),t)),
    inference(clausification,[status(esa)],[fact_0_tpos]) ).

cnf(c99,plain,
    ( hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,sK186),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,sK187),'number$unumber$uof'(nat,bit0(bit1(pls))))) = hAPP(int,int,'plus$uplus'(int,hAPP(int,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(c100,plain,
    ( hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,sK188),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,sK189),'number$unumber$uof'(nat,bit0(bit1(pls))))) = hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'times$utimes'(int,'number$unumber$uof'(int,bit0(bit0(bit1(pls))))),m)),'one$uone'(int))
    | ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'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(c120,plain,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),X0),X1))
    | ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),X0),X1)) ),
    inference(clausification,[status(esa)],[fact_22_zless__le]) ).

cnf(c123,plain,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),X1),X0))
    | ti(int,X0) = ti(int,X1)
    | hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),X0),X1)) ),
    inference(clausification,[status(esa)],[fact_23_zless__linear]) ).

cnf(c125,plain,
    ( ti(int,X0) = ti(int,X1)
    | ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),X1),X0))
    | ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),X0),X1)) ),
    inference(clausification,[status(esa)],[fact_25_zle__antisym]) ).

cnf(c212,plain,
    ( ti(int,X0) = ti(int,X1)
    | bit0(X0) != bit0(X1) ),
    inference(clausification,[status(esa)],[fact_85_rel__simps_I48_J]) ).

cnf(c216,plain,
    'number$unumber$uof'(int,X0) = ti(int,X0),
    inference(clausification,[status(esa)],[fact_88_number__of__is__id]) ).

cnf(c217,plain,
    hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'plus$uplus'(int,X0),X1)),X2) = hAPP(int,int,'plus$uplus'(int,X0),hAPP(int,int,'plus$uplus'(int,X1),X2)),
    inference(clausification,[status(esa)],[fact_89_zadd__assoc]) ).

cnf(c219,plain,
    hAPP(int,int,'plus$uplus'(int,X0),X1) = hAPP(int,int,'plus$uplus'(int,X1),X0),
    inference(clausification,[status(esa)],[fact_91_zadd__commute]) ).

cnf(c272,plain,
    bit0(pls) = pls,
    inference(clausification,[status(esa)],[fact_122_Bit0__Pls]) ).

cnf(c273,plain,
    hAPP(int,int,'times$utimes'(int,pls),X0) = pls,
    inference(clausification,[status(esa)],[fact_123_mult__Pls]) ).

cnf(c274,plain,
    hAPP(int,int,'times$utimes'(int,bit0(X0)),X1) = bit0(hAPP(int,int,'times$utimes'(int,X0),X1)),
    inference(clausification,[status(esa)],[fact_124_mult__Bit0]) ).

cnf(c275,plain,
    hAPP(int,int,'plus$uplus'(int,X0),pls) = ti(int,X0),
    inference(clausification,[status(esa)],[fact_125_add__Pls__right]) ).

cnf(c278,plain,
    bit0(X0) = hAPP(int,int,'plus$uplus'(int,X0),X0),
    inference(clausification,[status(esa)],[fact_128_Bit0__def]) ).

cnf(c279,plain,
    hAPP(int,int,'times$utimes'(int,X0),'one$uone'(int)) = ti(int,X0),
    inference(clausification,[status(esa)],[fact_129_zmult__1__right]) ).

cnf(c280,plain,
    hAPP(int,int,'times$utimes'(int,'one$uone'(int)),X0) = ti(int,X0),
    inference(clausification,[status(esa)],[fact_130_zmult__1]) ).

cnf(c303,plain,
    bit1(X0) = hAPP(int,int,'plus$uplus'(int,hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),X0)),X0),
    inference(clausification,[status(esa)],[fact_153_Bit1__def]) ).

cnf(c310,plain,
    'one$uone'(int) = 'number$unumber$uof'(int,bit1(pls)),
    inference(clausification,[status(esa)],[fact_160_one__is__num__one]) ).

cnf(c1714,plain,
    hAPP(int,int,'plus$uplus'(int,hAPP(nat,int,'power$upower'(int,X0),'number$unumber$uof'(nat,bit0(bit1(pls))))),hAPP(nat,int,'power$upower'(int,X1),'number$unumber$uof'(nat,bit0(bit1(pls))))) != hAPP(int,int,'plus$uplus'(int,hAPP(int,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,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),'one$uone'(int)),t)),
    inference(resolution,[status(thm)],[c1714,c100]) ).

cnf(d1,plain,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),t),'one$uone'(int)))
    | ti(int,'one$uone'(int)) = ti(int,t) ),
    inference(resolution,[status(thm)],[d0,c123]) ).

cnf(d2,plain,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless'(int),t),'one$uone'(int)))
    | ti(int,'one$uone'(int)) = t ),
    inference(demodulation,[status(thm)],[d1,c97]) ).

cnf(d3,plain,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),t),'one$uone'(int)))
    | ti(int,'one$uone'(int)) = t ),
    inference(resolution,[status(thm)],[d2,c120]) ).

cnf(d4,plain,
    ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),'one$uone'(int)),t))
    | ti(int,t) = ti(int,'one$uone'(int))
    | ti(int,'one$uone'(int)) = t ),
    inference(resolution,[status(thm)],[d3,c125]) ).

cnf(d5,plain,
    ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),'ord$uless$ueq'(int),'one$uone'(int)),t))
    | t = ti(int,'one$uone'(int))
    | ti(int,'one$uone'(int)) = t ),
    inference(demodulation,[status(thm)],[d4,c97]) ).

cnf(d6,plain,
    ( t = ti(int,'one$uone'(int))
    | ti(int,'one$uone'(int)) = t ),
    inference(resolution,[status(thm)],[c98,d5]) ).

cnf(d7,plain,
    ( t = ti(int,'one$uone'(int))
    | t != t ),
    inference(equality_factoring,[status(thm)],[d6]) ).

cnf(d8,plain,
    t = ti(int,'one$uone'(int)),
    inference(equality_resolution,[status(thm)],[d7]) ).

cnf(d9,plain,
    t = 'number$unumber$uof'(int,'one$uone'(int)),
    inference(demodulation,[status(thm)],[d8,c216]) ).

cnf(d10,plain,
    hAPP(int,int,'times$utimes'(int,'one$uone'(int)),X0) = 'number$unumber$uof'(int,X0),
    inference(demodulation,[status(thm)],[c280,c216]) ).

cnf(d11,plain,
    hAPP(int,X0,X1,t) = hAPP(int,X0,X1,'one$uone'(int)),
    inference(superposition,[status(thm)],[d8,c88]) ).

cnf(d12,plain,
    hAPP(int,int,'times$utimes'(int,X0),'one$uone'(int)) = 'number$unumber$uof'(int,X0),
    inference(demodulation,[status(thm)],[c279,c216]) ).

cnf(d13,plain,
    hAPP(int,int,'times$utimes'(int,X0),t) = 'number$unumber$uof'(int,X0),
    inference(demodulation,[status(thm)],[d12,d11]) ).

cnf(d14,plain,
    'number$unumber$uof'(int,'one$uone'(int)) = 'number$unumber$uof'(int,t),
    inference(superposition,[status(thm)],[d13,d10]) ).

cnf(d15,plain,
    t = 'number$unumber$uof'(int,t),
    inference(demodulation,[status(thm)],[d14,d9]) ).

cnf(d16,plain,
    hAPP(int,int,'plus$uplus'(int,X0),pls) = 'number$unumber$uof'(int,X0),
    inference(demodulation,[status(thm)],[c275,c216]) ).

cnf(d17,plain,
    bit1(X0) = hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),hAPP(int,int,'plus$uplus'(int,X0),X0)),
    inference(demodulation,[status(thm)],[c303,c217]) ).

cnf(d18,plain,
    bit1(X0) = hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),bit0(X0)),
    inference(demodulation,[status(thm)],[d17,c278]) ).

cnf(d19,plain,
    'number$unumber$uof'(int,pls) = pls,
    inference(superposition,[status(thm)],[d13,c273]) ).

cnf(d20,plain,
    hAPP(int,int,'times$utimes'(int,bit0(X0)),t) = bit0('number$unumber$uof'(int,X0)),
    inference(superposition,[status(thm)],[d13,c274]) ).

cnf(d21,plain,
    'number$unumber$uof'(int,bit0(X0)) = bit0('number$unumber$uof'(int,X0)),
    inference(demodulation,[status(thm)],[d20,d13]) ).

cnf(d22,plain,
    'number$unumber$uof'(int,bit0(pls)) = bit0(pls),
    inference(superposition,[status(thm)],[d19,d21]) ).

cnf(d23,plain,
    'number$unumber$uof'(int,pls) = bit0(pls),
    inference(demodulation,[status(thm)],[d22,c272]) ).

cnf(d24,plain,
    pls = bit0(pls),
    inference(demodulation,[status(thm)],[d23,d19]) ).

cnf(d25,plain,
    bit1(pls) = hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),pls),
    inference(superposition,[status(thm)],[d24,d18]) ).

cnf(d26,plain,
    bit1(pls) = 'number$unumber$uof'(int,'one$uone'(int)),
    inference(demodulation,[status(thm)],[d25,d16]) ).

cnf(d27,plain,
    bit1(pls) = t,
    inference(demodulation,[status(thm)],[d26,d9]) ).

cnf(d28,plain,
    'one$uone'(int) = 'number$unumber$uof'(int,t),
    inference(demodulation,[status(thm)],[c310,d27]) ).

cnf(d29,plain,
    'one$uone'(int) = t,
    inference(demodulation,[status(thm)],[d28,d15]) ).

cnf(d30,plain,
    t != 'one$uone'(int),
    inference(resolution,[status(thm)],[c1714,c99]) ).

cnf(d31,plain,
    t != t,
    inference(demodulation,[status(thm)],[d30,d29]) ).

cnf(d32,plain,
    bit0(t) = bit0('one$uone'(int)),
    inference(superposition,[status(thm)],[d8,c49]) ).

cnf(d33,plain,
    ( ti(int,'one$uone'(int)) = ti(int,X0)
    | bit0(t) != bit0(X0) ),
    inference(superposition,[status(thm)],[d32,c212]) ).

cnf(d34,plain,
    ( bit0(t) != bit0(X0)
    | 'number$unumber$uof'(int,'one$uone'(int)) = ti(int,X0) ),
    inference(demodulation,[status(thm)],[d33,c216]) ).

cnf(d35,plain,
    ( bit0(t) != bit0(X0)
    | t = ti(int,X0) ),
    inference(demodulation,[status(thm)],[d34,d9]) ).

cnf(d36,plain,
    ( bit0(t) != bit0(X0)
    | t = 'number$unumber$uof'(int,X0) ),
    inference(demodulation,[status(thm)],[d35,c216]) ).

cnf(d37,plain,
    ( t = 'number$unumber$uof'(int,'one$uone'(int))
    | bit0(t) != bit0(t) ),
    inference(superposition,[status(thm)],[d32,d36]) ).

cnf(d38,plain,
    ( t = t
    | bit0(t) != bit0(t) ),
    inference(demodulation,[status(thm)],[d37,d9]) ).

cnf(d39,plain,
    bit0('one$uone'(int)) = hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),t),
    inference(superposition,[status(thm)],[d11,c278]) ).

cnf(d40,plain,
    bit0(t) = hAPP(int,int,'plus$uplus'(int,'one$uone'(int)),t),
    inference(demodulation,[status(thm)],[d39,d32]) ).

cnf(d41,plain,
    bit0(t) = hAPP(int,int,'plus$uplus'(int,t),'one$uone'(int)),
    inference(demodulation,[status(thm)],[d40,c219]) ).

cnf(d42,plain,
    bit0(t) = hAPP(int,int,'plus$uplus'(int,t),t),
    inference(demodulation,[status(thm)],[d41,d11]) ).

cnf(d43,plain,
    bit0(t) = bit0(t),
    inference(demodulation,[status(thm)],[d42,c278]) ).

cnf(d44,plain,
    t = t,
    inference(resolution,[status(thm)],[d43,d38]) ).

cnf(d45,plain,
    $false,
    inference(resolution,[status(thm)],[d44,d31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM926+7 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n002.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 26 04:23:35 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.48/7.48  % SZS status Theorem for theBenchmark.p
% 14.48/7.48  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------