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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN323-1 : TPTP v8.1.2. Released v1.2.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 : n019.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:25 EDT 2023

% Result   : Unsatisfiable 2.20s 1.63s
% Output   : CNFRefutation 2.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   14 (   3 unt;   3 typ;   0 def)
%            Number of atoms       :   19 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (   9   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   10 (;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ g > f > #nlpp > a

%Foreground sorts:

%Background operators:

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

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

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

tff(f_30,axiom,
    ! [X] :
      ( f(X,a)
      | g(X,a) ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [X] :
      ( f(X,a)
      | ~ g(X,a) ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [X] :
      ( ~ f(a,X)
      | g(X,a) ),
    file(unknown,unknown) ).

tff(f_46,axiom,
    ! [X] :
      ( ~ f(a,X)
      | ~ g(X,a) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1] :
      ( g(X_1,a)
      | f(X_1,a) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_21,plain,
    ! [X_9] :
      ( ~ g(X_9,a)
      | f(X_9,a) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_28,plain,
    ! [X_10] : f(X_10,a),
    inference(resolution,[status(thm)],[c_2,c_21]) ).

tff(c_15,plain,
    ! [X_7] :
      ( g(X_7,a)
      | ~ f(a,X_7) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_8,plain,
    ! [X_4] :
      ( ~ g(X_4,a)
      | ~ f(a,X_4) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_19,plain,
    ! [X_7] : ~ f(a,X_7),
    inference(resolution,[status(thm)],[c_15,c_8]) ).

tff(c_33,plain,
    $false,
    inference(resolution,[status(thm)],[c_28,c_19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN323-1 : TPTP v8.1.2. Released v1.2.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.14/0.36  % Computer : n019.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 17:20:46 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.20/1.63  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.20/1.63  
% 2.20/1.63  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.20/1.66  
% 2.20/1.66  Inference rules
% 2.20/1.66  ----------------------
% 2.20/1.66  #Ref     : 0
% 2.20/1.66  #Sup     : 4
% 2.20/1.66  #Fact    : 0
% 2.20/1.66  #Define  : 0
% 2.20/1.66  #Split   : 0
% 2.20/1.66  #Chain   : 0
% 2.20/1.66  #Close   : 0
% 2.20/1.66  
% 2.20/1.66  Ordering : KBO
% 2.20/1.66  
% 2.20/1.66  Simplification rules
% 2.20/1.66  ----------------------
% 2.20/1.66  #Subsume      : 2
% 2.20/1.66  #Demod        : 2
% 2.20/1.66  #Tautology    : 2
% 2.20/1.66  #SimpNegUnit  : 0
% 2.20/1.66  #BackRed      : 0
% 2.20/1.66  
% 2.20/1.66  #Partial instantiations: 0
% 2.20/1.66  #Strategies tried      : 1
% 2.20/1.66  
% 2.20/1.66  Timing (in seconds)
% 2.20/1.66  ----------------------
% 2.20/1.66  Preprocessing        : 0.41
% 2.20/1.66  Parsing              : 0.23
% 2.20/1.66  CNF conversion       : 0.02
% 2.20/1.66  Main loop            : 0.16
% 2.20/1.66  Inferencing          : 0.09
% 2.20/1.66  Reduction            : 0.02
% 2.20/1.66  Demodulation         : 0.01
% 2.20/1.66  BG Simplification    : 0.01
% 2.20/1.66  Subsumption          : 0.03
% 2.20/1.66  Abstraction          : 0.00
% 2.20/1.66  MUC search           : 0.00
% 2.20/1.66  Cooper               : 0.00
% 2.20/1.66  Total                : 0.61
% 2.20/1.66  Index Insertion      : 0.00
% 2.20/1.66  Index Deletion       : 0.00
% 2.20/1.66  Index Matching       : 0.00
% 2.20/1.66  BG Taut test         : 0.00
%------------------------------------------------------------------------------