TSTP Solution File: SWV451+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV451+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Aug 22 11:04:15 EDT 2023

% Result   : Theorem 137.84s 121.71s
% Output   : CNFRefutation 138.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   52
% Syntax   : Number of formulae    :  119 (  38 unt;  48 typ;   0 def)
%            Number of atoms       :  186 ( 103 equ)
%            Maximal formula atoms :   51 (   2 avg)
%            Number of connectives :  202 (  87   ~;  66   |;  27   &)
%                                         (   2 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   35 (  26   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   43 (  43 usr;  22 con; 0-2 aty)
%            Number of variables   :   72 (;  72   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ setIn > leq > elem > pidElem > ordered > snoc > m_Ack > index > cons > #nlpp > tail > s > queue > pidMsg > m_NotNorm > m_NormQ > m_Ldr > m_Halt > m_Down > last > init > host > head > zero > wait > status > setEmpty > q_nil > pids > norm > nil > nbr_proc > ldr > elid > elec_2 > elec_1 > alive > #skF_2 > #skF_11 > #skF_1 > #skF_7 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_9 > #skF_8 > #skF_12 > #skF_4

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(m_NormQ,type,
    m_NormQ: $i > $i ).

tff(nbr_proc,type,
    nbr_proc: $i ).

tff(pids,type,
    pids: $i ).

tff(elec_1,type,
    elec_1: $i ).

tff(ordered,type,
    ordered: $i > $o ).

tff('#skF_2',type,
    '#skF_2': $i > $i ).

tff(status,type,
    status: $i ).

tff(snoc,type,
    snoc: ( $i * $i ) > $i ).

tff('#skF_11',type,
    '#skF_11': $i ).

tff(s,type,
    s: $i > $i ).

tff(host,type,
    host: $i > $i ).

tff(m_Halt,type,
    m_Halt: $i > $i ).

tff('#skF_1',type,
    '#skF_1': $i > $i ).

tff(pidMsg,type,
    pidMsg: $i > $i ).

tff(pidElem,type,
    pidElem: $i > $o ).

tff(elem,type,
    elem: ( $i * $i ) > $o ).

tff(alive,type,
    alive: $i ).

tff('#skF_7',type,
    '#skF_7': $i ).

tff('#skF_3',type,
    '#skF_3': ( $i * $i ) > $i ).

tff('#skF_10',type,
    '#skF_10': $i ).

tff(setIn,type,
    setIn: ( $i * $i ) > $o ).

tff(init,type,
    init: $i > $i ).

tff(m_Ack,type,
    m_Ack: ( $i * $i ) > $i ).

tff('#skF_5',type,
    '#skF_5': $i ).

tff(m_Ldr,type,
    m_Ldr: $i > $i ).

tff('#skF_6',type,
    '#skF_6': $i ).

tff(last,type,
    last: $i > $i ).

tff(setEmpty,type,
    setEmpty: $i ).

tff('#skF_9',type,
    '#skF_9': $i ).

tff(index,type,
    index: ( $i * $i ) > $i ).

tff('#skF_8',type,
    '#skF_8': $i ).

tff(cons,type,
    cons: ( $i * $i ) > $i ).

tff(ldr,type,
    ldr: $i ).

tff(wait,type,
    wait: $i ).

tff(leq,type,
    leq: ( $i * $i ) > $o ).

tff(tail,type,
    tail: $i > $i ).

tff(m_Down,type,
    m_Down: $i > $i ).

tff(m_NotNorm,type,
    m_NotNorm: $i > $i ).

tff(q_nil,type,
    q_nil: $i ).

tff(queue,type,
    queue: $i > $i ).

tff(head,type,
    head: $i > $i ).

tff(elid,type,
    elid: $i ).

tff(nil,type,
    nil: $i ).

tff('#skF_12',type,
    '#skF_12': $i ).

tff(norm,type,
    norm: $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i ) > $i ).

tff(zero,type,
    zero: $i ).

tff(elec_2,type,
    elec_2: $i ).

tff(f_466,negated_conjecture,
    ~ ! [V,W,X,Y] :
        ( ( ! [Z,Pid0] :
              ( setIn(Pid0,alive)
             => ~ elem(m_Down(Pid0),queue(host(Z))) )
          & ! [Z,Pid0] :
              ( elem(m_Down(Pid0),queue(host(Z)))
             => ~ setIn(Pid0,alive) )
          & ! [Z,Pid0] :
              ( elem(m_Down(Pid0),queue(host(Z)))
             => ( host(Pid0) != host(Z) ) )
          & ! [Z,Pid0] :
              ( elem(m_Halt(Pid0),queue(host(Z)))
             => ~ leq(host(Z),host(Pid0)) )
          & ! [Z,Pid20,Pid0] :
              ( elem(m_Ack(Pid0,Z),queue(host(Pid20)))
             => ~ leq(host(Z),host(Pid0)) )
          & ! [Z,Pid0] :
              ( ( ~ setIn(Z,alive)
                & leq(Pid0,Z)
                & ( host(Pid0) = host(Z) ) )
             => ~ setIn(Pid0,alive) )
          & ! [Z,Pid0] :
              ( ( ( Pid0 != Z )
                & ( host(Pid0) = host(Z) ) )
             => ( ~ setIn(Z,alive)
                | ~ setIn(Pid0,alive) ) )
          & ! [Z,Pid30,Pid20,Pid0] :
              ( ( ( host(Pid20) != host(Z) )
                & setIn(Z,alive)
                & setIn(Pid20,alive)
                & ( host(Pid30) = host(Z) )
                & ( host(Pid0) = host(Pid20) ) )
             => ~ ( elem(m_Down(Pid0),queue(host(Z)))
                  & elem(m_Down(Pid30),queue(host(Pid20))) ) )
          & ( queue(host(Y)) = cons(m_NotNorm(X),V) ) )
       => ( setIn(Y,alive)
         => ( ( ( index(ldr,host(Y)) = host(Y) )
              & ( index(status,host(Y)) = norm )
              & ( index(elid,host(Y)) = X ) )
           => ( ( ! [Z] :
                    ( ( host(Y) = host(Z) )
                   => leq(Z,W) )
                & ~ setIn(W,pids)
                & ( host(Y) = host(W) ) )
             => ( ( host(W) = s(zero) )
               => ( ~ leq(nbr_proc,host(W))
                 => ! [Z] :
                      ( ( s(host(W)) = host(Z) )
                     => ( ( host(Y) != host(Z) )
                       => ! [X0,Y0] :
                            ( ( s(host(W)) != host(Y0) )
                           => ( ( host(Y) = host(Y0) )
                             => ! [Z0] :
                                  ( ( ( ( ( Z != Y )
                                        & setIn(Z,alive) )
                                      | ( Z = W ) )
                                    & ( ( ( Y0 != Y )
                                        & setIn(Y0,alive) )
                                      | ( Y0 = W ) )
                                    & ( host(Y0) != host(Z) )
                                    & ( host(X0) = host(Z) )
                                    & ( host(Z0) = host(Y0) ) )
                                 => ~ ( elem(m_Down(X0),V)
                                      & elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W))) ) ) ) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

tff(f_224,axiom,
    ! [X,Y,Q] :
      ( elem(X,cons(Y,Q))
    <=> ( ( X = Y )
        | elem(X,Q) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).

tff(f_107,axiom,
    ! [X,Y] : ( m_Down(X) != m_Halt(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_17) ).

tff(f_230,axiom,
    ! [X,Y,Q] :
      ( elem(X,snoc(Q,Y))
    <=> ( ( X = Y )
        | elem(X,Q) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).

tff(c_206,plain,
    host('#skF_10') = host('#skF_9'),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_202,plain,
    elem(m_Down('#skF_10'),'#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_204,plain,
    host('#skF_11') = host('#skF_12'),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_210,plain,
    host('#skF_11') = host('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_267,plain,
    host('#skF_8') = host('#skF_12'),
    inference(demodulation,[status(thm),theory(equality)],[c_204,c_210]) ).

tff(c_236,plain,
    cons(m_NotNorm('#skF_7'),'#skF_5') = queue(host('#skF_8')),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_277,plain,
    cons(m_NotNorm('#skF_7'),'#skF_5') = queue(host('#skF_12')),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_236]) ).

tff(c_35609,plain,
    ! [X_1209,Q_1210,Y_1211] :
      ( ~ elem(X_1209,Q_1210)
      | elem(X_1209,cons(Y_1211,Q_1210)) ),
    inference(cnfTransformation,[status(thm)],[f_224]) ).

tff(c_35615,plain,
    ! [X_1209] :
      ( ~ elem(X_1209,'#skF_5')
      | elem(X_1209,queue(host('#skF_12'))) ),
    inference(superposition,[status(thm),theory(equality)],[c_277,c_35609]) ).

tff(c_214,plain,
    host('#skF_9') != host('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_273,plain,
    host('#skF_9') != host('#skF_12'),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_214]) ).

tff(c_256,plain,
    ( ( '#skF_11' != '#skF_8' )
    | ( '#skF_11' = '#skF_6' ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_314,plain,
    '#skF_11' != '#skF_8',
    inference(splitLeft,[status(thm)],[c_256]) ).

tff(c_254,plain,
    ( setIn('#skF_11',alive)
    | ( '#skF_11' = '#skF_6' ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_367,plain,
    '#skF_11' = '#skF_6',
    inference(splitLeft,[status(thm)],[c_254]) ).

tff(c_369,plain,
    '#skF_6' != '#skF_8',
    inference(demodulation,[status(thm),theory(equality)],[c_367,c_314]) ).

tff(c_222,plain,
    host('#skF_6') = host('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_268,plain,
    host('#skF_6') = host('#skF_12'),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_222]) ).

tff(c_226,plain,
    ! [Z_174] :
      ( leq(Z_174,'#skF_6')
      | ( host(Z_174) != host('#skF_8') ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_275,plain,
    ! [Z_174] :
      ( leq(Z_174,'#skF_6')
      | ( host(Z_174) != host('#skF_12') ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_226]) ).

tff(c_234,plain,
    setIn('#skF_8',alive),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_786,plain,
    ! [Pid0_283,Z_284] :
      ( ~ setIn(Pid0_283,alive)
      | ( host(Z_284) != host(Pid0_283) )
      | ~ leq(Pid0_283,Z_284)
      | setIn(Z_284,alive) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_790,plain,
    ! [Z_284] :
      ( ( host(Z_284) != host('#skF_8') )
      | ~ leq('#skF_8',Z_284)
      | setIn(Z_284,alive) ),
    inference(resolution,[status(thm)],[c_234,c_786]) ).

tff(c_8863,plain,
    ! [Z_573] :
      ( ( host(Z_573) != host('#skF_12') )
      | ~ leq('#skF_8',Z_573)
      | setIn(Z_573,alive) ),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_790]) ).

tff(c_744,plain,
    ! [Pid0_279,Z_280] :
      ( ~ setIn(Pid0_279,alive)
      | ~ setIn(Z_280,alive)
      | ( host(Z_280) != host(Pid0_279) )
      | ( Z_280 = Pid0_279 ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_748,plain,
    ! [Z_280] :
      ( ~ setIn(Z_280,alive)
      | ( host(Z_280) != host('#skF_8') )
      | ( Z_280 = '#skF_8' ) ),
    inference(resolution,[status(thm)],[c_234,c_744]) ).

tff(c_751,plain,
    ! [Z_280] :
      ( ~ setIn(Z_280,alive)
      | ( host(Z_280) != host('#skF_12') )
      | ( Z_280 = '#skF_8' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_748]) ).

tff(c_29442,plain,
    ! [Z_822] :
      ( ( Z_822 = '#skF_8' )
      | ( host(Z_822) != host('#skF_12') )
      | ~ leq('#skF_8',Z_822) ),
    inference(resolution,[status(thm)],[c_8863,c_751]) ).

tff(c_29668,plain,
    ( ( '#skF_6' = '#skF_8' )
    | ( host('#skF_6') != host('#skF_12') )
    | ( host('#skF_8') != host('#skF_12') ) ),
    inference(resolution,[status(thm)],[c_275,c_29442]) ).

tff(c_29787,plain,
    '#skF_6' = '#skF_8',
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_268,c_29668]) ).

tff(c_29789,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_369,c_29787]) ).

tff(c_29790,plain,
    setIn('#skF_11',alive),
    inference(splitRight,[status(thm)],[c_254]) ).

tff(c_30046,plain,
    ! [Pid0_878,Z_879] :
      ( ~ setIn(Pid0_878,alive)
      | ~ setIn(Z_879,alive)
      | ( host(Z_879) != host(Pid0_878) )
      | ( Z_879 = Pid0_878 ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_30052,plain,
    ! [Z_879] :
      ( ~ setIn(Z_879,alive)
      | ( host(Z_879) != host('#skF_8') )
      | ( Z_879 = '#skF_8' ) ),
    inference(resolution,[status(thm)],[c_234,c_30046]) ).

tff(c_34341,plain,
    ! [Z_1070] :
      ( ~ setIn(Z_1070,alive)
      | ( host(Z_1070) != host('#skF_12') )
      | ( Z_1070 = '#skF_8' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_267,c_30052]) ).

tff(c_34347,plain,
    ( ( host('#skF_11') != host('#skF_12') )
    | ( '#skF_11' = '#skF_8' ) ),
    inference(resolution,[status(thm)],[c_29790,c_34341]) ).

tff(c_34357,plain,
    '#skF_11' = '#skF_8',
    inference(demodulation,[status(thm),theory(equality)],[c_204,c_34347]) ).

tff(c_34359,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_314,c_34357]) ).

tff(c_34361,plain,
    '#skF_11' = '#skF_8',
    inference(splitRight,[status(thm)],[c_256]) ).

tff(c_34360,plain,
    '#skF_11' = '#skF_6',
    inference(splitRight,[status(thm)],[c_256]) ).

tff(c_34366,plain,
    '#skF_6' = '#skF_8',
    inference(demodulation,[status(thm),theory(equality)],[c_34361,c_34360]) ).

tff(c_34371,plain,
    host('#skF_8') = host('#skF_12'),
    inference(demodulation,[status(thm),theory(equality)],[c_34366,c_268]) ).

tff(c_260,plain,
    ( ( '#skF_9' != '#skF_8' )
    | ( '#skF_6' = '#skF_9' ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_313,plain,
    '#skF_9' != '#skF_8',
    inference(splitLeft,[status(thm)],[c_260]) ).

tff(c_258,plain,
    ( setIn('#skF_9',alive)
    | ( '#skF_6' = '#skF_9' ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_34407,plain,
    ( setIn('#skF_9',alive)
    | ( '#skF_9' = '#skF_8' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34366,c_258]) ).

tff(c_34408,plain,
    setIn('#skF_9',alive),
    inference(negUnitSimplification,[status(thm)],[c_313,c_34407]) ).

tff(c_38,plain,
    ! [Y_25,X_24] : ( m_Halt(Y_25) != m_Down(X_24) ),
    inference(cnfTransformation,[status(thm)],[f_107]) ).

tff(c_200,plain,
    elem(m_Down('#skF_12'),snoc(queue(host('#skF_9')),m_Halt('#skF_6'))),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_34533,plain,
    elem(m_Down('#skF_12'),snoc(queue(host('#skF_9')),m_Halt('#skF_8'))),
    inference(demodulation,[status(thm),theory(equality)],[c_34366,c_200]) ).

tff(c_37972,plain,
    ! [X_1312,Q_1313,Y_1314] :
      ( elem(X_1312,Q_1313)
      | ( Y_1314 = X_1312 )
      | ~ elem(X_1312,snoc(Q_1313,Y_1314)) ),
    inference(cnfTransformation,[status(thm)],[f_230]) ).

tff(c_37995,plain,
    ( elem(m_Down('#skF_12'),queue(host('#skF_9')))
    | ( m_Halt('#skF_8') = m_Down('#skF_12') ) ),
    inference(resolution,[status(thm)],[c_34533,c_37972]) ).

tff(c_38009,plain,
    elem(m_Down('#skF_12'),queue(host('#skF_9'))),
    inference(negUnitSimplification,[status(thm)],[c_38,c_37995]) ).

tff(c_238,plain,
    ! [Pid30_171,Pid20_172,Pid0_173,Z_170] :
      ( ~ elem(m_Down(Pid30_171),queue(host(Pid20_172)))
      | ~ elem(m_Down(Pid0_173),queue(host(Z_170)))
      | ( host(Pid20_172) != host(Pid0_173) )
      | ( host(Z_170) != host(Pid30_171) )
      | ~ setIn(Pid20_172,alive)
      | ~ setIn(Z_170,alive)
      | ( host(Z_170) = host(Pid20_172) ) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_38013,plain,
    ! [Pid0_173,Z_170] :
      ( ~ elem(m_Down(Pid0_173),queue(host(Z_170)))
      | ( host(Pid0_173) != host('#skF_9') )
      | ( host(Z_170) != host('#skF_12') )
      | ~ setIn('#skF_9',alive)
      | ~ setIn(Z_170,alive)
      | ( host(Z_170) = host('#skF_9') ) ),
    inference(resolution,[status(thm)],[c_38009,c_238]) ).

tff(c_517991,plain,
    ! [Pid0_3352,Z_3353] :
      ( ~ elem(m_Down(Pid0_3352),queue(host(Z_3353)))
      | ( host(Pid0_3352) != host('#skF_9') )
      | ( host(Z_3353) != host('#skF_12') )
      | ~ setIn(Z_3353,alive)
      | ( host(Z_3353) = host('#skF_9') ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34408,c_38013]) ).

tff(c_518016,plain,
    ! [Pid0_3352] :
      ( ~ elem(m_Down(Pid0_3352),queue(host('#skF_12')))
      | ( host(Pid0_3352) != host('#skF_9') )
      | ( host('#skF_8') != host('#skF_12') )
      | ~ setIn('#skF_8',alive)
      | ( host('#skF_9') = host('#skF_8') ) ),
    inference(superposition,[status(thm),theory(equality)],[c_34371,c_517991]) ).

tff(c_518026,plain,
    ! [Pid0_3352] :
      ( ~ elem(m_Down(Pid0_3352),queue(host('#skF_12')))
      | ( host(Pid0_3352) != host('#skF_9') )
      | ( host('#skF_9') = host('#skF_12') ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34371,c_234,c_34371,c_518016]) ).

tff(c_518029,plain,
    ! [Pid0_3354] :
      ( ~ elem(m_Down(Pid0_3354),queue(host('#skF_12')))
      | ( host(Pid0_3354) != host('#skF_9') ) ),
    inference(negUnitSimplification,[status(thm)],[c_273,c_518026]) ).

tff(c_518043,plain,
    ! [Pid0_3355] :
      ( ( host(Pid0_3355) != host('#skF_9') )
      | ~ elem(m_Down(Pid0_3355),'#skF_5') ),
    inference(resolution,[status(thm)],[c_35615,c_518029]) ).

tff(c_518055,plain,
    host('#skF_10') != host('#skF_9'),
    inference(resolution,[status(thm)],[c_202,c_518043]) ).

tff(c_518059,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_206,c_518055]) ).

tff(c_518061,plain,
    '#skF_9' = '#skF_8',
    inference(splitRight,[status(thm)],[c_260]) ).

tff(c_518060,plain,
    '#skF_6' = '#skF_9',
    inference(splitRight,[status(thm)],[c_260]) ).

tff(c_518062,plain,
    host('#skF_9') = host('#skF_12'),
    inference(demodulation,[status(thm),theory(equality)],[c_518060,c_268]) ).

tff(c_518082,plain,
    host('#skF_8') = host('#skF_12'),
    inference(demodulation,[status(thm),theory(equality)],[c_518061,c_518062]) ).

tff(c_518121,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_518082,c_518061,c_273]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV451+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 22:57:56 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 137.84/121.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 137.84/121.72  
% 137.84/121.72  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 138.00/121.79  
% 138.00/121.79  Inference rules
% 138.00/121.79  ----------------------
% 138.00/121.79  #Ref     : 68
% 138.00/121.79  #Sup     : 113287
% 138.00/121.79  #Fact    : 92
% 138.00/121.79  #Define  : 0
% 138.00/121.79  #Split   : 100
% 138.00/121.79  #Chain   : 0
% 138.00/121.79  #Close   : 0
% 138.00/121.79  
% 138.00/121.79  Ordering : KBO
% 138.00/121.79  
% 138.00/121.79  Simplification rules
% 138.00/121.79  ----------------------
% 138.00/121.79  #Subsume      : 50042
% 138.00/121.79  #Demod        : 65549
% 138.00/121.79  #Tautology    : 26005
% 138.00/121.79  #SimpNegUnit  : 3051
% 138.00/121.79  #BackRed      : 901
% 138.00/121.79  
% 138.00/121.79  #Partial instantiations: 0
% 138.00/121.79  #Strategies tried      : 1
% 138.00/121.79  
% 138.00/121.79  Timing (in seconds)
% 138.00/121.79  ----------------------
% 138.00/121.80  Preprocessing        : 0.72
% 138.00/121.80  Parsing              : 0.33
% 138.00/121.80  CNF conversion       : 0.06
% 138.00/121.80  Main loop            : 119.97
% 138.00/121.80  Inferencing          : 9.04
% 138.00/121.80  Reduction            : 53.35
% 138.00/121.80  Demodulation         : 37.51
% 138.00/121.80  BG Simplification    : 0.40
% 138.00/121.80  Subsumption          : 48.15
% 138.00/121.80  Abstraction          : 0.83
% 138.00/121.80  MUC search           : 0.00
% 138.00/121.80  Cooper               : 0.00
% 138.00/121.80  Total                : 120.79
% 138.00/121.80  Index Insertion      : 0.00
% 138.00/121.80  Index Deletion       : 0.00
% 138.00/121.80  Index Matching       : 0.00
% 138.00/121.80  BG Taut test         : 0.00
%------------------------------------------------------------------------------