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

View Problem - Process Solution

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

% Computer : n024.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:01:35 EDT 2023

% Result   : Theorem 33.40s 19.30s
% Output   : CNFRefutation 33.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   88
% Syntax   : Number of formulae    :  146 (  24 unt;  76 typ;   0 def)
%            Number of atoms       :  171 (  68 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  170 (  69   ~;  73   |;   4   &)
%                                         (   2 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   86 (  69   >;  17   *;   0   +;   0  <<)
%            Number of predicates  :   21 (  19 usr;   1 prp; 0-2 aty)
%            Number of functors    :   57 (  57 usr;   7 con; 0-2 aty)
%            Number of variables   :   48 (;  44   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > cons > app > #nlpp > tl > hd > nil > #skF_36 > #skF_25 > #skF_5 > #skF_44 > #skF_21 > #skF_16 > #skF_6 > #skF_49 > #skF_18 > #skF_24 > #skF_35 > #skF_19 > #skF_31 > #skF_22 > #skF_37 > #skF_40 > #skF_48 > #skF_3 > #skF_52 > #skF_34 > #skF_29 > #skF_15 > #skF_32 > #skF_51 > #skF_28 > #skF_10 > #skF_41 > #skF_2 > #skF_38 > #skF_43 > #skF_1 > #skF_8 > #skF_39 > #skF_23 > #skF_33 > #skF_26 > #skF_50 > #skF_13 > #skF_17 > #skF_11 > #skF_14 > #skF_27 > #skF_12 > #skF_7 > #skF_46 > #skF_42 > #skF_45 > #skF_9 > #skF_30 > #skF_4 > #skF_20 > #skF_47

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_36',type,
    '#skF_36': $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_1008,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( ( V != X )
                      | ( U != W )
                      | ~ singletonP(W)
                      | ? [Y] :
                          ( ssItem(Y)
                          & ! [Z] :
                              ( ssItem(Z)
                             => ( ~ memberP(U,Z)
                                | ( Y = Z ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f_779,axiom,
    ! [U] :
      ( ssList(U)
     => ( ( nil != U )
       => ? [V] :
            ( ssList(V)
            & ( tl(U) = V ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax76) ).

tff(f_519,axiom,
    ~ singletonP(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).

tff(f_769,axiom,
    ! [U] :
      ( ssList(U)
     => ( ( nil != U )
       => ? [V] :
            ( ssItem(V)
            & ( hd(U) = V ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax75) ).

tff(f_371,axiom,
    ! [U] :
      ( ssList(U)
     => ( ( nil != U )
       => ssItem(hd(U)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).

tff(f_319,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

tff(f_385,axiom,
    ! [U] :
      ( ssList(U)
     => ( ( nil != U )
       => ssList(tl(U)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).

tff(f_803,axiom,
    ! [U] :
      ( ssList(U)
     => ( ( nil != U )
       => ( cons(hd(U),tl(U)) = U ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).

tff(f_512,axiom,
    ! [U] :
      ( ssItem(U)
     => ! [V] :
          ( ssItem(V)
         => ! [W] :
              ( ssList(W)
             => ( memberP(cons(V,W),U)
              <=> ( ( U = V )
                  | memberP(W,U) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).

tff(f_517,axiom,
    ! [U] :
      ( ssItem(U)
     => ~ memberP(nil,U) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).

tff(f_96,axiom,
    ! [U] :
      ( ssList(U)
     => ( singletonP(U)
      <=> ? [V] :
            ( ssItem(V)
            & ( cons(V,nil) = U ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).

tff(f_392,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssItem(V)
         => ( tl(cons(V,U)) = U ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).

tff(c_384,plain,
    singletonP('#skF_50'),
    inference(cnfTransformation,[status(thm)],[f_1008]) ).

tff(c_392,plain,
    ssList('#skF_50'),
    inference(cnfTransformation,[status(thm)],[f_1008]) ).

tff(c_959,plain,
    ! [U_1256] :
      ( ( tl(U_1256) = '#skF_47'(U_1256) )
      | ( nil = U_1256 )
      | ~ ssList(U_1256) ),
    inference(cnfTransformation,[status(thm)],[f_779]) ).

tff(c_1064,plain,
    ( ( tl('#skF_50') = '#skF_47'('#skF_50') )
    | ( nil = '#skF_50' ) ),
    inference(resolution,[status(thm)],[c_392,c_959]) ).

tff(c_18939,plain,
    nil = '#skF_50',
    inference(splitLeft,[status(thm)],[c_1064]) ).

tff(c_230,plain,
    ~ singletonP(nil),
    inference(cnfTransformation,[status(thm)],[f_519]) ).

tff(c_18977,plain,
    ~ singletonP('#skF_50'),
    inference(demodulation,[status(thm),theory(equality)],[c_18939,c_230]) ).

tff(c_18983,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_384,c_18977]) ).

tff(c_18985,plain,
    nil != '#skF_50',
    inference(splitRight,[status(thm)],[c_1064]) ).

tff(c_19170,plain,
    ! [U_1960] :
      ( ( hd(U_1960) = '#skF_46'(U_1960) )
      | ( nil = U_1960 )
      | ~ ssList(U_1960) ),
    inference(cnfTransformation,[status(thm)],[f_769]) ).

tff(c_19257,plain,
    ( ( hd('#skF_50') = '#skF_46'('#skF_50') )
    | ( nil = '#skF_50' ) ),
    inference(resolution,[status(thm)],[c_392,c_19170]) ).

tff(c_19291,plain,
    hd('#skF_50') = '#skF_46'('#skF_50'),
    inference(negUnitSimplification,[status(thm)],[c_18985,c_19257]) ).

tff(c_583,plain,
    ! [U_1214] :
      ( ssItem(hd(U_1214))
      | ( nil = U_1214 )
      | ~ ssList(U_1214) ),
    inference(cnfTransformation,[status(thm)],[f_371]) ).

tff(c_398,plain,
    ! [Y_1178] :
      ( ( '#skF_52'(Y_1178) != Y_1178 )
      | ~ ssItem(Y_1178) ),
    inference(cnfTransformation,[status(thm)],[f_1008]) ).

tff(c_587,plain,
    ! [U_1214] :
      ( ( '#skF_52'(hd(U_1214)) != hd(U_1214) )
      | ( nil = U_1214 )
      | ~ ssList(U_1214) ),
    inference(resolution,[status(thm)],[c_583,c_398]) ).

tff(c_19315,plain,
    ( ( '#skF_52'('#skF_46'('#skF_50')) != hd('#skF_50') )
    | ( nil = '#skF_50' )
    | ~ ssList('#skF_50') ),
    inference(superposition,[status(thm),theory(equality)],[c_19291,c_587]) ).

tff(c_19322,plain,
    ( ( '#skF_52'('#skF_46'('#skF_50')) != '#skF_46'('#skF_50') )
    | ( nil = '#skF_50' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_392,c_19291,c_19315]) ).

tff(c_19323,plain,
    '#skF_52'('#skF_46'('#skF_50')) != '#skF_46'('#skF_50'),
    inference(negUnitSimplification,[status(thm)],[c_18985,c_19322]) ).

tff(c_184,plain,
    ! [U_888] :
      ( ssItem(hd(U_888))
      | ( nil = U_888 )
      | ~ ssList(U_888) ),
    inference(cnfTransformation,[status(thm)],[f_371]) ).

tff(c_19318,plain,
    ( ssItem('#skF_46'('#skF_50'))
    | ( nil = '#skF_50' )
    | ~ ssList('#skF_50') ),
    inference(superposition,[status(thm),theory(equality)],[c_19291,c_184]) ).

tff(c_19325,plain,
    ( ssItem('#skF_46'('#skF_50'))
    | ( nil = '#skF_50' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_392,c_19318]) ).

tff(c_19326,plain,
    ssItem('#skF_46'('#skF_50')),
    inference(negUnitSimplification,[status(thm)],[c_18985,c_19325]) ).

tff(c_402,plain,
    ! [Y_1178] :
      ( ssItem('#skF_52'(Y_1178))
      | ~ ssItem(Y_1178) ),
    inference(cnfTransformation,[status(thm)],[f_1008]) ).

tff(c_386,plain,
    '#skF_48' = '#skF_50',
    inference(cnfTransformation,[status(thm)],[f_1008]) ).

tff(c_400,plain,
    ! [Y_1178] :
      ( memberP('#skF_48','#skF_52'(Y_1178))
      | ~ ssItem(Y_1178) ),
    inference(cnfTransformation,[status(thm)],[f_1008]) ).

tff(c_406,plain,
    ! [Y_1178] :
      ( memberP('#skF_50','#skF_52'(Y_1178))
      | ~ ssItem(Y_1178) ),
    inference(demodulation,[status(thm),theory(equality)],[c_386,c_400]) ).

tff(c_168,plain,
    ssList(nil),
    inference(cnfTransformation,[status(thm)],[f_319]) ).

tff(c_18984,plain,
    tl('#skF_50') = '#skF_47'('#skF_50'),
    inference(splitRight,[status(thm)],[c_1064]) ).

tff(c_188,plain,
    ! [U_892] :
      ( ssList(tl(U_892))
      | ( nil = U_892 )
      | ~ ssList(U_892) ),
    inference(cnfTransformation,[status(thm)],[f_385]) ).

tff(c_18989,plain,
    ( ssList('#skF_47'('#skF_50'))
    | ( nil = '#skF_50' )
    | ~ ssList('#skF_50') ),
    inference(superposition,[status(thm),theory(equality)],[c_18984,c_188]) ).

tff(c_18993,plain,
    ( ssList('#skF_47'('#skF_50'))
    | ( nil = '#skF_50' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_392,c_18989]) ).

tff(c_18994,plain,
    ssList('#skF_47'('#skF_50')),
    inference(negUnitSimplification,[status(thm)],[c_18985,c_18993]) ).

tff(c_19258,plain,
    ( ( hd('#skF_47'('#skF_50')) = '#skF_46'('#skF_47'('#skF_50')) )
    | ( '#skF_47'('#skF_50') = nil ) ),
    inference(resolution,[status(thm)],[c_18994,c_19170]) ).

tff(c_20419,plain,
    '#skF_47'('#skF_50') = nil,
    inference(splitLeft,[status(thm)],[c_19258]) ).

tff(c_20426,plain,
    tl('#skF_50') = nil,
    inference(demodulation,[status(thm),theory(equality)],[c_20419,c_18984]) ).

tff(c_20452,plain,
    ! [U_2029] :
      ( ( cons(hd(U_2029),tl(U_2029)) = U_2029 )
      | ( nil = U_2029 )
      | ~ ssList(U_2029) ),
    inference(cnfTransformation,[status(thm)],[f_803]) ).

tff(c_20492,plain,
    ( ( cons('#skF_46'('#skF_50'),tl('#skF_50')) = '#skF_50' )
    | ( nil = '#skF_50' )
    | ~ ssList('#skF_50') ),
    inference(superposition,[status(thm),theory(equality)],[c_19291,c_20452]) ).

tff(c_20510,plain,
    ( ( cons('#skF_46'('#skF_50'),nil) = '#skF_50' )
    | ( nil = '#skF_50' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_392,c_20426,c_20492]) ).

tff(c_20511,plain,
    cons('#skF_46'('#skF_50'),nil) = '#skF_50',
    inference(negUnitSimplification,[status(thm)],[c_18985,c_20510]) ).

tff(c_31940,plain,
    ! [W_2365,U_2366,V_2367] :
      ( memberP(W_2365,U_2366)
      | ( V_2367 = U_2366 )
      | ~ memberP(cons(V_2367,W_2365),U_2366)
      | ~ ssList(W_2365)
      | ~ ssItem(V_2367)
      | ~ ssItem(U_2366) ),
    inference(cnfTransformation,[status(thm)],[f_512]) ).

tff(c_31964,plain,
    ! [U_2366] :
      ( memberP(nil,U_2366)
      | ( U_2366 = '#skF_46'('#skF_50') )
      | ~ memberP('#skF_50',U_2366)
      | ~ ssList(nil)
      | ~ ssItem('#skF_46'('#skF_50'))
      | ~ ssItem(U_2366) ),
    inference(superposition,[status(thm),theory(equality)],[c_20511,c_31940]) ).

tff(c_71718,plain,
    ! [U_2989] :
      ( memberP(nil,U_2989)
      | ( U_2989 = '#skF_46'('#skF_50') )
      | ~ memberP('#skF_50',U_2989)
      | ~ ssItem(U_2989) ),
    inference(demodulation,[status(thm),theory(equality)],[c_19326,c_168,c_31964]) ).

tff(c_228,plain,
    ! [U_948] :
      ( ~ memberP(nil,U_948)
      | ~ ssItem(U_948) ),
    inference(cnfTransformation,[status(thm)],[f_517]) ).

tff(c_71724,plain,
    ! [U_2990] :
      ( ( U_2990 = '#skF_46'('#skF_50') )
      | ~ memberP('#skF_50',U_2990)
      | ~ ssItem(U_2990) ),
    inference(resolution,[status(thm)],[c_71718,c_228]) ).

tff(c_71754,plain,
    ! [Y_2991] :
      ( ( '#skF_52'(Y_2991) = '#skF_46'('#skF_50') )
      | ~ ssItem('#skF_52'(Y_2991))
      | ~ ssItem(Y_2991) ),
    inference(resolution,[status(thm)],[c_406,c_71724]) ).

tff(c_71759,plain,
    ! [Y_2992] :
      ( ( '#skF_52'(Y_2992) = '#skF_46'('#skF_50') )
      | ~ ssItem(Y_2992) ),
    inference(resolution,[status(thm)],[c_402,c_71754]) ).

tff(c_71765,plain,
    '#skF_52'('#skF_46'('#skF_50')) = '#skF_46'('#skF_50'),
    inference(resolution,[status(thm)],[c_19326,c_71759]) ).

tff(c_71836,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19323,c_71765]) ).

tff(c_71838,plain,
    '#skF_47'('#skF_50') != nil,
    inference(splitRight,[status(thm)],[c_19258]) ).

tff(c_24,plain,
    ! [U_30] :
      ( ssItem('#skF_5'(U_30))
      | ~ singletonP(U_30)
      | ~ ssList(U_30) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_19392,plain,
    ! [U_1976] :
      ( ( cons('#skF_5'(U_1976),nil) = U_1976 )
      | ~ singletonP(U_1976)
      | ~ ssList(U_1976) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_190,plain,
    ! [V_895,U_893] :
      ( ( tl(cons(V_895,U_893)) = U_893 )
      | ~ ssItem(V_895)
      | ~ ssList(U_893) ),
    inference(cnfTransformation,[status(thm)],[f_392]) ).

tff(c_19401,plain,
    ! [U_1976] :
      ( ( tl(U_1976) = nil )
      | ~ ssItem('#skF_5'(U_1976))
      | ~ ssList(nil)
      | ~ singletonP(U_1976)
      | ~ ssList(U_1976) ),
    inference(superposition,[status(thm),theory(equality)],[c_19392,c_190]) ).

tff(c_72581,plain,
    ! [U_3012] :
      ( ( tl(U_3012) = nil )
      | ~ ssItem('#skF_5'(U_3012))
      | ~ singletonP(U_3012)
      | ~ ssList(U_3012) ),
    inference(demodulation,[status(thm),theory(equality)],[c_168,c_19401]) ).

tff(c_72591,plain,
    ! [U_3014] :
      ( ( tl(U_3014) = nil )
      | ~ singletonP(U_3014)
      | ~ ssList(U_3014) ),
    inference(resolution,[status(thm)],[c_24,c_72581]) ).

tff(c_72693,plain,
    ( ( tl('#skF_50') = nil )
    | ~ singletonP('#skF_50') ),
    inference(resolution,[status(thm)],[c_392,c_72591]) ).

tff(c_72733,plain,
    '#skF_47'('#skF_50') = nil,
    inference(demodulation,[status(thm),theory(equality)],[c_384,c_18984,c_72693]) ).

tff(c_72735,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_71838,c_72733]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : SWC200+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 21:36:00 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 33.40/19.30  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.40/19.31  
% 33.40/19.31  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 33.40/19.35  
% 33.40/19.35  Inference rules
% 33.40/19.35  ----------------------
% 33.40/19.35  #Ref     : 12
% 33.40/19.35  #Sup     : 15791
% 33.40/19.35  #Fact    : 0
% 33.40/19.35  #Define  : 0
% 33.40/19.35  #Split   : 70
% 33.40/19.35  #Chain   : 0
% 33.40/19.35  #Close   : 0
% 33.40/19.35  
% 33.40/19.35  Ordering : KBO
% 33.40/19.35  
% 33.40/19.35  Simplification rules
% 33.40/19.35  ----------------------
% 33.40/19.35  #Subsume      : 3117
% 33.40/19.35  #Demod        : 14160
% 33.40/19.35  #Tautology    : 3776
% 33.40/19.35  #SimpNegUnit  : 1738
% 33.40/19.35  #BackRed      : 198
% 33.40/19.35  
% 33.40/19.35  #Partial instantiations: 0
% 33.40/19.35  #Strategies tried      : 1
% 33.40/19.35  
% 33.40/19.35  Timing (in seconds)
% 33.40/19.35  ----------------------
% 33.40/19.35  Preprocessing        : 1.02
% 33.40/19.35  Parsing              : 0.42
% 33.40/19.35  CNF conversion       : 0.14
% 33.40/19.35  Main loop            : 17.25
% 33.40/19.35  Inferencing          : 3.83
% 33.40/19.35  Reduction            : 7.13
% 33.40/19.35  Demodulation         : 4.90
% 33.40/19.35  BG Simplification    : 0.21
% 33.40/19.35  Subsumption          : 4.90
% 33.40/19.35  Abstraction          : 0.24
% 33.40/19.35  MUC search           : 0.00
% 33.40/19.35  Cooper               : 0.00
% 33.40/19.35  Total                : 18.34
% 33.40/19.35  Index Insertion      : 0.00
% 33.40/19.35  Index Deletion       : 0.00
% 33.40/19.35  Index Matching       : 0.00
% 33.40/19.35  BG Taut test         : 0.00
%------------------------------------------------------------------------------