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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN178-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 : n014.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:50 EDT 2023

% Result   : Unsatisfiable 93.47s 77.39s
% Output   : CNFRefutation 93.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   66
% Syntax   : Number of formulae    :   90 (  19 unt;  53 typ;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   69 (  36   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   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   :   53 (;  53   !;   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_79,axiom,
    k0(b),
    file(unknown,unknown) ).

tff(f_50,axiom,
    n0(d,b),
    file(unknown,unknown) ).

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

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

tff(f_1044,axiom,
    ! [I,J,A] :
      ( q1(I,I,I)
      | ~ m0(J,A,I) ),
    file(unknown,unknown) ).

tff(f_44,axiom,
    s0(d),
    file(unknown,unknown) ).

tff(f_1068,axiom,
    ! [D,E] :
      ( r1(D)
      | ~ q0(D,E)
      | ~ s0(d)
      | ~ q1(d,E,d) ),
    file(unknown,unknown) ).

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

tff(f_761,axiom,
    ! [B,C] :
      ( p1(B,B,B)
      | ~ p0(C,B) ),
    file(unknown,unknown) ).

tff(f_1524,axiom,
    ! [I] :
      ( q2(I,I,I)
      | ~ p1(I,I,I) ),
    file(unknown,unknown) ).

tff(f_1581,axiom,
    ! [C,D,E,F] :
      ( q2(C,D,C)
      | ~ r1(D)
      | ~ m0(E,F,C)
      | ~ k0(D)
      | ~ q2(D,D,D) ),
    file(unknown,unknown) ).

tff(f_2129,axiom,
    ! [G,H,I] :
      ( q3(G,H)
      | ~ q2(I,G,H)
      | ~ n0(I,G) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ q3(b,d),
    file(unknown,unknown) ).

tff(c_64,plain,
    k0(b),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_14,plain,
    n0(d,b),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

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

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

tff(c_312728,plain,
    ! [J_34160,A_34161,I_34162] :
      ( ~ m0(J_34160,A_34161,I_34162)
      | q1(I_34162,I_34162,I_34162) ),
    inference(cnfTransformation,[status(thm)],[f_1044]) ).

tff(c_312747,plain,
    ! [Y_5] : q1(Y_5,Y_5,Y_5),
    inference(resolution,[status(thm)],[c_38,c_312728]) ).

tff(c_2,plain,
    s0(d),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_324,plain,
    ! [E_232,D_231] :
      ( ~ q1(d,E_232,d)
      | ~ s0(d)
      | ~ q0(D_231,E_232)
      | r1(D_231) ),
    inference(cnfTransformation,[status(thm)],[f_1068]) ).

tff(c_335941,plain,
    ! [E_36472,D_36473] :
      ( ~ q1(d,E_36472,d)
      | ~ q0(D_36473,E_36472)
      | r1(D_36473) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_324]) ).

tff(c_335947,plain,
    ! [D_36473] :
      ( ~ q0(D_36473,d)
      | r1(D_36473) ),
    inference(resolution,[status(thm)],[c_312747,c_335941]) ).

tff(c_335956,plain,
    ! [D_36473] : r1(D_36473),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_335947]) ).

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

tff(c_148902,plain,
    ! [C_18837,B_18838] :
      ( ~ p0(C_18837,B_18838)
      | p1(B_18838,B_18838,B_18838) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

tff(c_148908,plain,
    ! [X_2] : p1(X_2,X_2,X_2),
    inference(resolution,[status(thm)],[c_28,c_148902]) ).

tff(c_438,plain,
    ! [I_327] :
      ( ~ p1(I_327,I_327,I_327)
      | q2(I_327,I_327,I_327) ),
    inference(cnfTransformation,[status(thm)],[f_1524]) ).

tff(c_318969,plain,
    ! [I_327] : q2(I_327,I_327,I_327),
    inference(demodulation,[status(thm),theory(equality)],[c_148908,c_438]) ).

tff(c_450,plain,
    ! [D_341,E_342,F_343,C_340] :
      ( ~ q2(D_341,D_341,D_341)
      | ~ k0(D_341)
      | ~ m0(E_342,F_343,C_340)
      | ~ r1(D_341)
      | q2(C_340,D_341,C_340) ),
    inference(cnfTransformation,[status(thm)],[f_1581]) ).

tff(c_368978,plain,
    ! [D_38808,E_38809,F_38810,C_38811] :
      ( ~ k0(D_38808)
      | ~ m0(E_38809,F_38810,C_38811)
      | q2(C_38811,D_38808,C_38811) ),
    inference(demodulation,[status(thm),theory(equality)],[c_335956,c_318969,c_450]) ).

tff(c_369017,plain,
    ! [D_38813,Y_38814] :
      ( ~ k0(D_38813)
      | q2(Y_38814,D_38813,Y_38814) ),
    inference(resolution,[status(thm)],[c_38,c_368978]) ).

tff(c_586,plain,
    ! [I_466,G_464,H_465] :
      ( ~ n0(I_466,G_464)
      | ~ q2(I_466,G_464,H_465)
      | q3(G_464,H_465) ),
    inference(cnfTransformation,[status(thm)],[f_2129]) ).

tff(c_369051,plain,
    ! [Y_38816,D_38817] :
      ( ~ n0(Y_38816,D_38817)
      | q3(D_38817,Y_38816)
      | ~ k0(D_38817) ),
    inference(resolution,[status(thm)],[c_369017,c_586]) ).

tff(c_738,plain,
    ~ q3(b,d),
    inference(cnfTransformation,[status(thm)],[f_2764]) ).

tff(c_369077,plain,
    ( ~ n0(d,b)
    | ~ k0(b) ),
    inference(resolution,[status(thm)],[c_369051,c_738]) ).

tff(c_369099,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_64,c_14,c_369077]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN178-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/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.14/0.34  % Computer : n014.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:13:48 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 93.47/77.39  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 93.47/77.40  
% 93.47/77.40  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 93.57/77.43  
% 93.57/77.43  Inference rules
% 93.57/77.43  ----------------------
% 93.57/77.43  #Ref     : 0
% 93.57/77.43  #Sup     : 66188
% 93.57/77.43  #Fact    : 0
% 93.57/77.43  #Define  : 0
% 93.57/77.43  #Split   : 5996
% 93.57/77.43  #Chain   : 0
% 93.57/77.43  #Close   : 0
% 93.57/77.43  
% 93.57/77.43  Ordering : KBO
% 93.57/77.43  
% 93.57/77.43  Simplification rules
% 93.57/77.43  ----------------------
% 93.57/77.43  #Subsume      : 20813
% 93.57/77.43  #Demod        : 67315
% 93.57/77.43  #Tautology    : 40339
% 93.57/77.43  #SimpNegUnit  : 4810
% 93.57/77.43  #BackRed      : 5047
% 93.57/77.43  
% 93.57/77.43  #Partial instantiations: 0
% 93.57/77.43  #Strategies tried      : 1
% 93.57/77.43  
% 93.57/77.43  Timing (in seconds)
% 93.57/77.43  ----------------------
% 93.57/77.43  Preprocessing        : 1.02
% 93.57/77.43  Parsing              : 0.57
% 93.57/77.43  CNF conversion       : 0.09
% 93.57/77.43  Main loop            : 75.34
% 93.57/77.43  Inferencing          : 22.85
% 93.57/77.43  Reduction            : 31.08
% 93.57/77.43  Demodulation         : 21.65
% 93.57/77.43  BG Simplification    : 0.30
% 93.57/77.43  Subsumption          : 16.13
% 93.57/77.43  Abstraction          : 0.60
% 93.57/77.43  MUC search           : 0.00
% 93.57/77.43  Cooper               : 0.00
% 93.57/77.43  Total                : 76.41
% 93.57/77.43  Index Insertion      : 0.00
% 93.57/77.43  Index Deletion       : 0.00
% 93.57/77.43  Index Matching       : 0.00
% 93.57/77.43  BG Taut test         : 0.00
%------------------------------------------------------------------------------