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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN264-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:10:15 EDT 2023

% Result   : Unsatisfiable 13.34s 4.56s
% Output   : CNFRefutation 13.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   60
% Syntax   : Number of formulae    :   74 (  13 unt;  53 typ;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   36 (  20   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 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   :   22 (;  22   !;   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_73,axiom,
    n0(d,c),
    file(unknown,unknown) ).

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

tff(f_593,axiom,
    ! [D,E] :
      ( p1(D,D,E)
      | ~ n0(d,D)
      | ~ k0(E) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    s0(b),
    file(unknown,unknown) ).

tff(f_647,axiom,
    ! [H,I,J,A] :
      ( p1(H,I,H)
      | ~ l0(J)
      | ~ p1(I,A,H)
      | ~ s0(b) ),
    file(unknown,unknown) ).

tff(f_67,axiom,
    l0(a),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ p1(e,c,e),
    file(unknown,unknown) ).

tff(c_52,plain,
    n0(d,c),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

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

tff(c_202,plain,
    ! [E_121,D_120] :
      ( ~ k0(E_121)
      | ~ n0(d,D_120)
      | p1(D_120,D_120,E_121) ),
    inference(cnfTransformation,[status(thm)],[f_593]) ).

tff(c_10,plain,
    s0(b),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_218,plain,
    ! [I_135,A_137,H_134,J_136] :
      ( ~ s0(b)
      | ~ p1(I_135,A_137,H_134)
      | ~ l0(J_136)
      | p1(H_134,I_135,H_134) ),
    inference(cnfTransformation,[status(thm)],[f_647]) ).

tff(c_824,plain,
    ! [I_135,A_137,H_134,J_136] :
      ( ~ p1(I_135,A_137,H_134)
      | ~ l0(J_136)
      | p1(H_134,I_135,H_134) ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_218]) ).

tff(c_8650,plain,
    ! [J_136] : ~ l0(J_136),
    inference(splitLeft,[status(thm)],[c_824]) ).

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

tff(c_8653,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_8650,c_40]) ).

tff(c_8655,plain,
    ! [I_1897,A_1898,H_1899] :
      ( ~ p1(I_1897,A_1898,H_1899)
      | p1(H_1899,I_1897,H_1899) ),
    inference(splitRight,[status(thm)],[c_824]) ).

tff(c_8706,plain,
    ! [E_1902,D_1903] :
      ( p1(E_1902,D_1903,E_1902)
      | ~ k0(E_1902)
      | ~ n0(d,D_1903) ),
    inference(resolution,[status(thm)],[c_202,c_8655]) ).

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

tff(c_8729,plain,
    ( ~ k0(e)
    | ~ n0(d,c) ),
    inference(resolution,[status(thm)],[c_8706,c_738]) ).

tff(c_8750,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_52,c_56,c_8729]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN264-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.35  % Computer : n005.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 17:15:56 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 13.34/4.56  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.57/4.56  
% 13.57/4.56  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.67/4.59  
% 13.67/4.59  Inference rules
% 13.67/4.59  ----------------------
% 13.67/4.59  #Ref     : 0
% 13.67/4.59  #Sup     : 1348
% 13.67/4.59  #Fact    : 0
% 13.67/4.59  #Define  : 0
% 13.67/4.59  #Split   : 173
% 13.67/4.59  #Chain   : 0
% 13.67/4.59  #Close   : 0
% 13.67/4.59  
% 13.67/4.59  Ordering : KBO
% 13.67/4.59  
% 13.67/4.59  Simplification rules
% 13.67/4.59  ----------------------
% 13.67/4.59  #Subsume      : 175
% 13.67/4.59  #Demod        : 1730
% 13.67/4.59  #Tautology    : 1425
% 13.67/4.59  #SimpNegUnit  : 80
% 13.67/4.59  #BackRed      : 127
% 13.67/4.59  
% 13.67/4.59  #Partial instantiations: 0
% 13.67/4.59  #Strategies tried      : 1
% 13.67/4.59  
% 13.67/4.59  Timing (in seconds)
% 13.67/4.59  ----------------------
% 13.67/4.60  Preprocessing        : 1.03
% 13.67/4.60  Parsing              : 0.57
% 13.67/4.60  CNF conversion       : 0.09
% 13.67/4.60  Main loop            : 2.51
% 13.67/4.60  Inferencing          : 0.80
% 13.67/4.60  Reduction            : 0.87
% 13.67/4.60  Demodulation         : 0.56
% 13.67/4.60  BG Simplification    : 0.12
% 13.67/4.60  Subsumption          : 0.47
% 13.67/4.60  Abstraction          : 0.04
% 13.67/4.60  MUC search           : 0.00
% 13.67/4.60  Cooper               : 0.00
% 13.67/4.60  Total                : 3.58
% 13.67/4.60  Index Insertion      : 0.00
% 13.67/4.60  Index Deletion       : 0.00
% 13.67/4.60  Index Matching       : 0.00
% 13.67/4.60  BG Taut test         : 0.00
%------------------------------------------------------------------------------