TSTP Solution File: SYN207-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN207-1 : TPTP v8.1.2. Released v1.1.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 : n016.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:09:57 EDT 2023

% Result   : Unsatisfiable 103.79s 87.06s
% Output   : CNFRefutation 103.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   71
% Syntax   : Number of formulae    :  125 (  39 unt;  53 typ;   0 def)
%            Number of atoms       :  134 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  131 (  69   ~;  62   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   90 (  48   >;  42   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   79 (;  79   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r3 > q2 > q1 > p5 > p4 > p3 > p2 > p1 > n1 > m3 > m1 > m0 > k3 > s3 > r5 > q5 > q4 > q3 > q0 > p0 > n5 > n4 > n0 > m5 > m4 > l3 > l2 > l1 > k2 > s5 > s4 > s2 > s1 > s0 > r4 > r2 > r1 > r0 > n3 > n2 > m2 > l5 > l4 > l0 > k5 > k4 > k1 > k0 > #nlpp > e > d > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(n5,type,
    n5: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_2764,axiom,
    ~ s3(c,c),
    file(unknown,unknown) ).

tff(f_77,axiom,
    n0(e,e),
    file(unknown,unknown) ).

tff(f_91,axiom,
    ! [I,J] :
      ( k1(I)
      | ~ n0(J,I) ),
    file(unknown,unknown) ).

tff(f_70,axiom,
    m0(a,e,e),
    file(unknown,unknown) ).

tff(f_59,axiom,
    ! [X] : p0(b,X),
    file(unknown,unknown) ).

tff(f_63,axiom,
    ! [X] : q0(X,d),
    file(unknown,unknown) ).

tff(f_1081,axiom,
    ! [F,G,H] :
      ( s1(F)
      | ~ q0(F,G)
      | ~ s1(H) ),
    file(unknown,unknown) ).

tff(f_1073,axiom,
    ! [I] :
      ( s1(I)
      | ~ p0(I,I) ),
    file(unknown,unknown) ).

tff(f_1141,axiom,
    ! [J,A,B,C] :
      ( l2(J,J)
      | ~ p0(A,A)
      | ~ s1(B)
      | ~ m0(C,B,J) ),
    file(unknown,unknown) ).

tff(f_1123,axiom,
    ! [D,E] :
      ( l2(D,E)
      | ~ s1(D)
      | ~ n0(e,E)
      | ~ l2(E,E) ),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [X,Y] : m0(X,d,Y),
    file(unknown,unknown) ).

tff(f_1164,axiom,
    ( m2(b)
    | ~ k1(b) ),
    file(unknown,unknown) ).

tff(f_60,axiom,
    n0(a,b),
    file(unknown,unknown) ).

tff(f_71,axiom,
    l0(c),
    file(unknown,unknown) ).

tff(f_1546,axiom,
    ! [D,E] :
      ( q2(D,c,E)
      | ~ k1(E)
      | ~ l0(c)
      | ~ l2(E,D) ),
    file(unknown,unknown) ).

tff(f_1597,axiom,
    ! [H] :
      ( s2(H)
      | ~ q2(b,H,b)
      | ~ s1(b) ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    m0(e,b,c),
    file(unknown,unknown) ).

tff(f_2297,axiom,
    ! [I,J,A,B] :
      ( s3(I,J)
      | ~ q2(A,I,A)
      | ~ s2(I)
      | ~ m0(A,B,J) ),
    file(unknown,unknown) ).

tff(c_738,plain,
    ~ s3(c,c),
    inference(cnfTransformation,[status(thm)],[f_2764]) ).

tff(c_60,plain,
    n0(e,e),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_14253,plain,
    ! [J_2622,I_2623] :
      ( ~ n0(J_2622,I_2623)
      | k1(I_2623) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_14284,plain,
    k1(e),
    inference(resolution,[status(thm)],[c_60,c_14253]) ).

tff(c_46,plain,
    m0(a,e,e),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_28,plain,
    ! [X_2] : p0(b,X_2),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_34,plain,
    ! [X_3] : q0(X_3,d),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_328,plain,
    ! [H_236,F_234,G_235] :
      ( ~ s1(H_236)
      | ~ q0(F_234,G_235)
      | s1(F_234) ),
    inference(cnfTransformation,[status(thm)],[f_1081]) ).

tff(c_377784,plain,
    ! [H_236] : ~ s1(H_236),
    inference(splitLeft,[status(thm)],[c_328]) ).

tff(c_1416,plain,
    ! [I_755] :
      ( ~ p0(I_755,I_755)
      | s1(I_755) ),
    inference(cnfTransformation,[status(thm)],[f_1073]) ).

tff(c_1421,plain,
    s1(b),
    inference(resolution,[status(thm)],[c_28,c_1416]) ).

tff(c_377788,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_377784,c_1421]) ).

tff(c_377799,plain,
    ! [F_41055,G_41056] :
      ( ~ q0(F_41055,G_41056)
      | s1(F_41055) ),
    inference(splitRight,[status(thm)],[c_328]) ).

tff(c_377822,plain,
    ! [X_3] : s1(X_3),
    inference(resolution,[status(thm)],[c_34,c_377799]) ).

tff(c_342,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ s1(B_248)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(cnfTransformation,[status(thm)],[f_1141]) ).

tff(c_427655,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(demodulation,[status(thm),theory(equality)],[c_377822,c_342]) ).

tff(c_427657,plain,
    ! [A_45723] : ~ p0(A_45723,A_45723),
    inference(splitLeft,[status(thm)],[c_427655]) ).

tff(c_427662,plain,
    $false,
    inference(resolution,[status(thm)],[c_28,c_427657]) ).

tff(c_427668,plain,
    ! [C_45724,B_45725,J_45726] :
      ( ~ m0(C_45724,B_45725,J_45726)
      | l2(J_45726,J_45726) ),
    inference(splitRight,[status(thm)],[c_427655]) ).

tff(c_427685,plain,
    l2(e,e),
    inference(resolution,[status(thm)],[c_46,c_427668]) ).

tff(c_338,plain,
    ! [E_245,D_244] :
      ( ~ l2(E_245,E_245)
      | ~ n0(e,E_245)
      | ~ s1(D_244)
      | l2(D_244,E_245) ),
    inference(cnfTransformation,[status(thm)],[f_1123]) ).

tff(c_426857,plain,
    ! [E_245,D_244] :
      ( ~ l2(E_245,E_245)
      | ~ n0(e,E_245)
      | l2(D_244,E_245) ),
    inference(demodulation,[status(thm),theory(equality)],[c_377822,c_338]) ).

tff(c_427694,plain,
    ! [D_244] :
      ( ~ n0(e,e)
      | l2(D_244,e) ),
    inference(resolution,[status(thm)],[c_427685,c_426857]) ).

tff(c_427697,plain,
    ! [D_244] : l2(D_244,e),
    inference(demodulation,[status(thm),theory(equality)],[c_60,c_427694]) ).

tff(c_38,plain,
    ! [X_4,Y_5] : m0(X_4,d,Y_5),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_418140,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(demodulation,[status(thm),theory(equality)],[c_377822,c_342]) ).

tff(c_418142,plain,
    ! [A_44894] : ~ p0(A_44894,A_44894),
    inference(splitLeft,[status(thm)],[c_418140]) ).

tff(c_418147,plain,
    $false,
    inference(resolution,[status(thm)],[c_28,c_418142]) ).

tff(c_418316,plain,
    ! [C_44907,B_44908,J_44909] :
      ( ~ m0(C_44907,B_44908,J_44909)
      | l2(J_44909,J_44909) ),
    inference(splitRight,[status(thm)],[c_418140]) ).

tff(c_418334,plain,
    ! [Y_5] : l2(Y_5,Y_5),
    inference(resolution,[status(thm)],[c_38,c_418316]) ).

tff(c_348,plain,
    ( ~ k1(b)
    | m2(b) ),
    inference(cnfTransformation,[status(thm)],[f_1164]) ).

tff(c_842,plain,
    ~ k1(b),
    inference(splitLeft,[status(thm)],[c_348]) ).

tff(c_30,plain,
    n0(a,b),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_859,plain,
    ! [J_639,I_640] :
      ( ~ n0(J_639,I_640)
      | k1(I_640) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_862,plain,
    k1(b),
    inference(resolution,[status(thm)],[c_30,c_859]) ).

tff(c_887,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_842,c_862]) ).

tff(c_889,plain,
    k1(b),
    inference(splitRight,[status(thm)],[c_348]) ).

tff(c_48,plain,
    l0(c),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_442,plain,
    ! [E_332,D_331] :
      ( ~ l2(E_332,D_331)
      | ~ l0(c)
      | ~ k1(E_332)
      | q2(D_331,c,E_332) ),
    inference(cnfTransformation,[status(thm)],[f_1546]) ).

tff(c_411806,plain,
    ! [E_44315,D_44316] :
      ( ~ l2(E_44315,D_44316)
      | ~ k1(E_44315)
      | q2(D_44316,c,E_44315) ),
    inference(demodulation,[status(thm),theory(equality)],[c_48,c_442]) ).

tff(c_454,plain,
    ! [H_345] :
      ( ~ s1(b)
      | ~ q2(b,H_345,b)
      | s2(H_345) ),
    inference(cnfTransformation,[status(thm)],[f_1597]) ).

tff(c_389210,plain,
    ! [H_345] :
      ( ~ q2(b,H_345,b)
      | s2(H_345) ),
    inference(demodulation,[status(thm),theory(equality)],[c_377822,c_454]) ).

tff(c_411810,plain,
    ( s2(c)
    | ~ l2(b,b)
    | ~ k1(b) ),
    inference(resolution,[status(thm)],[c_411806,c_389210]) ).

tff(c_411813,plain,
    ( s2(c)
    | ~ l2(b,b) ),
    inference(demodulation,[status(thm),theory(equality)],[c_889,c_411810]) ).

tff(c_411815,plain,
    ~ l2(b,b),
    inference(splitLeft,[status(thm)],[c_411813]) ).

tff(c_418354,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_418334,c_411815]) ).

