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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN726-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 : 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:11:44 EDT 2023

% Result   : Unsatisfiable 3.30s 1.89s
% Output   : CNFRefutation 3.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   40 (  11 unt;   6 typ;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   55 (  22   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   56 (;  56   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ q > p > #nlpp > sk4 > sk3 > sk2 > sk1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_46,axiom,
    ! [A,B] :
      ( p(A,B)
      | q(A,B) ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ! [B,A] :
      ( q(B,A)
      | ~ q(A,B) ),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [A,C,B] :
      ( q(A,C)
      | ~ q(A,B)
      | ~ q(B,C) ),
    file(unknown,unknown) ).

tff(f_50,axiom,
    ~ q(sk3,sk4),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ! [A,C,B] :
      ( p(A,C)
      | ~ p(A,B)
      | ~ p(B,C) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ~ p(sk1,sk2),
    file(unknown,unknown) ).

tff(c_14,plain,
    ! [A_13,B_14] :
      ( q(A_13,B_14)
      | p(A_13,B_14) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_6,plain,
    ! [A_8,B_7] :
      ( ~ q(A_8,B_7)
      | q(B_7,A_8) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_20,plain,
    ! [B_14,A_13] :
      ( q(B_14,A_13)
      | p(A_13,B_14) ),
    inference(resolution,[status(thm)],[c_14,c_6]) ).

tff(c_8,plain,
    ! [A_9,B_10] :
      ( q(A_9,B_10)
      | p(A_9,B_10) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_41,plain,
    ! [B_21,C_22,A_23] :
      ( ~ q(B_21,C_22)
      | ~ q(A_23,B_21)
      | q(A_23,C_22) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_60,plain,
    ! [A_25,A_26,B_27] :
      ( ~ q(A_25,A_26)
      | q(A_25,B_27)
      | p(A_26,B_27) ),
    inference(resolution,[status(thm)],[c_8,c_41]) ).

tff(c_122,plain,
    ! [B_34,B_35,A_36] :
      ( q(B_34,B_35)
      | p(A_36,B_35)
      | p(A_36,B_34) ),
    inference(resolution,[status(thm)],[c_20,c_60]) ).

tff(c_12,plain,
    ~ q(sk3,sk4),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_170,plain,
    ! [A_38] :
      ( p(A_38,sk4)
      | p(A_38,sk3) ),
    inference(resolution,[status(thm)],[c_122,c_12]) ).

tff(c_26,plain,
    ! [B_18,A_19] :
      ( q(B_18,A_19)
      | p(A_19,B_18) ),
    inference(resolution,[status(thm)],[c_14,c_6]) ).

tff(c_33,plain,
    p(sk4,sk3),
    inference(resolution,[status(thm)],[c_26,c_12]) ).

tff(c_2,plain,
    ! [B_3,C_2,A_1] :
      ( ~ p(B_3,C_2)
      | ~ p(A_1,B_3)
      | p(A_1,C_2) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_36,plain,
    ! [A_1] :
      ( ~ p(A_1,sk4)
      | p(A_1,sk3) ),
    inference(resolution,[status(thm)],[c_33,c_2]) ).

tff(c_176,plain,
    ! [A_38] : p(A_38,sk3),
    inference(resolution,[status(thm)],[c_170,c_36]) ).

tff(c_21,plain,
    p(sk3,sk4),
    inference(resolution,[status(thm)],[c_14,c_12]) ).

tff(c_22,plain,
    ! [B_15,C_16,A_17] :
      ( ~ p(B_15,C_16)
      | ~ p(A_17,B_15)
      | p(A_17,C_16) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_25,plain,
    ! [A_17] :
      ( ~ p(A_17,sk3)
      | p(A_17,sk4) ),
    inference(resolution,[status(thm)],[c_21,c_22]) ).

tff(c_182,plain,
    ! [A_17] : p(A_17,sk4),
    inference(demodulation,[status(thm),theory(equality)],[c_176,c_25]) ).

tff(c_67,plain,
    ! [A_28,B_29,A_30] :
      ( ~ q(A_28,B_29)
      | q(A_28,A_30)
      | p(A_30,B_29) ),
    inference(resolution,[status(thm)],[c_20,c_41]) ).

tff(c_256,plain,
    ! [A_46,A_47,B_48] :
      ( q(A_46,A_47)
      | p(A_47,B_48)
      | p(A_46,B_48) ),
    inference(resolution,[status(thm)],[c_8,c_67]) ).

tff(c_300,plain,
    ! [B_51] :
      ( p(sk4,B_51)
      | p(sk3,B_51) ),
    inference(resolution,[status(thm)],[c_256,c_12]) ).

tff(c_302,plain,
    ! [A_1,B_51] :
      ( ~ p(A_1,sk4)
      | p(A_1,B_51)
      | p(sk3,B_51) ),
    inference(resolution,[status(thm)],[c_300,c_2]) ).

tff(c_305,plain,
    ! [A_1,B_51] :
      ( p(A_1,B_51)
      | p(sk3,B_51) ),
    inference(demodulation,[status(thm),theory(equality)],[c_182,c_302]) ).

tff(c_331,plain,
    ! [B_54] : p(sk3,B_54),
    inference(factorization,[status(thm),theory(equality)],[c_305]) ).

tff(c_333,plain,
    ! [A_1,B_54] :
      ( ~ p(A_1,sk3)
      | p(A_1,B_54) ),
    inference(resolution,[status(thm)],[c_331,c_2]) ).

tff(c_336,plain,
    ! [A_1,B_54] : p(A_1,B_54),
    inference(demodulation,[status(thm),theory(equality)],[c_176,c_333]) ).

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

tff(c_355,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_336,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN726-1 : TPTP v8.1.2. Released v2.5.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.17/0.36  % Computer : n025.cluster.edu
% 0.17/0.36  % Model    : x86_64 x86_64
% 0.17/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36  % Memory   : 8042.1875MB
% 0.17/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36  % CPULimit : 300
% 0.17/0.36  % WCLimit  : 300
% 0.17/0.36  % DateTime : Thu Aug  3 17:34:04 EDT 2023
% 0.17/0.36  % CPUTime  : 
% 3.30/1.89  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.30/1.89  
% 3.30/1.89  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.30/1.92  
% 3.30/1.92  Inference rules
% 3.30/1.92  ----------------------
% 3.30/1.92  #Ref     : 0
% 3.30/1.92  #Sup     : 68
% 3.30/1.92  #Fact    : 6
% 3.30/1.92  #Define  : 0
% 3.30/1.92  #Split   : 0
% 3.30/1.92  #Chain   : 0
% 3.30/1.92  #Close   : 0
% 3.30/1.92  
% 3.30/1.92  Ordering : KBO
% 3.30/1.92  
% 3.30/1.92  Simplification rules
% 3.30/1.92  ----------------------
% 3.30/1.92  #Subsume      : 15
% 3.30/1.92  #Demod        : 41
% 3.30/1.92  #Tautology    : 32
% 3.30/1.92  #SimpNegUnit  : 0
% 3.30/1.92  #BackRed      : 2
% 3.30/1.92  
% 3.30/1.92  #Partial instantiations: 0
% 3.30/1.92  #Strategies tried      : 1
% 3.30/1.92  
% 3.30/1.92  Timing (in seconds)
% 3.30/1.92  ----------------------
% 3.30/1.93  Preprocessing        : 0.41
% 3.30/1.93  Parsing              : 0.23
% 3.30/1.93  CNF conversion       : 0.02
% 3.30/1.93  Main loop            : 0.38
% 3.30/1.93  Inferencing          : 0.17
% 3.30/1.93  Reduction            : 0.07
% 3.30/1.93  Demodulation         : 0.05
% 3.30/1.93  BG Simplification    : 0.02
% 3.30/1.93  Subsumption          : 0.09
% 3.30/1.93  Abstraction          : 0.01
% 3.30/1.93  MUC search           : 0.00
% 3.30/1.93  Cooper               : 0.00
% 3.30/1.93  Total                : 0.84
% 3.30/1.93  Index Insertion      : 0.00
% 3.30/1.93  Index Deletion       : 0.00
% 3.30/1.93  Index Matching       : 0.00
% 3.30/1.93  BG Taut test         : 0.00
%------------------------------------------------------------------------------