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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN181-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 : n029.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:51 EDT 2023

% Result   : Unsatisfiable 148.34s 131.14s
% Output   : CNFRefutation 148.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   68
% Syntax   : Number of formulae    :  100 (  22 unt;  53 typ;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   89 (  46   ~;  43   |;   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   :   78 (;  78   !;   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_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_1169,axiom,
    ! [A,B,C] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file(unknown,unknown) ).

tff(f_1771,axiom,
    ! [D] :
      ( k3(D,D,D)
      | ~ n2(D) ),
    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_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_1985,axiom,
    ! [A] :
      ( m3(A,A,A)
      | ~ n2(A) ),
    file(unknown,unknown) ).

tff(f_2485,axiom,
    ! [F,B,C,E,D] :
      ( q4(B,C)
      | ~ k3(D,D,B)
      | ~ q2(E,C,B)
      | ~ m3(E,F,E) ),
    file(unknown,unknown) ).

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

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

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

tff(c_237124,plain,
    ! [C_27595,B_27596] :
      ( ~ p0(C_27595,B_27596)
      | p1(B_27596,B_27596,B_27596) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

tff(c_377749,plain,
    ! [X_41045] : p1(X_41045,X_41045,X_41045),
    inference(resolution,[status(thm)],[c_28,c_237124]) ).

tff(c_350,plain,
    ! [B_257,C_258,A_256] :
      ( ~ p1(B_257,C_258,A_256)
      | n2(A_256) ),
    inference(cnfTransformation,[status(thm)],[f_1169]) ).

tff(c_377753,plain,
    ! [X_41045] : n2(X_41045),
    inference(resolution,[status(thm)],[c_377749,c_350]) ).

tff(c_496,plain,
    ! [D_385] :
      ( ~ n2(D_385)
      | k3(D_385,D_385,D_385) ),
    inference(cnfTransformation,[status(thm)],[f_1771]) ).

tff(c_377756,plain,
    ! [D_385] : k3(D_385,D_385,D_385),
    inference(demodulation,[status(thm),theory(equality)],[c_377753,c_496]) ).

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_495594,plain,
    ! [J_52294,A_52295,I_52296] :
      ( ~ m0(J_52294,A_52295,I_52296)
      | q1(I_52296,I_52296,I_52296) ),
    inference(cnfTransformation,[status(thm)],[f_1044]) ).

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

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_600391,plain,
    ! [E_61134,D_61135] :
      ( ~ q1(d,E_61134,d)
      | ~ q0(D_61135,E_61134)
      | r1(D_61135) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_324]) ).

tff(c_600394,plain,
    ! [D_61135] :
      ( ~ q0(D_61135,d)
      | r1(D_61135) ),
    inference(resolution,[status(thm)],[c_495613,c_600391]) ).

tff(c_600400,plain,
    ! [D_61135] : r1(D_61135),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_600394]) ).

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

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_590034,plain,
    ! [I_327] : q2(I_327,I_327,I_327),
    inference(demodulation,[status(thm),theory(equality)],[c_237130,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_654819,plain,
    ! [D_64997,E_64998,F_64999,C_65000] :
      ( ~ k0(D_64997)
      | ~ m0(E_64998,F_64999,C_65000)
      | q2(C_65000,D_64997,C_65000) ),
    inference(demodulation,[status(thm),theory(equality)],[c_600400,c_590034,c_450]) ).

tff(c_654837,plain,
    ! [D_64997,Y_5] :
      ( ~ k0(D_64997)
      | q2(Y_5,D_64997,Y_5) ),
    inference(resolution,[status(thm)],[c_38,c_654819]) ).

tff(c_548,plain,
    ! [A_428] :
      ( ~ n2(A_428)
      | m3(A_428,A_428,A_428) ),
    inference(cnfTransformation,[status(thm)],[f_1985]) ).

tff(c_377764,plain,
    ! [A_428] : m3(A_428,A_428,A_428),
    inference(demodulation,[status(thm),theory(equality)],[c_377753,c_548]) ).

tff(c_650935,plain,
    ! [E_64739,B_64736,C_64738,D_64735,F_64737] :
      ( ~ m3(E_64739,F_64737,E_64739)
      | ~ q2(E_64739,C_64738,B_64736)
      | ~ k3(D_64735,D_64735,B_64736)
      | q4(B_64736,C_64738) ),
    inference(cnfTransformation,[status(thm)],[f_2485]) ).

tff(c_658618,plain,
    ! [A_65213,C_65214,B_65215,D_65216] :
      ( ~ q2(A_65213,C_65214,B_65215)
      | ~ k3(D_65216,D_65216,B_65215)
      | q4(B_65215,C_65214) ),
    inference(resolution,[status(thm)],[c_377764,c_650935]) ).

tff(c_658644,plain,
    ! [D_65217,Y_65218,D_65219] :
      ( ~ k3(D_65217,D_65217,Y_65218)
      | q4(Y_65218,D_65219)
      | ~ k0(D_65219) ),
    inference(resolution,[status(thm)],[c_654837,c_658618]) ).

tff(c_658767,plain,
    ! [D_65223,D_65224] :
      ( q4(D_65223,D_65224)
      | ~ k0(D_65224) ),
    inference(resolution,[status(thm)],[c_377756,c_658644]) ).

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

tff(c_658770,plain,
    ~ k0(b),
    inference(resolution,[status(thm)],[c_658767,c_738]) ).

tff(c_658774,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_64,c_658770]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN181-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.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Aug  3 17:41:07 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 148.34/131.14  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 148.34/131.15  
% 148.34/131.15  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 148.49/131.18  
% 148.49/131.18  Inference rules
% 148.49/131.18  ----------------------
% 148.49/131.18  #Ref     : 0
% 148.49/131.18  #Sup     : 119439
% 148.49/131.18  #Fact    : 0
% 148.49/131.18  #Define  : 0
% 148.49/131.18  #Split   : 10149
% 148.49/131.18  #Chain   : 0
% 148.49/131.18  #Close   : 0
% 148.49/131.18  
% 148.49/131.18  Ordering : KBO
% 148.49/131.18  
% 148.49/131.18  Simplification rules
% 148.49/131.18  ----------------------
% 148.49/131.18  #Subsume      : 40766
% 148.49/131.18  #Demod        : 117378
% 148.49/131.18  #Tautology    : 66833
% 148.49/131.18  #SimpNegUnit  : 8229
% 148.49/131.18  #BackRed      : 8558
% 148.49/131.18  
% 148.49/131.18  #Partial instantiations: 0
% 148.49/131.18  #Strategies tried      : 1
% 148.49/131.18  
% 148.49/131.18  Timing (in seconds)
% 148.49/131.18  ----------------------
% 148.49/131.18  Preprocessing        : 1.14
% 148.49/131.18  Parsing              : 0.57
% 148.49/131.18  CNF conversion       : 0.12
% 148.49/131.18  Main loop            : 128.90
% 148.49/131.18  Inferencing          : 36.73
% 148.49/131.18  Reduction            : 54.87
% 148.49/131.18  Demodulation         : 38.49
% 148.49/131.18  BG Simplification    : 0.46
% 148.49/131.18  Subsumption          : 28.77
% 148.49/131.18  Abstraction          : 1.02
% 148.49/131.19  MUC search           : 0.00
% 148.49/131.19  Cooper               : 0.00
% 148.49/131.19  Total                : 130.11
% 148.59/131.19  Index Insertion      : 0.00
% 148.59/131.19  Index Deletion       : 0.00
% 148.59/131.19  Index Matching       : 0.00
% 148.59/131.19  BG Taut test         : 0.00
%------------------------------------------------------------------------------