tff(c_418355,plain,
    s2(c),
    inference(splitRight,[status(thm)],[c_411813]) ).

tff(c_760,plain,
    ! [E_332,D_331] :
      ( ~ l2(E_332,D_331)
      | ~ k1(E_332)
      | q2(D_331,c,E_332) ),
    inference(demodulation,[status(thm),theory(equality)],[c_48,c_442]) ).

tff(c_54,plain,
    m0(e,b,c),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_429278,plain,
    ! [A_45838,B_45839,J_45840,I_45841] :
      ( ~ m0(A_45838,B_45839,J_45840)
      | ~ s2(I_45841)
      | ~ q2(A_45838,I_45841,A_45838)
      | s3(I_45841,J_45840) ),
    inference(cnfTransformation,[status(thm)],[f_2297]) ).

tff(c_429603,plain,
    ! [I_45861] :
      ( ~ s2(I_45861)
      | ~ q2(e,I_45861,e)
      | s3(I_45861,c) ),
    inference(resolution,[status(thm)],[c_54,c_429278]) ).

tff(c_429611,plain,
    ( ~ s2(c)
    | s3(c,c)
    | ~ l2(e,e)
    | ~ k1(e) ),
    inference(resolution,[status(thm)],[c_760,c_429603]) ).

tff(c_429625,plain,
    s3(c,c),
    inference(demodulation,[status(thm),theory(equality)],[c_14284,c_427697,c_418355,c_429611]) ).

