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

View Problem - Process Solution

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

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

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

%Foreground sorts:

%Background operators:

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

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

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

tff(f_57,axiom,
    ! [X,Y] :
      ( f(a,z(X,Y))
      | f(Y,z(X,Y))
      | ~ f(X,Y) ),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [X,Y] :
      ( ~ f(a,z(X,Y))
      | ~ f(Y,z(X,Y))
      | ~ f(X,Y) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [X,Y] :
      ( ~ f(a,z(X,Y))
      | f(z(X,Y),a) ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ! [X,Y] :
      ( f(a,z(X,Y))
      | f(Y,z(X,Y))
      | f(X,z(X,Y)) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ! [X_9,Y_10] :
      ( ~ f(X_9,Y_10)
      | f(Y_10,z(X_9,Y_10))
      | f(a,z(X_9,Y_10)) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_31,plain,
    ! [X_9] :
      ( ~ f(X_9,a)
      | f(a,z(X_9,a)) ),
    inference(factorization,[status(thm),theory(equality)],[c_10]) ).

tff(c_35,plain,
    ! [X_20,Y_21] :
      ( ~ f(X_20,Y_21)
      | ~ f(Y_21,z(X_20,Y_21))
      | ~ f(a,z(X_20,Y_21)) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_43,plain,
    ! [X_22] :
      ( ~ f(a,z(X_22,a))
      | ~ f(X_22,a) ),
    inference(resolution,[status(thm)],[c_31,c_35]) ).

tff(c_51,plain,
    ! [X_9] : ~ f(X_9,a),
    inference(resolution,[status(thm)],[c_31,c_43]) ).

tff(c_2,plain,
    ! [X_1,Y_2] :
      ( f(z(X_1,Y_2),a)
      | ~ f(a,z(X_1,Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_52,plain,
    ! [X_1,Y_2] : ~ f(a,z(X_1,Y_2)),
    inference(negUnitSimplification,[status(thm)],[c_51,c_2]) ).

tff(c_6,plain,
    ! [X_5,Y_6] :
      ( f(X_5,z(X_5,Y_6))
      | f(Y_6,z(X_5,Y_6))
      | f(a,z(X_5,Y_6)) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_56,plain,
    ! [X_5,Y_6] :
      ( f(X_5,z(X_5,Y_6))
      | f(Y_6,z(X_5,Y_6)) ),
    inference(negUnitSimplification,[status(thm)],[c_52,c_6]) ).

tff(c_82,plain,
    ! [X_28] : f(X_28,z(X_28,X_28)),
    inference(factorization,[status(thm),theory(equality)],[c_56]) ).

tff(c_87,plain,
    $false,
    inference(resolution,[status(thm)],[c_82,c_52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN350-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.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:53 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.67/1.63  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.67/1.64  
% 2.67/1.64  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.67/1.67  
% 2.67/1.67  Inference rules
% 2.67/1.67  ----------------------
% 2.67/1.67  #Ref     : 0
% 2.67/1.67  #Sup     : 7
% 2.67/1.67  #Fact    : 4
% 2.67/1.67  #Define  : 0
% 2.67/1.67  #Split   : 0
% 2.67/1.67  #Chain   : 0
% 2.67/1.67  #Close   : 0
% 2.67/1.67  
% 2.67/1.67  Ordering : KBO
% 2.67/1.67  
% 2.67/1.67  Simplification rules
% 2.67/1.67  ----------------------
% 2.67/1.67  #Subsume      : 5
% 2.67/1.67  #Demod        : 0
% 2.67/1.67  #Tautology    : 2
% 2.67/1.67  #SimpNegUnit  : 3
% 2.67/1.67  #BackRed      : 2
% 2.67/1.67  
% 2.67/1.67  #Partial instantiations: 0
% 2.67/1.67  #Strategies tried      : 1
% 2.67/1.67  
% 2.67/1.67  Timing (in seconds)
% 2.67/1.67  ----------------------
% 2.67/1.68  Preprocessing        : 0.43
% 2.67/1.68  Parsing              : 0.24
% 2.67/1.68  CNF conversion       : 0.02
% 2.67/1.68  Main loop            : 0.19
% 2.67/1.68  Inferencing          : 0.10
% 2.67/1.68  Reduction            : 0.02
% 2.67/1.68  Demodulation         : 0.01
% 2.67/1.68  BG Simplification    : 0.02
% 2.67/1.68  Subsumption          : 0.05
% 2.67/1.68  Abstraction          : 0.01
% 2.67/1.68  MUC search           : 0.00
% 2.67/1.68  Cooper               : 0.00
% 2.67/1.68  Total                : 0.68
% 2.67/1.68  Index Insertion      : 0.00
% 2.67/1.68  Index Deletion       : 0.00
% 2.67/1.68  Index Matching       : 0.00
% 2.67/1.68  BG Taut test         : 0.00
%------------------------------------------------------------------------------