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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN298-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 : n015.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:10:21 EDT 2023

% Result   : Unsatisfiable 37.99s 24.71s
% Output   : CNFRefutation 37.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   67
% Syntax   : Number of formulae    :   96 (  21 unt;  53 typ;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   71 (  37   ~;  34   |;   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   :   49 (;  49   !;   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_2765,axiom,
    ! [X] : ~ s3(b,X),
    file(unknown,unknown) ).

tff(f_79,axiom,
    k0(b),
    file(unknown,unknown) ).

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

tff(f_96,axiom,
    ! [G,H] :
      ( l1(G,G)
      | ~ n0(H,G) ),
    file(unknown,unknown) ).

tff(f_1567,axiom,
    ! [G,H] :
      ( q2(G,G,H)
      | ~ l1(H,G) ),
    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_59,axiom,
    ! [X] : p0(b,X),
    file(unknown,unknown) ).

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

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

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

tff(f_1493,axiom,
    ! [E,F] :
      ( q2(E,F,F)
      | ~ k0(F)
      | ~ p1(E,E,E) ),
    file(unknown,unknown) ).

tff(f_78,axiom,
    m0(b,b,e),
    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,
    ! [X_627] : ~ s3(b,X_627),
    inference(cnfTransformation,[status(thm)],[f_2765]) ).

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

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

tff(c_14360,plain,
    ! [H_2655,G_2656] :
      ( ~ n0(H_2655,G_2656)
      | l1(G_2656,G_2656) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_14377,plain,
    l1(b,b),
    inference(resolution,[status(thm)],[c_30,c_14360]) ).

tff(c_448,plain,
    ! [H_339,G_338] :
      ( ~ l1(H_339,G_338)
      | q2(G_338,G_338,H_339) ),
    inference(cnfTransformation,[status(thm)],[f_1567]) ).

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_93100,plain,
    ! [H_236] : ~ s1(H_236),
    inference(splitLeft,[status(thm)],[c_328]) ).

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

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

tff(c_1422,plain,
    s1(b),
    inference(resolution,[status(thm)],[c_28,c_1417]) ).

tff(c_93104,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_93100,c_1422]) ).

tff(c_93106,plain,
    ! [F_12152,G_12153] :
      ( ~ q0(F_12152,G_12153)
      | s1(F_12152) ),
    inference(splitRight,[status(thm)],[c_328]) ).

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

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

tff(c_94825,plain,
    ! [H_12408] :
      ( ~ q2(b,H_12408,b)
      | s2(H_12408) ),
    inference(demodulation,[status(thm),theory(equality)],[c_93129,c_454]) ).

tff(c_94829,plain,
    ( s2(b)
    | ~ l1(b,b) ),
    inference(resolution,[status(thm)],[c_448,c_94825]) ).

tff(c_94832,plain,
    s2(b),
    inference(demodulation,[status(thm),theory(equality)],[c_14377,c_94829]) ).

tff(c_93282,plain,
    ! [C_12166,B_12167] :
      ( ~ p0(C_12166,B_12167)
      | p1(B_12167,B_12167,B_12167) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

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

tff(c_430,plain,
    ! [E_320,F_321] :
      ( ~ p1(E_320,E_320,E_320)
      | ~ k0(F_321)
      | q2(E_320,F_321,F_321) ),
    inference(cnfTransformation,[status(thm)],[f_1493]) ).

tff(c_113280,plain,
    ! [F_321,E_320] :
      ( ~ k0(F_321)
      | q2(E_320,F_321,F_321) ),
    inference(demodulation,[status(thm),theory(equality)],[c_93289,c_430]) ).

tff(c_62,plain,
    m0(b,b,e),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_117647,plain,
    ! [A_14693,B_14694,J_14695,I_14696] :
      ( ~ m0(A_14693,B_14694,J_14695)
      | ~ s2(I_14696)
      | ~ q2(A_14693,I_14696,A_14693)
      | s3(I_14696,J_14695) ),
    inference(cnfTransformation,[status(thm)],[f_2297]) ).

tff(c_117740,plain,
    ! [I_14703] :
      ( ~ s2(I_14703)
      | ~ q2(b,I_14703,b)
      | s3(I_14703,e) ),
    inference(resolution,[status(thm)],[c_62,c_117647]) ).

tff(c_117744,plain,
    ( ~ s2(b)
    | s3(b,e)
    | ~ k0(b) ),
    inference(resolution,[status(thm)],[c_113280,c_117740]) ).

tff(c_117759,plain,
    s3(b,e),
    inference(demodulation,[status(thm),theory(equality)],[c_64,c_94832,c_117744]) ).

tff(c_117761,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_738,c_117759]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN298-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.14/0.36  % Computer : n015.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 17:35:29 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 37.99/24.71  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 37.99/24.72  
% 37.99/24.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 37.99/24.75  
% 37.99/24.75  Inference rules
% 37.99/24.75  ----------------------
% 37.99/24.75  #Ref     : 0
% 37.99/24.75  #Sup     : 20445
% 37.99/24.75  #Fact    : 0
% 37.99/24.75  #Define  : 0
% 37.99/24.75  #Split   : 2112
% 37.99/24.75  #Chain   : 0
% 37.99/24.75  #Close   : 0
% 37.99/24.75  
% 37.99/24.75  Ordering : KBO
% 37.99/24.75  
% 37.99/24.75  Simplification rules
% 37.99/24.75  ----------------------
% 37.99/24.75  #Subsume      : 5955
% 37.99/24.75  #Demod        : 22957
% 37.99/24.75  #Tautology    : 15012
% 37.99/24.75  #SimpNegUnit  : 1531
% 37.99/24.75  #BackRed      : 1657
% 37.99/24.75  
% 37.99/24.75  #Partial instantiations: 0
% 37.99/24.75  #Strategies tried      : 1
% 37.99/24.75  
% 37.99/24.75  Timing (in seconds)
% 37.99/24.75  ----------------------
% 38.18/24.76  Preprocessing        : 1.03
% 38.18/24.76  Parsing              : 0.55
% 38.18/24.76  CNF conversion       : 0.09
% 38.18/24.76  Main loop            : 22.61
% 38.18/24.76  Inferencing          : 6.90
% 38.18/24.76  Reduction            : 9.07
% 38.18/24.76  Demodulation         : 6.22
% 38.18/24.76  BG Simplification    : 0.18
% 38.18/24.76  Subsumption          : 4.69
% 38.18/24.76  Abstraction          : 0.21
% 38.18/24.76  MUC search           : 0.00
% 38.18/24.76  Cooper               : 0.00
% 38.18/24.76  Total                : 23.71
% 38.18/24.76  Index Insertion      : 0.00
% 38.18/24.76  Index Deletion       : 0.00
% 38.18/24.76  Index Matching       : 0.00
% 38.18/24.76  BG Taut test         : 0.00
%------------------------------------------------------------------------------