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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN356+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 : n007.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:36 EDT 2023

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

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

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_43,negated_conjecture,
    ~ ( ( big_r(a,b)
        & ! [X,Y] :
            ( big_r(X,Y)
           => ( big_r(Y,X)
              & big_q(X,Y) ) )
        & ! [U,V] :
            ( big_q(U,V)
           => big_q(U,U) ) )
     => ( big_q(a,a)
        & big_q(b,b) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2107) ).

tff(c_2,plain,
    ( ~ big_q(b,b)
    | ~ big_q(a,a) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_11,plain,
    ~ big_q(a,a),
    inference(splitLeft,[status(thm)],[c_2]) ).

tff(c_6,plain,
    big_r(a,b),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_12,plain,
    ! [X_5,Y_6] :
      ( big_q(X_5,Y_6)
      | ~ big_r(X_5,Y_6) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_16,plain,
    big_q(a,b),
    inference(resolution,[status(thm)],[c_6,c_12]) ).

tff(c_29,plain,
    ! [U_9,V_10] :
      ( big_q(U_9,U_9)
      | ~ big_q(U_9,V_10) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_33,plain,
    big_q(a,a),
    inference(resolution,[status(thm)],[c_16,c_29]) ).

tff(c_38,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_11,c_33]) ).

tff(c_39,plain,
    ~ big_q(b,b),
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_55,plain,
    ! [Y_15,X_16] :
      ( big_r(Y_15,X_16)
      | ~ big_r(X_16,Y_15) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_58,plain,
    big_r(b,a),
    inference(resolution,[status(thm)],[c_6,c_55]) ).

tff(c_8,plain,
    ! [X_1,Y_2] :
      ( big_q(X_1,Y_2)
      | ~ big_r(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_66,plain,
    big_q(b,a),
    inference(resolution,[status(thm)],[c_58,c_8]) ).

tff(c_4,plain,
    ! [U_3,V_4] :
      ( big_q(U_3,U_3)
      | ~ big_q(U_3,V_4) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_68,plain,
    big_q(b,b),
    inference(resolution,[status(thm)],[c_66,c_4]) ).

tff(c_72,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_39,c_68]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SYN356+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.11  % 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.09/0.31  % Computer : n007.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit : 300
% 0.09/0.31  % WCLimit  : 300
% 0.09/0.31  % DateTime : Thu Aug  3 17:14:08 EDT 2023
% 0.09/0.31  % CPUTime  : 
% 3.05/2.06  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.05/2.06  
% 3.05/2.06  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.05/2.11  
% 3.05/2.11  Inference rules
% 3.05/2.11  ----------------------
% 3.05/2.11  #Ref     : 0
% 3.05/2.11  #Sup     : 13
% 3.05/2.11  #Fact    : 0
% 3.05/2.11  #Define  : 0
% 3.05/2.11  #Split   : 1
% 3.05/2.11  #Chain   : 0
% 3.05/2.11  #Close   : 0
% 3.05/2.11  
% 3.05/2.11  Ordering : KBO
% 3.05/2.11  
% 3.05/2.11  Simplification rules
% 3.05/2.11  ----------------------
% 3.05/2.11  #Subsume      : 0
% 3.05/2.11  #Demod        : 4
% 3.05/2.11  #Tautology    : 4
% 3.05/2.11  #SimpNegUnit  : 2
% 3.05/2.11  #BackRed      : 0
% 3.05/2.11  
% 3.05/2.11  #Partial instantiations: 0
% 3.05/2.11  #Strategies tried      : 1
% 3.05/2.11  
% 3.05/2.11  Timing (in seconds)
% 3.05/2.11  ----------------------
% 3.05/2.11  Preprocessing        : 0.59
% 3.05/2.11  Parsing              : 0.34
% 3.05/2.11  CNF conversion       : 0.03
% 3.05/2.11  Main loop            : 0.30
% 3.05/2.11  Inferencing          : 0.13
% 3.05/2.11  Reduction            : 0.06
% 3.05/2.11  Demodulation         : 0.04
% 3.05/2.11  BG Simplification    : 0.02
% 3.05/2.11  Subsumption          : 0.06
% 3.05/2.11  Abstraction          : 0.01
% 3.05/2.11  MUC search           : 0.00
% 3.05/2.11  Cooper               : 0.00
% 3.05/2.11  Total                : 0.97
% 3.05/2.11  Index Insertion      : 0.00
% 3.05/2.11  Index Deletion       : 0.00
% 3.05/2.11  Index Matching       : 0.00
% 3.05/2.12  BG Taut test         : 0.00
%------------------------------------------------------------------------------