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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN311-1 : TPTP v8.1.2. Released v1.2.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 : 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:10:23 EDT 2023

% Result   : Unsatisfiable 2.99s 1.81s
% Output   : CNFRefutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   38 (  15 unt;   7 typ;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   42 (  26   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   64 (;  64   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > g > f > d > c > b > a

%Foreground sorts:

%Background operators:

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

tff(f,type,
    f: $i > $i ).

tff(g,type,
    g: $i > $i ).

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

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

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

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

tff(f_42,axiom,
    p(a,b,c,d),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [X3,X,X1,X2] :
      ( p(X3,X,X1,X2)
      | ~ p(X,X1,X2,X3) ),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ! [X,X1,X2,X3] :
      ( p(X,X1,X2,g(X3))
      | ~ p(X,X1,X2,X3) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [X3,X2,X1,X] :
      ( p(X3,X2,X1,X)
      | ~ p(X,X1,X2,X3) ),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [X,X1,X2,X3] :
      ( p(f(X),X1,X2,X3)
      | ~ p(X,X1,X2,X3) ),
    file(unknown,unknown) ).

tff(f_44,axiom,
    ~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
    file(unknown,unknown) ).

tff(c_10,plain,
    p(a,b,c,d),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_21,plain,
    ! [X_21,X1_22,X2_23,X3_24] :
      ( ~ p(X_21,X1_22,X2_23,X3_24)
      | p(X3_24,X_21,X1_22,X2_23) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_27,plain,
    p(d,a,b,c),
    inference(resolution,[status(thm)],[c_10,c_21]) ).

tff(c_2,plain,
    ! [X_2,X1_3,X2_4,X3_1] :
      ( ~ p(X_2,X1_3,X2_4,X3_1)
      | p(X3_1,X_2,X1_3,X2_4) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_32,plain,
    p(c,d,a,b),
    inference(resolution,[status(thm)],[c_27,c_2]) ).

tff(c_34,plain,
    ! [X_25,X1_26,X2_27,X3_28] :
      ( ~ p(X_25,X1_26,X2_27,X3_28)
      | p(X_25,X1_26,X2_27,g(X3_28)) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_39,plain,
    ! [X3_28,X_25,X1_26,X2_27] :
      ( p(g(X3_28),X_25,X1_26,X2_27)
      | ~ p(X_25,X1_26,X2_27,X3_28) ),
    inference(resolution,[status(thm)],[c_34,c_2]) ).

tff(c_4,plain,
    ! [X_8,X1_7,X2_6,X3_5] :
      ( ~ p(X_8,X1_7,X2_6,X3_5)
      | p(X3_5,X2_6,X1_7,X_8) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_86,plain,
    ! [X3_33,X2_34,X1_35,X_36] :
      ( p(g(X3_33),X2_34,X1_35,X_36)
      | ~ p(X_36,X1_35,X2_34,X3_33) ),
    inference(resolution,[status(thm)],[c_34,c_4]) ).

tff(c_91,plain,
    ! [X_36,X3_33,X2_34,X1_35] :
      ( p(X_36,g(X3_33),X2_34,X1_35)
      | ~ p(X_36,X1_35,X2_34,X3_33) ),
    inference(resolution,[status(thm)],[c_86,c_2]) ).

tff(c_61,plain,
    ! [X_29,X1_30,X2_31,X3_32] :
      ( ~ p(X_29,X1_30,X2_31,X3_32)
      | p(f(X_29),X1_30,X2_31,X3_32) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_66,plain,
    ! [X3_32,X_29,X1_30,X2_31] :
      ( p(X3_32,f(X_29),X1_30,X2_31)
      | ~ p(X_29,X1_30,X2_31,X3_32) ),
    inference(resolution,[status(thm)],[c_61,c_2]) ).

tff(c_115,plain,
    ! [X3_45,X_46,X1_47,X2_48] :
      ( p(X3_45,f(X_46),X1_47,X2_48)
      | ~ p(X_46,X1_47,X2_48,X3_45) ),
    inference(resolution,[status(thm)],[c_61,c_2]) ).

tff(c_124,plain,
    ! [X2_48,X3_45,X_46,X1_47] :
      ( p(X2_48,X3_45,f(X_46),X1_47)
      | ~ p(X_46,X1_47,X2_48,X3_45) ),
    inference(resolution,[status(thm)],[c_115,c_2]) ).

tff(c_8,plain,
    ! [X_13,X1_14,X2_15,X3_16] :
      ( ~ p(X_13,X1_14,X2_15,X3_16)
      | p(f(X_13),X1_14,X2_15,X3_16) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_12,plain,
    ~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_96,plain,
    ~ p(g(d),f(g(c)),f(g(b)),f(g(a))),
    inference(resolution,[status(thm)],[c_8,c_12]) ).

tff(c_200,plain,
    ~ p(g(c),f(g(b)),f(g(a)),g(d)),
    inference(resolution,[status(thm)],[c_66,c_96]) ).

tff(c_225,plain,
    ~ p(g(a),g(d),g(c),f(g(b))),
    inference(resolution,[status(thm)],[c_124,c_200]) ).

tff(c_247,plain,
    ~ p(g(a),f(g(b)),g(c),d),
    inference(resolution,[status(thm)],[c_91,c_225]) ).

tff(c_261,plain,
    ~ p(g(b),g(c),d,g(a)),
    inference(resolution,[status(thm)],[c_66,c_247]) ).

tff(c_302,plain,
    ~ p(g(b),g(a),d,c),
    inference(resolution,[status(thm)],[c_91,c_261]) ).

tff(c_320,plain,
    ~ p(g(b),c,d,a),
    inference(resolution,[status(thm)],[c_91,c_302]) ).

tff(c_326,plain,
    ~ p(c,d,a,b),
    inference(resolution,[status(thm)],[c_39,c_320]) ).

tff(c_333,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_32,c_326]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN311-1 : TPTP v8.1.2. Released v1.2.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.13/0.35  % Computer : n001.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 17:42:40 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.99/1.81  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.16/1.82  
% 3.16/1.82  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.27/1.86  
% 3.27/1.86  Inference rules
% 3.27/1.86  ----------------------
% 3.27/1.86  #Ref     : 0
% 3.27/1.86  #Sup     : 84
% 3.27/1.86  #Fact    : 0
% 3.27/1.86  #Define  : 0
% 3.27/1.86  #Split   : 0
% 3.27/1.86  #Chain   : 0
% 3.27/1.86  #Close   : 0
% 3.27/1.86  
% 3.27/1.86  Ordering : KBO
% 3.27/1.86  
% 3.27/1.86  Simplification rules
% 3.27/1.86  ----------------------
% 3.27/1.86  #Subsume      : 7
% 3.27/1.86  #Demod        : 10
% 3.27/1.86  #Tautology    : 9
% 3.27/1.86  #SimpNegUnit  : 0
% 3.27/1.86  #BackRed      : 0
% 3.27/1.86  
% 3.27/1.86  #Partial instantiations: 0
% 3.27/1.86  #Strategies tried      : 1
% 3.27/1.86  
% 3.27/1.86  Timing (in seconds)
% 3.27/1.86  ----------------------
% 3.27/1.86  Preprocessing        : 0.40
% 3.27/1.86  Parsing              : 0.22
% 3.27/1.86  CNF conversion       : 0.02
% 3.27/1.86  Main loop            : 0.36
% 3.27/1.86  Inferencing          : 0.15
% 3.27/1.86  Reduction            : 0.08
% 3.27/1.86  Demodulation         : 0.06
% 3.27/1.86  BG Simplification    : 0.01
% 3.27/1.86  Subsumption          : 0.09
% 3.27/1.86  Abstraction          : 0.01
% 3.27/1.86  MUC search           : 0.00
% 3.27/1.86  Cooper               : 0.00
% 3.27/1.86  Total                : 0.82
% 3.27/1.86  Index Insertion      : 0.00
% 3.27/1.86  Index Deletion       : 0.00
% 3.27/1.86  Index Matching       : 0.00
% 3.27/1.86  BG Taut test         : 0.00
%------------------------------------------------------------------------------