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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN724-1 : TPTP v8.1.2. Released v2.5.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 : n031.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:11:43 EDT 2023

% Result   : Unsatisfiable 2.40s 1.60s
% Output   : CNFRefutation 2.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   30 (  14 unt;   4 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   39 (  23   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    3 (;   3   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ s > r > #nlpp > sk2 > sk1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(sk2,type,
    sk2: $i ).

tff(sk1,type,
    sk1: $i ).

tff(s,type,
    s: $i > $o ).

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

tff(f_29,axiom,
    ( r(sk1)
    | r(sk2) ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [A] :
      ( s(A)
      | ~ r(A) ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ( r(sk2)
    | ~ s(sk1) ),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ( r(sk1)
    | ~ r(sk2)
    | ~ s(sk2) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ( ~ r(sk2)
    | ~ s(sk1)
    | ~ s(sk2) ),
    file(unknown,unknown) ).

tff(c_4,plain,
    ( r(sk2)
    | r(sk1) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_12,plain,
    r(sk1),
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_13,plain,
    ! [A_2] :
      ( ~ r(A_2)
      | s(A_2) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_8,plain,
    ( ~ s(sk1)
    | r(sk2) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_11,plain,
    ~ s(sk1),
    inference(splitLeft,[status(thm)],[c_8]) ).

tff(c_16,plain,
    ~ r(sk1),
    inference(resolution,[status(thm)],[c_13,c_11]) ).

tff(c_20,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_16]) ).

tff(c_21,plain,
    r(sk2),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_2,plain,
    ! [A_1] :
      ( ~ r(A_1)
      | s(A_1) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_22,plain,
    ~ r(sk1),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_6,plain,
    ( ~ s(sk2)
    | ~ r(sk2)
    | r(sk1) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_29,plain,
    ( ~ s(sk2)
    | r(sk1) ),
    inference(demodulation,[status(thm),theory(equality)],[c_21,c_6]) ).

tff(c_30,plain,
    ~ s(sk2),
    inference(negUnitSimplification,[status(thm)],[c_22,c_29]) ).

tff(c_33,plain,
    ~ r(sk2),
    inference(resolution,[status(thm)],[c_2,c_30]) ).

tff(c_37,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_21,c_33]) ).

tff(c_38,plain,
    r(sk2),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_39,plain,
    s(sk1),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_10,plain,
    ( ~ s(sk2)
    | ~ s(sk1)
    | ~ r(sk2) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_43,plain,
    ~ s(sk2),
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_39,c_10]) ).

tff(c_46,plain,
    ~ r(sk2),
    inference(resolution,[status(thm)],[c_2,c_43]) ).

tff(c_50,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : SYN724-1 : TPTP v8.1.2. Released v2.5.0.
% 0.15/0.15  % 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.16/0.37  % Computer : n031.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 17:36:14 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 2.40/1.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.40/1.61  
% 2.40/1.61  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.68/1.64  
% 2.68/1.64  Inference rules
% 2.68/1.64  ----------------------
% 2.68/1.64  #Ref     : 0
% 2.68/1.64  #Sup     : 4
% 2.68/1.64  #Fact    : 0
% 2.68/1.64  #Define  : 0
% 2.68/1.64  #Split   : 3
% 2.68/1.64  #Chain   : 0
% 2.68/1.64  #Close   : 0
% 2.68/1.64  
% 2.68/1.64  Ordering : KBO
% 2.68/1.64  
% 2.68/1.64  Simplification rules
% 2.68/1.64  ----------------------
% 2.68/1.64  #Subsume      : 1
% 2.68/1.64  #Demod        : 6
% 2.68/1.64  #Tautology    : 0
% 2.68/1.64  #SimpNegUnit  : 1
% 2.68/1.64  #BackRed      : 0
% 2.68/1.64  
% 2.68/1.64  #Partial instantiations: 0
% 2.68/1.64  #Strategies tried      : 1
% 2.68/1.64  
% 2.68/1.64  Timing (in seconds)
% 2.68/1.64  ----------------------
% 2.68/1.64  Preprocessing        : 0.38
% 2.68/1.64  Parsing              : 0.21
% 2.68/1.64  CNF conversion       : 0.02
% 2.68/1.64  Main loop            : 0.16
% 2.68/1.64  Inferencing          : 0.07
% 2.68/1.64  Reduction            : 0.03
% 2.68/1.64  Demodulation         : 0.02
% 2.68/1.64  BG Simplification    : 0.02
% 2.68/1.64  Subsumption          : 0.03
% 2.68/1.64  Abstraction          : 0.01
% 2.68/1.64  MUC search           : 0.00
% 2.68/1.64  Cooper               : 0.00
% 2.68/1.64  Total                : 0.59
% 2.68/1.64  Index Insertion      : 0.00
% 2.68/1.64  Index Deletion       : 0.00
% 2.68/1.64  Index Matching       : 0.00
% 2.68/1.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------