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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN009-1 : TPTP v8.1.2. Released v1.0.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 : n017.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:08:30 EDT 2023

% Result   : Unsatisfiable 2.52s 1.76s
% Output   : CNFRefutation 2.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (  10 unt;   7 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   41 (  21   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (   4   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   24 (;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r > q > p > s > #nlpp > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

tff(r,type,
    r: ( $i * $i * $i ) > $o ).

tff(b,type,
    b: $i ).

tff(p,type,
    p: ( $i * $i * $i ) > $o ).

tff(s,type,
    s: $i > $o ).

tff(q,type,
    q: ( $i * $i * $i ) > $o ).

tff(c,type,
    c: $i ).

tff(f_33,axiom,
    s(c),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [X,Y,Z] :
      ( ~ s(X)
      | ~ s(Y)
      | ~ s(Z)
      | p(X,Y,Z)
      | q(X,Y,Z)
      | r(X,Y,Z) ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    ! [X,Y] : ~ r(X,Y,c),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [X,Y] : ~ q(X,c,Y),
    file(unknown,unknown) ).

tff(f_24,axiom,
    ! [X,Y] : ~ p(c,X,Y),
    file(unknown,unknown) ).

tff(c_12,plain,
    s(c),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_18,plain,
    ! [X_16,Y_17,Z_18] :
      ( r(X_16,Y_17,Z_18)
      | q(X_16,Y_17,Z_18)
      | p(X_16,Y_17,Z_18)
      | ~ s(Z_18)
      | ~ s(Y_17)
      | ~ s(X_16) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_6,plain,
    ! [X_5,Y_6] : ~ r(X_5,Y_6,c),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_22,plain,
    ! [X_16,Y_17] :
      ( q(X_16,Y_17,c)
      | p(X_16,Y_17,c)
      | ~ s(c)
      | ~ s(Y_17)
      | ~ s(X_16) ),
    inference(resolution,[status(thm)],[c_18,c_6]) ).

tff(c_26,plain,
    ! [X_19,Y_20] :
      ( q(X_19,Y_20,c)
      | p(X_19,Y_20,c)
      | ~ s(Y_20)
      | ~ s(X_19) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_22]) ).

tff(c_4,plain,
    ! [X_3,Y_4] : ~ q(X_3,c,Y_4),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_30,plain,
    ! [X_19] :
      ( p(X_19,c,c)
      | ~ s(c)
      | ~ s(X_19) ),
    inference(resolution,[status(thm)],[c_26,c_4]) ).

tff(c_34,plain,
    ! [X_21] :
      ( p(X_21,c,c)
      | ~ s(X_21) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_30]) ).

tff(c_2,plain,
    ! [X_1,Y_2] : ~ p(c,X_1,Y_2),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_38,plain,
    ~ s(c),
    inference(resolution,[status(thm)],[c_34,c_2]) ).

tff(c_42,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SYN009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10  % 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.09/0.30  % Computer : n017.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Thu Aug  3 16:54:21 EDT 2023
% 0.09/0.30  % CPUTime  : 
% 2.52/1.76  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.52/1.77  
% 2.52/1.77  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.52/1.80  
% 2.52/1.80  Inference rules
% 2.52/1.80  ----------------------
% 2.52/1.80  #Ref     : 0
% 2.52/1.80  #Sup     : 3
% 2.52/1.80  #Fact    : 0
% 2.52/1.80  #Define  : 0
% 2.52/1.80  #Split   : 0
% 2.52/1.80  #Chain   : 0
% 2.52/1.80  #Close   : 0
% 2.52/1.80  
% 2.52/1.80  Ordering : KBO
% 2.52/1.80  
% 2.52/1.80  Simplification rules
% 2.52/1.80  ----------------------
% 2.52/1.80  #Subsume      : 0
% 2.52/1.80  #Demod        : 3
% 2.52/1.80  #Tautology    : 0
% 2.52/1.80  #SimpNegUnit  : 0
% 2.52/1.80  #BackRed      : 0
% 2.52/1.80  
% 2.52/1.80  #Partial instantiations: 0
% 2.52/1.80  #Strategies tried      : 1
% 2.52/1.80  
% 2.52/1.80  Timing (in seconds)
% 2.52/1.80  ----------------------
% 2.52/1.80  Preprocessing        : 0.46
% 2.52/1.80  Parsing              : 0.26
% 2.52/1.80  CNF conversion       : 0.02
% 2.52/1.80  Main loop            : 0.22
% 2.52/1.80  Inferencing          : 0.13
% 2.52/1.81  Reduction            : 0.04
% 2.52/1.81  Demodulation         : 0.03
% 2.52/1.81  BG Simplification    : 0.01
% 2.52/1.81  Subsumption          : 0.03
% 2.52/1.81  Abstraction          : 0.01
% 2.52/1.81  MUC search           : 0.00
% 2.52/1.81  Cooper               : 0.00
% 2.52/1.81  Total                : 0.74
% 2.52/1.81  Index Insertion      : 0.00
% 2.52/1.81  Index Deletion       : 0.00
% 2.52/1.81  Index Matching       : 0.00
% 2.52/1.81  BG Taut test         : 0.00
%------------------------------------------------------------------------------