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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN001+1 : TPTP v8.1.2. Released v2.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 : n008.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:08:28 EDT 2023

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

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

%Foreground sorts:

%Background operators:

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

tff(f_34,negated_conjecture,
    ~ ( ~ ~ p
    <=> p ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel2) ).

tff(c_4,plain,
    p,
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_2,plain,
    ~ p,
    inference(cnfTransformation,[status(thm)],[f_34]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN001+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/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 : n008.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:10:03 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 1.86/1.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.86/1.35  
% 1.86/1.35  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.86/1.39  
% 1.86/1.39  Inference rules
% 1.86/1.39  ----------------------
% 1.86/1.39  #Ref     : 0
% 1.86/1.39  #Sup     : 0
% 1.86/1.39  #Fact    : 0
% 1.86/1.39  #Define  : 0
% 1.86/1.39  #Split   : 0
% 1.86/1.39  #Chain   : 0
% 1.86/1.39  #Close   : 0
% 1.86/1.39  
% 1.86/1.39  Ordering : KBO
% 1.86/1.39  
% 1.86/1.39  Simplification rules
% 1.86/1.39  ----------------------
% 1.86/1.39  #Subsume      : 1
% 1.86/1.39  #Demod        : 1
% 1.86/1.39  #Tautology    : 0
% 1.86/1.39  #SimpNegUnit  : 0
% 1.86/1.39  #BackRed      : 0
% 1.86/1.39  
% 1.86/1.39  #Partial instantiations: 0
% 1.86/1.39  #Strategies tried      : 1
% 1.86/1.39  
% 1.86/1.39  Timing (in seconds)
% 1.86/1.39  ----------------------
% 1.86/1.39  Preprocessing        : 0.31
% 1.86/1.39  Parsing              : 0.16
% 1.86/1.39  CNF conversion       : 0.01
% 1.86/1.39  Main loop            : 0.04
% 1.86/1.39  Inferencing          : 0.00
% 1.86/1.39  Reduction            : 0.02
% 1.86/1.39  Demodulation         : 0.01
% 1.86/1.39  BG Simplification    : 0.01
% 1.86/1.39  Subsumption          : 0.02
% 1.86/1.39  Abstraction          : 0.00
% 1.86/1.39  MUC search           : 0.00
% 1.86/1.39  Cooper               : 0.00
% 1.86/1.39  Total                : 0.40
% 1.86/1.39  Index Insertion      : 0.00
% 1.86/1.39  Index Deletion       : 0.00
% 1.86/1.39  Index Matching       : 0.00
% 1.86/1.39  BG Taut test         : 0.00
%------------------------------------------------------------------------------