tff(c_429627,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_738,c_429625]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN207-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14  % 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.35  % Computer : n016.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 18:03:07 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 103.79/87.06  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 103.79/87.07  
% 103.79/87.07  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 103.91/87.11  
% 103.91/87.11  Inference rules
% 103.91/87.11  ----------------------
% 103.91/87.11  #Ref     : 0
% 103.91/87.11  #Sup     : 77074
% 103.91/87.11  #Fact    : 0
% 103.91/87.11  #Define  : 0
% 103.91/87.11  #Split   : 7029
% 103.91/87.11  #Chain   : 0
% 103.91/87.11  #Close   : 0
% 103.91/87.11  
% 103.91/87.11  Ordering : KBO
% 103.91/87.11  
% 103.91/87.11  Simplification rules
% 103.91/87.11  ----------------------
% 103.91/87.11  #Subsume      : 24721
% 103.91/87.11  #Demod        : 78199
% 103.91/87.11  #Tautology    : 46394
% 103.91/87.11  #SimpNegUnit  : 5493
% 103.91/87.11  #BackRed      : 5765
% 103.91/87.11  
% 103.91/87.11  #Partial instantiations: 0
% 103.91/87.11  #Strategies tried      : 1
% 103.91/87.11  
% 103.91/87.11  Timing (in seconds)
% 103.91/87.11  ----------------------
% 103.91/87.12  Preprocessing        : 0.99
% 103.91/87.12  Parsing              : 0.56
% 103.91/87.12  CNF conversion       : 0.08
% 103.91/87.12  Main loop            : 85.05
% 103.91/87.12  Inferencing          : 25.58
% 103.91/87.12  Reduction            : 35.01
% 103.91/87.12  Demodulation         : 24.66
% 103.91/87.12  BG Simplification    : 0.34
% 103.91/87.12  Subsumption          : 18.31
% 103.91/87.12  Abstraction          : 0.68
% 103.91/87.12  MUC search           : 0.00
% 103.91/87.12  Cooper               : 0.00
% 103.91/87.12  Total                : 86.11
% 103.91/87.12  Index Insertion      : 0.00
% 103.91/87.12  Index Deletion       : 0.00
% 103.91/87.12  Index Matching       : 0.00
% 103.91/87.12  BG Taut test         : 0.00
%------------------------------------------------------------------------------