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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN162-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/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 : n005.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:48 EDT 2023

% Result   : Unsatisfiable 15.89s 5.84s
% Output   : CNFRefutation 15.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   65
% Syntax   : Number of formulae    :   91 (  19 unt;  53 typ;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   58 (  32   ~;  26   |;   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   :   62 (;  62   !;   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_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_66,axiom,
    ! [X,Y] : m0(X,d,Y),
    file(unknown,unknown) ).

tff(f_269,axiom,
    ! [C,D,E] :
      ( m1(C,C,C)
      | ~ m0(D,E,C) ),
    file(unknown,unknown) ).

tff(f_1485,axiom,
    ! [D,E] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    file(unknown,unknown) ).

tff(f_2007,axiom,
    ! [D,E,F] :
      ( n3(D)
      | ~ p2(E,F,D) ),
    file(unknown,unknown) ).

tff(f_2514,axiom,
    ! [G,H,I,J] :
      ( r4(G)
      | ~ n3(G)
      | ~ q3(H,I)
      | ~ p0(J,G) ),
    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_77,axiom,
    n0(e,e),
    file(unknown,unknown) ).

tff(f_2633,axiom,
    ! [B] :
      ( n5(B,B)
      | ~ r4(B) ),
    file(unknown,unknown) ).

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

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

tff(c_13018,plain,
    ! [C_2337,B_2338] :
      ( ~ p0(C_2337,B_2338)
      | p1(B_2338,B_2338,B_2338) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

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

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_13293,plain,
    ! [I_327] : q2(I_327,I_327,I_327),
    inference(demodulation,[status(thm),theory(equality)],[c_13025,c_438]) ).

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

tff(c_13339,plain,
    ! [D_2379,E_2380,C_2381] :
      ( ~ m0(D_2379,E_2380,C_2381)
      | m1(C_2381,C_2381,C_2381) ),
    inference(cnfTransformation,[status(thm)],[f_269]) ).

tff(c_13382,plain,
    ! [Y_2384] : m1(Y_2384,Y_2384,Y_2384),
    inference(resolution,[status(thm)],[c_38,c_13339]) ).

tff(c_428,plain,
    ! [E_319,D_318] :
      ( ~ m1(E_319,D_318,E_319)
      | p2(D_318,E_319,D_318) ),
    inference(cnfTransformation,[status(thm)],[f_1485]) ).

tff(c_13395,plain,
    ! [Y_2385] : p2(Y_2385,Y_2385,Y_2385),
    inference(resolution,[status(thm)],[c_13382,c_428]) ).

tff(c_556,plain,
    ! [E_432,F_433,D_431] :
      ( ~ p2(E_432,F_433,D_431)
      | n3(D_431) ),
    inference(cnfTransformation,[status(thm)],[f_2007]) ).

tff(c_13402,plain,
    ! [Y_2385] : n3(Y_2385),
    inference(resolution,[status(thm)],[c_13395,c_556]) ).

tff(c_672,plain,
    ! [J_567,G_564,H_565,I_566] :
      ( ~ p0(J_567,G_564)
      | ~ q3(H_565,I_566)
      | ~ n3(G_564)
      | r4(G_564) ),
    inference(cnfTransformation,[status(thm)],[f_2514]) ).

tff(c_15264,plain,
    ! [J_567,G_564,H_565,I_566] :
      ( ~ p0(J_567,G_564)
      | ~ q3(H_565,I_566)
      | r4(G_564) ),
    inference(demodulation,[status(thm),theory(equality)],[c_13402,c_672]) ).

tff(c_15265,plain,
    ! [H_565,I_566] : ~ q3(H_565,I_566),
    inference(splitLeft,[status(thm)],[c_15264]) ).

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_15481,plain,
    ! [I_2679,G_2680,H_2681] :
      ( ~ n0(I_2679,G_2680)
      | ~ q2(I_2679,G_2680,H_2681) ),
    inference(negUnitSimplification,[status(thm)],[c_15265,c_586]) ).

tff(c_15496,plain,
    ! [I_327] : ~ n0(I_327,I_327),
    inference(resolution,[status(thm)],[c_13293,c_15481]) ).

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

tff(c_15506,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_15496,c_60]) ).

tff(c_15649,plain,
    ! [J_2698,G_2699] :
      ( ~ p0(J_2698,G_2699)
      | r4(G_2699) ),
    inference(splitRight,[status(thm)],[c_15264]) ).

tff(c_15657,plain,
    ! [X_2] : r4(X_2),
    inference(resolution,[status(thm)],[c_28,c_15649]) ).

tff(c_1166,plain,
    ! [B_714] :
      ( ~ r4(B_714)
      | n5(B_714,B_714) ),
    inference(cnfTransformation,[status(thm)],[f_2633]) ).

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

tff(c_1170,plain,
    ~ r4(c),
    inference(resolution,[status(thm)],[c_1166,c_738]) ).

tff(c_15671,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_15657,c_1170]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN162-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/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.15/0.36  % Computer : n005.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 17:14:27 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 15.89/5.84  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.89/5.85  
% 15.89/5.85  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.89/5.88  
% 15.89/5.88  Inference rules
% 15.89/5.88  ----------------------
% 15.89/5.88  #Ref     : 0
% 15.89/5.88  #Sup     : 2576
% 15.89/5.88  #Fact    : 0
% 15.89/5.88  #Define  : 0
% 15.89/5.88  #Split   : 291
% 15.89/5.88  #Chain   : 0
% 15.89/5.88  #Close   : 0
% 15.89/5.88  
% 15.89/5.88  Ordering : KBO
% 15.89/5.88  
% 15.89/5.88  Simplification rules
% 15.89/5.88  ----------------------
% 15.89/5.88  #Subsume      : 465
% 15.89/5.88  #Demod        : 3068
% 15.89/5.88  #Tautology    : 2471
% 15.89/5.88  #SimpNegUnit  : 170
% 15.89/5.88  #BackRed      : 231
% 15.89/5.88  
% 15.89/5.88  #Partial instantiations: 0
% 15.89/5.88  #Strategies tried      : 1
% 15.89/5.88  
% 15.89/5.88  Timing (in seconds)
% 15.89/5.88  ----------------------
% 15.89/5.88  Preprocessing        : 1.02
% 15.89/5.88  Parsing              : 0.59
% 15.89/5.88  CNF conversion       : 0.08
% 15.89/5.88  Main loop            : 3.80
% 15.89/5.88  Inferencing          : 1.24
% 15.89/5.88  Reduction            : 1.34
% 15.89/5.88  Demodulation         : 0.86
% 15.89/5.88  BG Simplification    : 0.12
% 15.89/5.88  Subsumption          : 0.71
% 15.89/5.89  Abstraction          : 0.06
% 15.89/5.89  MUC search           : 0.00
% 15.89/5.89  Cooper               : 0.00
% 15.89/5.89  Total                : 4.87
% 15.89/5.89  Index Insertion      : 0.00
% 15.89/5.89  Index Deletion       : 0.00
% 15.89/5.89  Index Matching       : 0.00
% 15.89/5.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------