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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN341-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 : n006.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:31 EDT 2023

% Result   : Unsatisfiable 2.15s 1.49s
% Output   : CNFRefutation 2.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    5
% Syntax   : Number of formulae    :    8 (   5 unt;   3 typ;   0 def)
%            Number of atoms       :    5 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 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  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-2 aty)
%            Number of variables   :    8 (;   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ f > y4 > #nlpp > y2

%Foreground sorts:

%Background operators:

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

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

tff(y2,type,
    y2: $i > $i ).

tff(f_28,axiom,
    ! [Y1,Y3] : f(Y1,y2(Y1),Y3),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [Y1,Y3] : ~ f(y2(Y1),Y3,y4(Y1,Y3)),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [Y1_1,Y3_2] : f(Y1_1,y2(Y1_1),Y3_2),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_6,plain,
    ! [Y1_7,Y3_8] : ~ f(y2(Y1_7),Y3_8,y4(Y1_7,Y3_8)),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_11,plain,
    $false,
    inference(resolution,[status(thm)],[c_2,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN341-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/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.14/0.35  % Computer : n006.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:04:58 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.15/1.49  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.15/1.49  
% 2.15/1.49  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.15/1.53  
% 2.15/1.53  Inference rules
% 2.15/1.53  ----------------------
% 2.15/1.53  #Ref     : 0
% 2.15/1.53  #Sup     : 1
% 2.15/1.53  #Fact    : 0
% 2.15/1.53  #Define  : 0
% 2.15/1.53  #Split   : 0
% 2.15/1.53  #Chain   : 0
% 2.15/1.53  #Close   : 0
% 2.15/1.53  
% 2.15/1.53  Ordering : KBO
% 2.15/1.53  
% 2.15/1.53  Simplification rules
% 2.15/1.53  ----------------------
% 2.15/1.53  #Subsume      : 0
% 2.15/1.53  #Demod        : 0
% 2.15/1.53  #Tautology    : 0
% 2.15/1.53  #SimpNegUnit  : 0
% 2.15/1.53  #BackRed      : 0
% 2.15/1.53  
% 2.15/1.53  #Partial instantiations: 0
% 2.15/1.53  #Strategies tried      : 1
% 2.15/1.53  
% 2.15/1.53  Timing (in seconds)
% 2.15/1.53  ----------------------
% 2.15/1.53  Preprocessing        : 0.35
% 2.15/1.53  Parsing              : 0.19
% 2.15/1.53  CNF conversion       : 0.02
% 2.15/1.53  Main loop            : 0.10
% 2.15/1.53  Inferencing          : 0.05
% 2.15/1.53  Reduction            : 0.02
% 2.15/1.53  Demodulation         : 0.02
% 2.15/1.53  BG Simplification    : 0.01
% 2.15/1.53  Subsumption          : 0.02
% 2.15/1.53  Abstraction          : 0.00
% 2.15/1.53  MUC search           : 0.00
% 2.15/1.53  Cooper               : 0.00
% 2.15/1.53  Total                : 0.51
% 2.15/1.53  Index Insertion      : 0.00
% 2.15/1.53  Index Deletion       : 0.00
% 2.15/1.53  Index Matching       : 0.00
% 2.15/1.53  BG Taut test         : 0.00
%------------------------------------------------------------------------------