TSTP Solution File: SYN964+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN964+1 : TPTP v8.1.2. Released v3.1.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 : n004.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:17:00 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

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

tff('#skF_1',type,
    '#skF_1': $i ).

tff(f_30,negated_conjecture,
    ~ ( ? [X] : p(X)
     => ? [Z] : p(Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(c_2,plain,
    ! [Z_1] : ~ p(Z_1),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_4,plain,
    p('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_5,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN964+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % 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.13/0.35  % Computer : n004.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:23:56 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 1.91/1.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.91/1.44  
% 1.91/1.44  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.17/1.48  
% 2.17/1.48  Inference rules
% 2.17/1.48  ----------------------
% 2.17/1.48  #Ref     : 0
% 2.17/1.48  #Sup     : 0
% 2.17/1.48  #Fact    : 0
% 2.17/1.48  #Define  : 0
% 2.17/1.48  #Split   : 0
% 2.17/1.48  #Chain   : 0
% 2.17/1.48  #Close   : 0
% 2.17/1.48  
% 2.17/1.48  Ordering : KBO
% 2.17/1.48  
% 2.17/1.48  Simplification rules
% 2.17/1.48  ----------------------
% 2.17/1.48  #Subsume      : 1
% 2.17/1.48  #Demod        : 0
% 2.17/1.48  #Tautology    : 0
% 2.17/1.48  #SimpNegUnit  : 1
% 2.17/1.48  #BackRed      : 0
% 2.17/1.48  
% 2.17/1.48  #Partial instantiations: 0
% 2.17/1.48  #Strategies tried      : 1
% 2.17/1.48  
% 2.17/1.48  Timing (in seconds)
% 2.17/1.48  ----------------------
% 2.17/1.48  Preprocessing        : 0.36
% 2.17/1.48  Parsing              : 0.19
% 2.17/1.48  CNF conversion       : 0.02
% 2.17/1.48  Main loop            : 0.05
% 2.17/1.48  Inferencing          : 0.00
% 2.17/1.48  Reduction            : 0.02
% 2.17/1.48  Demodulation         : 0.01
% 2.17/1.48  BG Simplification    : 0.01
% 2.17/1.48  Subsumption          : 0.02
% 2.17/1.48  Abstraction          : 0.00
% 2.17/1.48  MUC search           : 0.00
% 2.17/1.48  Cooper               : 0.00
% 2.17/1.48  Total                : 0.46
% 2.17/1.49  Index Insertion      : 0.00
% 2.17/1.49  Index Deletion       : 0.00
% 2.17/1.49  Index Matching       : 0.00
% 2.17/1.49  BG Taut test         : 0.00
%------------------------------------------------------------------------------