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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN166-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 : n027.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:48 EDT 2023

% Result   : Unsatisfiable 25.56s 12.85s
% Output   : CNFRefutation 25.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   61
% Syntax   : Number of formulae    :   78 (  15 unt;  53 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  18   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   18 (;  18   !;   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_85,axiom,
    m0(b,a,a),
    file(unknown,unknown) ).

tff(f_56,axiom,
    ! [X] : m0(a,X,a),
    file(unknown,unknown) ).

tff(f_52,axiom,
    r0(b),
    file(unknown,unknown) ).

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

tff(f_780,axiom,
    ( p1(a,a,a)
    | ~ l0(a) ),
    file(unknown,unknown) ).

tff(f_776,axiom,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    file(unknown,unknown) ).

tff(f_740,axiom,
    ! [H,I,J,A] :
      ( p1(H,I,J)
      | ~ m0(J,H,A)
      | ~ p1(J,H,A) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ p1(a,b,b),
    file(unknown,unknown) ).

tff(c_76,plain,
    m0(b,a,a),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_24,plain,
    ! [X_1] : m0(a,X_1,a),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_18,plain,
    r0(b),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

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

tff(c_252,plain,
    ( ~ l0(a)
    | p1(a,a,a) ),
    inference(cnfTransformation,[status(thm)],[f_780]) ).

tff(c_768,plain,
    p1(a,a,a),
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_252]) ).

tff(c_250,plain,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    inference(cnfTransformation,[status(thm)],[f_776]) ).

tff(c_772,plain,
    ( ~ r0(b)
    | p1(a,b,a) ),
    inference(demodulation,[status(thm),theory(equality)],[c_768,c_250]) ).

tff(c_809,plain,
    p1(a,b,a),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_772]) ).

tff(c_54962,plain,
    ! [J_7676,H_7677,A_7678,I_7679] :
      ( ~ p1(J_7676,H_7677,A_7678)
      | ~ m0(J_7676,H_7677,A_7678)
      | p1(H_7677,I_7679,J_7676) ),
    inference(cnfTransformation,[status(thm)],[f_740]) ).

tff(c_54978,plain,
    ! [I_7679] :
      ( ~ m0(a,b,a)
      | p1(b,I_7679,a) ),
    inference(resolution,[status(thm)],[c_809,c_54962]) ).

tff(c_54989,plain,
    ! [I_7680] : p1(b,I_7680,a),
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_54978]) ).

tff(c_240,plain,
    ! [J_156,H_154,A_157,I_155] :
      ( ~ p1(J_156,H_154,A_157)
      | ~ m0(J_156,H_154,A_157)
      | p1(H_154,I_155,J_156) ),
    inference(cnfTransformation,[status(thm)],[f_740]) ).

tff(c_55146,plain,
    ! [I_7693,I_7694] :
      ( ~ m0(b,I_7693,a)
      | p1(I_7693,I_7694,b) ),
    inference(resolution,[status(thm)],[c_54989,c_240]) ).

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

tff(c_55153,plain,
    ~ m0(b,a,a),
    inference(resolution,[status(thm)],[c_55146,c_738]) ).

tff(c_55159,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_76,c_55153]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN166-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 : n027.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 17:47:09 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 25.56/12.85  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.56/12.85  
% 25.56/12.85  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 25.72/12.88  
% 25.72/12.88  Inference rules
% 25.72/12.88  ----------------------
% 25.72/12.88  #Ref     : 0
% 25.72/12.88  #Sup     : 9453
% 25.72/12.88  #Fact    : 0
% 25.72/12.88  #Define  : 0
% 25.72/12.88  #Split   : 983
% 25.72/12.88  #Chain   : 0
% 25.72/12.88  #Close   : 0
% 25.72/12.88  
% 25.72/12.88  Ordering : KBO
% 25.72/12.88  
% 25.72/12.88  Simplification rules
% 25.72/12.88  ----------------------
% 25.72/12.88  #Subsume      : 2111
% 25.72/12.88  #Demod        : 10922
% 25.72/12.88  #Tautology    : 7845
% 25.72/12.88  #SimpNegUnit  : 613
% 25.72/12.88  #BackRed      : 759
% 25.72/12.88  
% 25.72/12.88  #Partial instantiations: 0
% 25.72/12.88  #Strategies tried      : 1
% 25.72/12.88  
% 25.72/12.88  Timing (in seconds)
% 25.72/12.88  ----------------------
% 25.72/12.89  Preprocessing        : 1.00
% 25.72/12.89  Parsing              : 0.57
% 25.72/12.89  CNF conversion       : 0.08
% 25.72/12.89  Main loop            : 10.81
% 25.72/12.89  Inferencing          : 3.51
% 25.72/12.89  Reduction            : 4.01
% 25.72/12.89  Demodulation         : 2.61
% 25.72/12.89  BG Simplification    : 0.14
% 25.72/12.89  Subsumption          : 2.22
% 25.72/12.89  Abstraction          : 0.11
% 25.72/12.89  MUC search           : 0.00
% 25.72/12.89  Cooper               : 0.00
% 25.72/12.89  Total                : 11.87
% 25.72/12.89  Index Insertion      : 0.00
% 25.72/12.89  Index Deletion       : 0.00
% 25.72/12.89  Index Matching       : 0.00
% 25.72/12.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------