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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN391+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/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 : n013.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:43 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp > p2 > p1

%Foreground sorts:

%Background operators:

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

tff(p1,type,
    p1: $o ).

tff(f_47,negated_conjecture,
    ~ ( ( ( p1
          | p2 )
        & ( ~ p1
          | p2 )
        & ( p1
          | ~ p2 ) )
     => ~ ( ~ p1
          | ~ p2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel9) ).

tff(c_8,plain,
    ( p2
    | p1 ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_9,plain,
    p1,
    inference(splitLeft,[status(thm)],[c_8]) ).

tff(c_6,plain,
    ( p2
    | ~ p1 ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_11,plain,
    p2,
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6]) ).

tff(c_2,plain,
    ( ~ p2
    | ~ p1 ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_15,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_11,c_2]) ).

tff(c_17,plain,
    ~ p1,
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_16,plain,
    p2,
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_4,plain,
    ( ~ p2
    | p1 ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_19,plain,
    p1,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_4]) ).

tff(c_20,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_17,c_19]) ).

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