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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN354-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/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 : n012.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:36 EDT 2023

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

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

%Foreground sorts:

%Background operators:

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

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

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

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

tff(z,type,
    z: ( $i * $i ) > $i ).

tff(f_27,axiom,
    f(a,b),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [Y1,Y2] :
      ( g(b,z(Y1,Y2))
      | g(Y2,z(Y1,Y2))
      | ~ f(Y1,Y2)
      | f(b,Y2) ),
    file(unknown,unknown) ).

tff(f_67,axiom,
    ! [Y1,Y2] :
      ( ~ f(a,Y1)
      | ~ f(b,Y1)
      | ~ f(Y1,Y2) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [Y1,Y2] :
      ( ~ g(b,z(Y1,Y2))
      | ~ g(Y2,z(Y1,Y2))
      | ~ f(Y1,Y2)
      | f(b,Y2) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    f(a,b),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_6,plain,
    ! [Y2_2,Y1_1] :
      ( f(b,Y2_2)
      | ~ f(Y1_1,Y2_2)
      | g(Y2_2,z(Y1_1,Y2_2))
      | g(b,z(Y1_1,Y2_2)) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_34,plain,
    ! [Y1_1] :
      ( f(b,b)
      | ~ f(Y1_1,b)
      | g(b,z(Y1_1,b)) ),
    inference(factorization,[status(thm),theory(equality)],[c_6]) ).

tff(c_49,plain,
    f(b,b),
    inference(splitLeft,[status(thm)],[c_34]) ).

tff(c_14,plain,
    ! [Y1_9,Y2_10] :
      ( ~ f(Y1_9,Y2_10)
      | ~ f(b,Y1_9)
      | ~ f(a,Y1_9) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_56,plain,
    ( ~ f(b,b)
    | ~ f(a,b) ),
    inference(resolution,[status(thm)],[c_49,c_14]) ).

tff(c_60,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_49,c_56]) ).

tff(c_61,plain,
    ! [Y1_1] :
      ( ~ f(Y1_1,b)
      | g(b,z(Y1_1,b)) ),
    inference(splitRight,[status(thm)],[c_34]) ).

tff(c_62,plain,
    ~ f(b,b),
    inference(splitRight,[status(thm)],[c_34]) ).

tff(c_88,plain,
    ! [Y2_24,Y1_25] :
      ( f(b,Y2_24)
      | ~ f(Y1_25,Y2_24)
      | ~ g(Y2_24,z(Y1_25,Y2_24))
      | ~ g(b,z(Y1_25,Y2_24)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_96,plain,
    ! [Y1_1] :
      ( f(b,b)
      | ~ g(b,z(Y1_1,b))
      | ~ f(Y1_1,b) ),
    inference(resolution,[status(thm)],[c_61,c_88]) ).

tff(c_108,plain,
    ! [Y1_26] :
      ( ~ g(b,z(Y1_26,b))
      | ~ f(Y1_26,b) ),
    inference(negUnitSimplification,[status(thm)],[c_62,c_96]) ).

tff(c_127,plain,
    ! [Y1_1] : ~ f(Y1_1,b),
    inference(resolution,[status(thm)],[c_61,c_108]) ).

tff(c_129,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_127,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN354-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.13  % 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.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 17:03:22 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.84/1.64  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/1.65  
% 2.84/1.65  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.67  
% 2.84/1.67  Inference rules
% 2.84/1.67  ----------------------
% 2.84/1.67  #Ref     : 0
% 2.84/1.67  #Sup     : 19
% 2.84/1.67  #Fact    : 2
% 2.84/1.67  #Define  : 0
% 2.84/1.67  #Split   : 2
% 2.84/1.67  #Chain   : 0
% 2.84/1.67  #Close   : 0
% 2.84/1.67  
% 2.84/1.67  Ordering : KBO
% 2.84/1.67  
% 2.84/1.67  Simplification rules
% 2.84/1.67  ----------------------
% 2.84/1.67  #Subsume      : 13
% 2.84/1.67  #Demod        : 2
% 2.84/1.67  #Tautology    : 2
% 2.84/1.67  #SimpNegUnit  : 6
% 2.84/1.67  #BackRed      : 1
% 2.84/1.67  
% 2.84/1.67  #Partial instantiations: 0
% 2.84/1.67  #Strategies tried      : 1
% 2.84/1.67  
% 2.84/1.67  Timing (in seconds)
% 2.84/1.67  ----------------------
% 2.84/1.67  Preprocessing        : 0.39
% 2.84/1.67  Parsing              : 0.22
% 2.84/1.67  CNF conversion       : 0.02
% 2.84/1.67  Main loop            : 0.24
% 2.84/1.67  Inferencing          : 0.10
% 2.84/1.67  Reduction            : 0.05
% 2.84/1.67  Demodulation         : 0.04
% 2.84/1.67  BG Simplification    : 0.02
% 2.84/1.67  Subsumption          : 0.05
% 2.84/1.67  Abstraction          : 0.01
% 2.84/1.67  MUC search           : 0.00
% 2.84/1.67  Cooper               : 0.00
% 2.84/1.67  Total                : 0.67
% 2.84/1.67  Index Insertion      : 0.00
% 2.84/1.67  Index Deletion       : 0.00
% 2.84/1.67  Index Matching       : 0.00
% 2.84/1.68  BG Taut test         : 0.00
%------------------------------------------------------------------------------