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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN144-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 : n031.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:44 EDT 2023

% Result   : Unsatisfiable 13.42s 4.69s
% Output   : CNFRefutation 13.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   65
% Syntax   : Number of formulae    :   91 (  15 unt;  53 typ;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   74 (  39   ~;  35   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :   46 (;  46   !;   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_67,axiom,
    l0(a),
    file(unknown,unknown) ).

tff(f_57,axiom,
    r0(e),
    file(unknown,unknown) ).

tff(f_75,axiom,
    k0(e),
    file(unknown,unknown) ).

tff(f_242,axiom,
    ! [I,J] :
      ( m1(I,J,I)
      | ~ l0(I)
      | ~ k0(J) ),
    file(unknown,unknown) ).

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

tff(f_1323,axiom,
    ! [H,I,J] :
      ( p2(H,I,I)
      | ~ k1(J)
      | ~ p2(e,H,I) ),
    file(unknown,unknown) ).

tff(f_81,axiom,
    n0(c,d),
    file(unknown,unknown) ).

tff(f_91,axiom,
    ! [I,J] :
      ( k1(I)
      | ~ n0(J,I) ),
    file(unknown,unknown) ).

tff(f_2231,axiom,
    ! [B,C,D] :
      ( r3(B,C,B)
      | ~ p2(B,D,C) ),
    file(unknown,unknown) ).

tff(f_2399,axiom,
    ! [G,H] :
      ( p4(G,G,H)
      | ~ r0(G)
      | ~ r3(H,G,H) ),
    file(unknown,unknown) ).

tff(f_2553,axiom,
    ! [D,E,F] :
      ( m5(D,E)
      | ~ r0(D)
      | ~ p4(D,F,E) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ m5(e,a),
    file(unknown,unknown) ).

tff(c_40,plain,
    l0(a),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_26,plain,
    r0(e),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_56,plain,
    k0(e),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_9473,plain,
    ! [J_1965,I_1966] :
      ( ~ k0(J_1965)
      | ~ l0(I_1966)
      | m1(I_1966,J_1965,I_1966) ),
    inference(cnfTransformation,[status(thm)],[f_242]) ).

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_9476,plain,
    ! [J_1965,I_1966] :
      ( p2(J_1965,I_1966,J_1965)
      | ~ k0(J_1965)
      | ~ l0(I_1966) ),
    inference(resolution,[status(thm)],[c_9473,c_428]) ).

tff(c_386,plain,
    ! [H_283,I_284,J_285] :
      ( ~ p2(e,H_283,I_284)
      | ~ k1(J_285)
      | p2(H_283,I_284,I_284) ),
    inference(cnfTransformation,[status(thm)],[f_1323]) ).

tff(c_9961,plain,
    ! [J_285] : ~ k1(J_285),
    inference(splitLeft,[status(thm)],[c_386]) ).

tff(c_68,plain,
    n0(c,d),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_1424,plain,
    ! [J_757,I_758] :
      ( ~ n0(J_757,I_758)
      | k1(I_758) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_1458,plain,
    k1(d),
    inference(resolution,[status(thm)],[c_68,c_1424]) ).

tff(c_9968,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_9961,c_1458]) ).

tff(c_9970,plain,
    ! [H_2064,I_2065] :
      ( ~ p2(e,H_2064,I_2065)
      | p2(H_2064,I_2065,I_2065) ),
    inference(splitRight,[status(thm)],[c_386]) ).

tff(c_9979,plain,
    ! [I_1966] :
      ( p2(I_1966,e,e)
      | ~ k0(e)
      | ~ l0(I_1966) ),
    inference(resolution,[status(thm)],[c_9476,c_9970]) ).

tff(c_9998,plain,
    ! [I_2066] :
      ( p2(I_2066,e,e)
      | ~ l0(I_2066) ),
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_9979]) ).

tff(c_610,plain,
    ! [B_491,D_493,C_492] :
      ( ~ p2(B_491,D_493,C_492)
      | r3(B_491,C_492,B_491) ),
    inference(cnfTransformation,[status(thm)],[f_2231]) ).

