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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN081-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/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 : n018.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:09:33 EDT 2023

% Result   : Unsatisfiable 1.92s 1.55s
% Output   : CNFRefutation 2.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   10 (   2 unt;   2 typ;   0 def)
%            Number of atoms       :   14 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   7   ~;   6   |;   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  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :    7 (;   7   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_f > #nlpp > f

%Foreground sorts:

%Background operators:

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

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

tff(f_36,axiom,
    ! [X] :
      ( ~ big_f(X)
      | big_f(f(X)) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [X] :
      ( ~ big_f(X)
      | ~ big_f(f(X)) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [X] :
      ( big_f(f(X))
      | big_f(X) ),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_3] :
      ( big_f(f(X_3))
      | ~ big_f(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_8,plain,
    ! [X_5] :
      ( ~ big_f(f(X_5))
      | ~ big_f(X_5) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_12,plain,
    ! [X_3] : ~ big_f(X_3),
    inference(resolution,[status(thm)],[c_6,c_8]) ).

tff(c_4,plain,
    ! [X_2] :
      ( big_f(X_2)
      | big_f(f(X_2)) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_15,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_12,c_12,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN081-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15  % 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.16/0.37  % Computer : n018.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 17:17:05 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 1.92/1.55  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.92/1.55  
% 1.92/1.55  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.16/1.59  
% 2.16/1.59  Inference rules
% 2.16/1.59  ----------------------
% 2.16/1.59  #Ref     : 0
% 2.16/1.59  #Sup     : 1
% 2.16/1.59  #Fact    : 0
% 2.16/1.59  #Define  : 0
% 2.16/1.59  #Split   : 0
% 2.16/1.59  #Chain   : 0
% 2.16/1.59  #Close   : 0
% 2.16/1.59  
% 2.16/1.59  Ordering : KBO
% 2.16/1.59  
% 2.16/1.59  Simplification rules
% 2.16/1.59  ----------------------
% 2.16/1.59  #Subsume      : 2
% 2.16/1.59  #Demod        : 0
% 2.16/1.59  #Tautology    : 0
% 2.16/1.59  #SimpNegUnit  : 2
% 2.16/1.59  #BackRed      : 0
% 2.16/1.59  
% 2.16/1.59  #Partial instantiations: 0
% 2.16/1.59  #Strategies tried      : 1
% 2.16/1.59  
% 2.16/1.59  Timing (in seconds)
% 2.16/1.59  ----------------------
% 2.16/1.59  Preprocessing        : 0.37
% 2.16/1.59  Parsing              : 0.20
% 2.16/1.59  CNF conversion       : 0.02
% 2.16/1.59  Main loop            : 0.12
% 2.16/1.59  Inferencing          : 0.06
% 2.16/1.59  Reduction            : 0.01
% 2.16/1.60  Demodulation         : 0.01
% 2.16/1.60  BG Simplification    : 0.01
% 2.16/1.60  Subsumption          : 0.03
% 2.16/1.60  Abstraction          : 0.00
% 2.16/1.60  MUC search           : 0.00
% 2.16/1.60  Cooper               : 0.00
% 2.16/1.60  Total                : 0.55
% 2.16/1.60  Index Insertion      : 0.00
% 2.16/1.60  Index Deletion       : 0.00
% 2.16/1.60  Index Matching       : 0.00
% 2.16/1.60  BG Taut test         : 0.00
%------------------------------------------------------------------------------