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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN301-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 : n021.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 13.20s 4.53s
% Output   : CNFRefutation 13.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   61
% Syntax   : Number of formulae    :   76 (  12 unt;  53 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  16   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   33 (;  33   !;   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_1169,axiom,
    ! [A,B,C] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file(unknown,unknown) ).

tff(f_2042,axiom,
    ! [H] :
      ( p3(H,H,H)
      | ~ n2(H) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ s4(a),
    file(unknown,unknown) ).

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

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

tff(f_2522,axiom,
    ! [A,B,C,D] :
      ( s4(A)
      | ~ p3(B,C,D)
      | ~ l1(A,C) ),
    file(unknown,unknown) ).

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

tff(c_5748,plain,
    ! [C_1393,B_1394] :
      ( ~ p0(C_1393,B_1394)
      | p1(B_1394,B_1394,B_1394) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

tff(c_5765,plain,
    ! [X_1395] : p1(X_1395,X_1395,X_1395),
    inference(resolution,[status(thm)],[c_28,c_5748]) ).

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_5769,plain,
    ! [X_1395] : n2(X_1395),
    inference(resolution,[status(thm)],[c_5765,c_350]) ).

tff(c_564,plain,
    ! [H_442] :
      ( ~ n2(H_442)
      | p3(H_442,H_442,H_442) ),
    inference(cnfTransformation,[status(thm)],[f_2042]) ).

tff(c_5781,plain,
    ! [H_442] : p3(H_442,H_442,H_442),
    inference(demodulation,[status(thm),theory(equality)],[c_5769,c_564]) ).

tff(c_738,plain,
    ~ s4(a),
    inference(cnfTransformation,[status(thm)],[f_2764]) ).

tff(c_74,plain,
    n0(b,a),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_1225,plain,
    ! [H_732,G_733] :
      ( ~ n0(H_732,G_733)
      | l1(G_733,G_733) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_1243,plain,
    l1(a,a),
    inference(resolution,[status(thm)],[c_74,c_1225]) ).

tff(c_7920,plain,
    ! [A_1692,C_1693,B_1694,D_1695] :
      ( ~ l1(A_1692,C_1693)
      | ~ p3(B_1694,C_1693,D_1695)
      | s4(A_1692) ),
    inference(cnfTransformation,[status(thm)],[f_2522]) ).

tff(c_7926,plain,
    ! [B_1694,D_1695] :
      ( ~ p3(B_1694,a,D_1695)
      | s4(a) ),
    inference(resolution,[status(thm)],[c_1243,c_7920]) ).

tff(c_7939,plain,
    ! [B_1696,D_1697] : ~ p3(B_1696,a,D_1697),
    inference(negUnitSimplification,[status(thm)],[c_738,c_7926]) ).

tff(c_7944,plain,
    $false,
    inference(resolution,[status(thm)],[c_5781,c_7939]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN301-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/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.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 17:21:52 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 13.20/4.53  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.20/4.53  
% 13.20/4.53  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.41/4.56  
% 13.41/4.56  Inference rules
% 13.41/4.56  ----------------------
% 13.41/4.56  #Ref     : 0
% 13.41/4.56  #Sup     : 1223
% 13.41/4.56  #Fact    : 0
% 13.41/4.56  #Define  : 0
% 13.41/4.56  #Split   : 142
% 13.41/4.56  #Chain   : 0
% 13.41/4.56  #Close   : 0
% 13.41/4.56  
% 13.41/4.56  Ordering : KBO
% 13.41/4.56  
% 13.41/4.56  Simplification rules
% 13.41/4.56  ----------------------
% 13.41/4.56  #Subsume      : 124
% 13.41/4.56  #Demod        : 1629
% 13.41/4.56  #Tautology    : 1402
% 13.41/4.56  #SimpNegUnit  : 58
% 13.41/4.56  #BackRed      : 90
% 13.41/4.56  
% 13.41/4.56  #Partial instantiations: 0
% 13.41/4.56  #Strategies tried      : 1
% 13.41/4.56  
% 13.41/4.56  Timing (in seconds)
% 13.41/4.56  ----------------------
% 13.41/4.56  Preprocessing        : 1.12
% 13.41/4.56  Parsing              : 0.62
% 13.41/4.56  CNF conversion       : 0.10
% 13.41/4.56  Main loop            : 2.35
% 13.41/4.56  Inferencing          : 0.72
% 13.41/4.56  Reduction            : 0.83
% 13.41/4.57  Demodulation         : 0.55
% 13.41/4.57  BG Simplification    : 0.13
% 13.41/4.57  Subsumption          : 0.44
% 13.41/4.57  Abstraction          : 0.04
% 13.41/4.57  MUC search           : 0.00
% 13.41/4.57  Cooper               : 0.00
% 13.41/4.57  Total                : 3.52
% 13.41/4.57  Index Insertion      : 0.00
% 13.41/4.57  Index Deletion       : 0.00
% 13.41/4.57  Index Matching       : 0.00
% 13.41/4.57  BG Taut test         : 0.00
%------------------------------------------------------------------------------