tff(c_10017,plain,
    ! [I_2066] :
      ( r3(I_2066,e,I_2066)
      | ~ l0(I_2066) ),
    inference(resolution,[status(thm)],[c_9998,c_610]) ).

tff(c_10149,plain,
    ! [H_2083,G_2084] :
      ( ~ r3(H_2083,G_2084,H_2083)
      | ~ r0(G_2084)
      | p4(G_2084,G_2084,H_2083) ),
    inference(cnfTransformation,[status(thm)],[f_2399]) ).

tff(c_10155,plain,
    ! [I_2066] :
      ( ~ r0(e)
      | p4(e,e,I_2066)
      | ~ l0(I_2066) ),
    inference(resolution,[status(thm)],[c_10017,c_10149]) ).

tff(c_10178,plain,
    ! [I_2085] :
      ( p4(e,e,I_2085)
      | ~ l0(I_2085) ),
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_10155]) ).

tff(c_682,plain,
    ! [D_577,F_579,E_578] :
      ( ~ p4(D_577,F_579,E_578)
      | ~ r0(D_577)
      | m5(D_577,E_578) ),
    inference(cnfTransformation,[status(thm)],[f_2553]) ).

tff(c_10181,plain,
    ! [I_2085] :
      ( ~ r0(e)
      | m5(e,I_2085)
      | ~ l0(I_2085) ),
    inference(resolution,[status(thm)],[c_10178,c_682]) ).

tff(c_10185,plain,
    ! [I_2086] :
      ( m5(e,I_2086)
      | ~ l0(I_2086) ),
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_10181]) ).

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

tff(c_10188,plain,
    ~ l0(a),
    inference(resolution,[status(thm)],[c_10185,c_738]) ).

tff(c_10192,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_10188]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem  : SYN144-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.15  % 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 : n031.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:35:30 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 13.42/4.69  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.42/4.70  
% 13.42/4.70  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.42/4.73  
% 13.42/4.73  Inference rules
% 13.42/4.73  ----------------------
% 13.42/4.73  #Ref     : 0
% 13.42/4.73  #Sup     : 1582
% 13.42/4.73  #Fact    : 0
% 13.42/4.73  #Define  : 0
% 13.42/4.73  #Split   : 195
% 13.42/4.73  #Chain   : 0
% 13.42/4.73  #Close   : 0
% 13.42/4.73  
% 13.42/4.73  Ordering : KBO
% 13.42/4.73  
% 13.42/4.73  Simplification rules
% 13.42/4.73  ----------------------
% 13.42/4.73  #Subsume      : 181
% 13.42/4.73  #Demod        : 2093
% 13.42/4.73  #Tautology    : 1757
% 13.42/4.73  #SimpNegUnit  : 84
% 13.42/4.73  #BackRed      : 131
% 13.42/4.73  
% 13.42/4.73  #Partial instantiations: 0
% 13.42/4.73  #Strategies tried      : 1
% 13.42/4.73  
% 13.42/4.73  Timing (in seconds)
% 13.42/4.73  ----------------------
% 13.42/4.74  Preprocessing        : 0.99
% 13.42/4.74  Parsing              : 0.56
% 13.42/4.74  CNF conversion       : 0.08
% 13.42/4.74  Main loop            : 2.67
% 13.42/4.74  Inferencing          : 0.88
% 13.42/4.74  Reduction            : 0.93
% 13.42/4.74  Demodulation         : 0.60
% 13.42/4.74  BG Simplification    : 0.11
% 13.42/4.74  Subsumption          : 0.49
% 13.42/4.74  Abstraction          : 0.05
% 13.42/4.74  MUC search           : 0.00
% 13.42/4.74  Cooper               : 0.00
% 13.42/4.74  Total                : 3.71
% 13.42/4.74  Index Insertion      : 0.00
% 13.42/4.74  Index Deletion       : 0.00
% 13.42/4.74  Index Matching       : 0.00
% 13.42/4.74  BG Taut test         : 0.00
%------------------------------------------------------------------------------