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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN925+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/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 : n028.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:16:52 EDT 2023

% Result   : Theorem 2.04s 1.47s
% Output   : CNFRefutation 2.04s
% 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 :    5 (   3 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 (;   2   !;   1   ?;   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_31,negated_conjecture,
    ~ ? [Y] :
        ( p(Y)
       => ! [X] : p(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(c_2,plain,
    ! [Y_1] : p(Y_1),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

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

tff(c_6,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN925+1 : TPTP v8.1.2. Released v3.1.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 : n028.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:30:54 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.04/1.47  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/1.47  
% 2.04/1.47  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.04/1.51  
% 2.04/1.51  Inference rules
% 2.04/1.51  ----------------------
% 2.04/1.51  #Ref     : 0
% 2.04/1.51  #Sup     : 0
% 2.04/1.51  #Fact    : 0
% 2.04/1.51  #Define  : 0
% 2.04/1.51  #Split   : 0
% 2.04/1.51  #Chain   : 0
% 2.04/1.51  #Close   : 0
% 2.04/1.51  
% 2.04/1.51  Ordering : KBO
% 2.04/1.51  
% 2.04/1.51  Simplification rules
% 2.04/1.51  ----------------------
% 2.04/1.51  #Subsume      : 1
% 2.04/1.51  #Demod        : 1
% 2.04/1.51  #Tautology    : 0
% 2.04/1.51  #SimpNegUnit  : 0
% 2.04/1.51  #BackRed      : 0
% 2.04/1.51  
% 2.04/1.51  #Partial instantiations: 0
% 2.04/1.51  #Strategies tried      : 1
% 2.04/1.51  
% 2.04/1.51  Timing (in seconds)
% 2.04/1.51  ----------------------
% 2.04/1.51  Preprocessing        : 0.38
% 2.04/1.51  Parsing              : 0.21
% 2.04/1.51  CNF conversion       : 0.02
% 2.04/1.51  Main loop            : 0.05
% 2.04/1.51  Inferencing          : 0.00
% 2.04/1.51  Reduction            : 0.02
% 2.04/1.51  Demodulation         : 0.02
% 2.04/1.51  BG Simplification    : 0.01
% 2.04/1.51  Subsumption          : 0.02
% 2.04/1.51  Abstraction          : 0.00
% 2.04/1.51  MUC search           : 0.00
% 2.04/1.52  Cooper               : 0.00
% 2.04/1.52  Total                : 0.48
% 2.04/1.52  Index Insertion      : 0.00
% 2.04/1.52  Index Deletion       : 0.00
% 2.04/1.52  Index Matching       : 0.00
% 2.04/1.52  BG Taut test         : 0.00
%------------------------------------------------------------------------------