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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN044-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 : n001.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:05 EDT 2023

% Result   : Unsatisfiable 2.00s 1.58s
% Output   : CNFRefutation 2.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (  12 unt;   3 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  15   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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  :    4 (   3 usr;   4 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

tff(f_48,axiom,
    ( p
    | q ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ( ~ q
    | r ),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ( ~ r
    | q ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ( ~ p
    | q
    | r ),
    file(unknown,unknown) ).

tff(f_45,axiom,
    ( ~ p
    | ~ q ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    ( ~ r
    | p ),
    file(unknown,unknown) ).

tff(c_12,plain,
    ( q
    | p ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_13,plain,
    p,
    inference(splitLeft,[status(thm)],[c_12]) ).

tff(c_2,plain,
    ( r
    | ~ q ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_14,plain,
    ~ q,
    inference(splitLeft,[status(thm)],[c_2]) ).

tff(c_6,plain,
    ( q
    | ~ r ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_15,plain,
    ~ r,
    inference(negUnitSimplification,[status(thm)],[c_14,c_6]) ).

tff(c_8,plain,
    ( r
    | q
    | ~ p ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_20,plain,
    ( r
    | q ),
    inference(demodulation,[status(thm),theory(equality)],[c_13,c_8]) ).

tff(c_21,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14,c_15,c_20]) ).

tff(c_22,plain,
    r,
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_25,plain,
    q,
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_6]) ).

tff(c_10,plain,
    ( ~ q
    | ~ p ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_28,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_13,c_25,c_10]) ).

tff(c_30,plain,
    ~ p,
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_29,plain,
    q,
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_32,plain,
    r,
    inference(demodulation,[status(thm),theory(equality)],[c_29,c_2]) ).

tff(c_4,plain,
    ( p
    | ~ r ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_34,plain,
    p,
    inference(demodulation,[status(thm),theory(equality)],[c_32,c_4]) ).

tff(c_35,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_30,c_34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN044-1 : TPTP v8.1.2. Released v1.0.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 : n001.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:56:40 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.00/1.58  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.00/1.58  
% 2.00/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.00/1.62  
% 2.00/1.62  Inference rules
% 2.00/1.62  ----------------------
% 2.00/1.62  #Ref     : 0
% 2.00/1.62  #Sup     : 0
% 2.00/1.62  #Fact    : 0
% 2.00/1.62  #Define  : 0
% 2.00/1.62  #Split   : 2
% 2.00/1.62  #Chain   : 0
% 2.00/1.62  #Close   : 0
% 2.00/1.62  
% 2.00/1.62  Ordering : KBO
% 2.00/1.62  
% 2.00/1.62  Simplification rules
% 2.00/1.62  ----------------------
% 2.00/1.62  #Subsume      : 2
% 2.00/1.62  #Demod        : 9
% 2.00/1.62  #Tautology    : 1
% 2.00/1.62  #SimpNegUnit  : 3
% 2.00/1.62  #BackRed      : 0
% 2.00/1.62  
% 2.00/1.62  #Partial instantiations: 0
% 2.00/1.62  #Strategies tried      : 1
% 2.00/1.62  
% 2.00/1.62  Timing (in seconds)
% 2.00/1.62  ----------------------
% 2.00/1.62  Preprocessing        : 0.35
% 2.00/1.62  Parsing              : 0.18
% 2.00/1.62  CNF conversion       : 0.01
% 2.00/1.62  Main loop            : 0.13
% 2.00/1.62  Inferencing          : 0.04
% 2.00/1.62  Reduction            : 0.03
% 2.00/1.62  Demodulation         : 0.02
% 2.00/1.62  BG Simplification    : 0.01
% 2.00/1.62  Subsumption          : 0.04
% 2.00/1.62  Abstraction          : 0.00
% 2.00/1.62  MUC search           : 0.00
% 2.00/1.62  Cooper               : 0.00
% 2.00/1.62  Total                : 0.54
% 2.00/1.62  Index Insertion      : 0.00
% 2.00/1.62  Index Deletion       : 0.00
% 2.00/1.62  Index Matching       : 0.00
% 2.00/1.63  BG Taut test         : 0.00
%------------------------------------------------------------------------------