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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN054-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/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 : n025.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:09 EDT 2023

% Result   : Unsatisfiable 2.50s 1.58s
% Output   : CNFRefutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   25 (   7 unt;   6 typ;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  17   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   13 (;  13   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_s > big_r > big_q > big_p > #nlpp > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_43,axiom,
    ! [X] :
      ( ~ big_q(X)
      | big_s(X) ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [X] :
      ( ~ big_s(X)
      | ~ big_q(X) ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [X] :
      ( ~ big_p(X)
      | big_q(X)
      | big_r(X) ),
    file(unknown,unknown) ).

tff(f_54,axiom,
    ! [X] :
      ( ~ big_p(X)
      | ~ big_r(X) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ( big_p(a)
    | big_q(b) ),
    file(unknown,unknown) ).

tff(c_37,plain,
    ! [X_12] :
      ( big_s(X_12)
      | ~ big_q(X_12) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_2,plain,
    ! [X_1] :
      ( ~ big_q(X_1)
      | ~ big_s(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_41,plain,
    ! [X_12] : ~ big_q(X_12),
    inference(resolution,[status(thm)],[c_37,c_2]) ).

tff(c_21,plain,
    ! [X_9] :
      ( big_s(X_9)
      | ~ big_q(X_9) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_25,plain,
    ! [X_9] : ~ big_q(X_9),
    inference(resolution,[status(thm)],[c_21,c_2]) ).

tff(c_4,plain,
    ! [X_2] :
      ( big_r(X_2)
      | big_q(X_2)
      | ~ big_p(X_2) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_28,plain,
    ! [X_11] :
      ( big_r(X_11)
      | ~ big_p(X_11) ),
    inference(negUnitSimplification,[status(thm)],[c_25,c_4]) ).

tff(c_12,plain,
    ! [X_5] :
      ( ~ big_r(X_5)
      | ~ big_p(X_5) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_32,plain,
    ! [X_11] : ~ big_p(X_11),
    inference(resolution,[status(thm)],[c_28,c_12]) ).

tff(c_6,plain,
    ( big_q(b)
    | big_p(a) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_20,plain,
    big_p(a),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_34,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_32,c_20]) ).

tff(c_35,plain,
    big_q(b),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_43,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_41,c_35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN054-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/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.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 17:18:05 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 2.50/1.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.59  
% 2.50/1.59  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.64/1.61  
% 2.64/1.61  Inference rules
% 2.64/1.61  ----------------------
% 2.64/1.61  #Ref     : 0
% 2.64/1.61  #Sup     : 4
% 2.64/1.61  #Fact    : 0
% 2.64/1.61  #Define  : 0
% 2.64/1.61  #Split   : 1
% 2.64/1.61  #Chain   : 0
% 2.64/1.61  #Close   : 0
% 2.64/1.61  
% 2.64/1.61  Ordering : KBO
% 2.64/1.61  
% 2.64/1.61  Simplification rules
% 2.64/1.61  ----------------------
% 2.64/1.61  #Subsume      : 7
% 2.64/1.61  #Demod        : 0
% 2.64/1.61  #Tautology    : 0
% 2.64/1.61  #SimpNegUnit  : 3
% 2.64/1.62  #BackRed      : 2
% 2.64/1.62  
% 2.64/1.62  #Partial instantiations: 0
% 2.64/1.62  #Strategies tried      : 1
% 2.64/1.62  
% 2.64/1.62  Timing (in seconds)
% 2.64/1.62  ----------------------
% 2.64/1.62  Preprocessing        : 0.38
% 2.64/1.62  Parsing              : 0.21
% 2.64/1.62  CNF conversion       : 0.02
% 2.64/1.62  Main loop            : 0.18
% 2.64/1.62  Inferencing          : 0.08
% 2.64/1.62  Reduction            : 0.03
% 2.64/1.62  Demodulation         : 0.01
% 2.64/1.62  BG Simplification    : 0.01
% 2.64/1.62  Subsumption          : 0.04
% 2.64/1.62  Abstraction          : 0.00
% 2.64/1.62  MUC search           : 0.00
% 2.64/1.62  Cooper               : 0.00
% 2.64/1.62  Total                : 0.60
% 2.64/1.62  Index Insertion      : 0.00
% 2.64/1.62  Index Deletion       : 0.00
% 2.64/1.62  Index Matching       : 0.00
% 2.64/1.62  BG Taut test         : 0.00
%------------------------------------------------------------------------------