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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN192-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 : 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:09:53 EDT 2023

% Result   : Unsatisfiable 17.50s 6.71s
% Output   : CNFRefutation 17.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   65
% Syntax   : Number of formulae    :   91 (  19 unt;  53 typ;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   61 (  32   ~;  29   |;   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   :   61 (;  61   !;   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_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_75,axiom,
    k0(e),
    file(unknown,unknown) ).

tff(f_46,axiom,
    n0(d,e),
    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_2129,axiom,
    ! [G,H,I] :
      ( q3(G,H)
      | ~ q2(I,G,H)
      | ~ n0(I,G) ),
    file(unknown,unknown) ).

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

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

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

tff(c_18667,plain,
    ! [D_3355,E_3356,C_3357] :
      ( ~ m0(D_3355,E_3356,C_3357)
      | m1(C_3357,C_3357,C_3357) ),
    inference(cnfTransformation,[status(thm)],[f_269]) ).

tff(c_18686,plain,
    ! [Y_5] : m1(Y_5,Y_5,Y_5),
    inference(resolution,[status(thm)],[c_38,c_18667]) ).

tff(c_18760,plain,
    ! [E_3363,D_3364] :
      ( ~ m1(E_3363,D_3364,E_3363)
      | p2(D_3364,E_3363,D_3364) ),
    inference(cnfTransformation,[status(thm)],[f_1485]) ).

tff(c_18773,plain,
    ! [Y_3365] : p2(Y_3365,Y_3365,Y_3365),
    inference(resolution,[status(thm)],[c_18686,c_18760]) ).

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_18782,plain,
    ! [Y_3365] : n3(Y_3365),
    inference(resolution,[status(thm)],[c_18773,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_21592,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_18782,c_672]) ).

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

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

tff(c_6,plain,
    n0(d,e),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_18417,plain,
    ! [C_3320,B_3321] :
      ( ~ p0(C_3320,B_3321)
      | p1(B_3321,B_3321,B_3321) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

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

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_20196,plain,
    ! [F_321,E_320] :
      ( ~ k0(F_321)
      | q2(E_320,F_321,F_321) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18422,c_430]) ).

tff(c_20893,plain,
    ! [I_3704,G_3705,H_3706] :
      ( ~ n0(I_3704,G_3705)
      | ~ q2(I_3704,G_3705,H_3706)
      | q3(G_3705,H_3706) ),
    inference(cnfTransformation,[status(thm)],[f_2129]) ).

tff(c_20916,plain,
    ! [E_3709,F_3710] :
      ( ~ n0(E_3709,F_3710)
      | q3(F_3710,F_3710)
      | ~ k0(F_3710) ),
    inference(resolution,[status(thm)],[c_20196,c_20893]) ).

tff(c_20922,plain,
    ( q3(e,e)
    | ~ k0(e) ),
    inference(resolution,[status(thm)],[c_6,c_20916]) ).

tff(c_20939,plain,
    q3(e,e),
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_20922]) ).

tff(c_21602,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_21593,c_20939]) ).

tff(c_21604,plain,
    ! [J_3766,G_3767] :
      ( ~ p0(J_3766,G_3767)
      | r4(G_3767) ),
    inference(splitRight,[status(thm)],[c_21592]) ).

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

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

tff(c_21618,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_21611,c_738]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN192-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/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.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:33:44 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 17.50/6.71  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.59/6.71  
% 17.59/6.71  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.59/6.75  
% 17.59/6.75  Inference rules
% 17.59/6.75  ----------------------
% 17.59/6.75  #Ref     : 0
% 17.59/6.75  #Sup     : 3582
% 17.59/6.75  #Fact    : 0
% 17.59/6.75  #Define  : 0
% 17.59/6.75  #Split   : 440
% 17.59/6.75  #Chain   : 0
% 17.59/6.75  #Close   : 0
% 17.59/6.75  
% 17.59/6.75  Ordering : KBO
% 17.59/6.75  
% 17.59/6.75  Simplification rules
% 17.59/6.75  ----------------------
% 17.59/6.75  #Subsume      : 595
% 17.59/6.75  #Demod        : 4430
% 17.59/6.75  #Tautology    : 3661
% 17.59/6.75  #SimpNegUnit  : 225
% 17.59/6.75  #BackRed      : 290
% 17.59/6.75  
% 17.59/6.75  #Partial instantiations: 0
% 17.59/6.75  #Strategies tried      : 1
% 17.59/6.75  
% 17.59/6.75  Timing (in seconds)
% 17.59/6.75  ----------------------
% 17.59/6.75  Preprocessing        : 1.03
% 17.59/6.75  Parsing              : 0.58
% 17.59/6.75  CNF conversion       : 0.09
% 17.59/6.75  Main loop            : 4.58
% 17.59/6.75  Inferencing          : 1.45
% 17.59/6.75  Reduction            : 1.65
% 17.59/6.75  Demodulation         : 1.08
% 17.59/6.75  BG Simplification    : 0.12
% 17.59/6.75  Subsumption          : 0.91
% 17.59/6.75  Abstraction          : 0.07
% 17.59/6.75  MUC search           : 0.00
% 17.59/6.75  Cooper               : 0.00
% 17.59/6.75  Total                : 5.67
% 17.59/6.75  Index Insertion      : 0.00
% 17.59/6.75  Index Deletion       : 0.00
% 17.59/6.75  Index Matching       : 0.00
% 17.59/6.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------