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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PUZ038-1 : TPTP v8.1.2. Released v2.4.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 : n026.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 10:54:06 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ state > v4 > v3 > v2 > v1 > s4 > s3 > s2 > s1 > h > e2 > e1 > bb > #nlpp > s > o

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(h,type,
    h: ( $i * $i ) > $i ).

tff(v1,type,
    v1: ( $i * $i ) > $i ).

tff(s2,type,
    s2: ( $i * $i ) > $i ).

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

tff(s3,type,
    s3: ( $i * $i ) > $i ).

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

tff(s4,type,
    s4: ( $i * $i ) > $i ).

tff(s1,type,
    s1: ( $i * $i ) > $i ).

tff(v3,type,
    v3: ( $i * $i ) > $i ).

tff(bb,type,
    bb: ( $i * $i ) > $i ).

tff(v2,type,
    v2: ( $i * $i ) > $i ).

tff(v4,type,
    v4: ( $i * $i ) > $i ).

tff(e1,type,
    e1: ( $i * $i ) > $i ).

tff(e2,type,
    e2: ( $i * $i ) > $i ).

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

tff(f_259,axiom,
    ! [E2,S1,H,E1,B,S4,S3,V1,V2,V4,S2] : ~ state(B,V1,V2,v3(s(s(s(o))),o),V4,H,S1,S2,S3,S4,E1,E2),
    file(unknown,unknown) ).

tff(f_256,axiom,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    file(unknown,unknown) ).

tff(f_183,axiom,
    ! [E2,S1,H,B,S4,S3,V1,X,Y,V2,V4,S2] :
      ( ~ state(B,V1,V2,v3(X,Y),V4,H,S1,S2,S3,S4,e1(s(s(X)),Y),E2)
      | state(B,V1,V2,v3(s(X),Y),V4,H,S1,S2,S3,S4,e1(X,Y),E2) ),
    file(unknown,unknown) ).

tff(c_86,plain,
    ! [V2_489,H_483,S3_487,E1_484,V1_488,E2_481,S1_482,S4_486,B_485,V4_490,S2_491] : ~ state(B_485,V1_488,V2_489,v3(s(s(s(o))),o),V4_490,H_483,S1_482,S2_491,S3_487,S4_486,E1_484,E2_481),
    inference(cnfTransformation,[status(thm)],[f_259]) ).

tff(c_84,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(cnfTransformation,[status(thm)],[f_256]) ).

tff(c_54,plain,
    ! [S2_318,H_309,S4_311,V4_317,X_314,S1_308,Y_315,B_310,S3_312,V2_316,V1_313,E2_307] :
      ( state(B_310,V1_313,V2_316,v3(s(X_314),Y_315),V4_317,H_309,S1_308,S2_318,S3_312,S4_311,e1(X_314,Y_315),E2_307)
      | ~ state(B_310,V1_313,V2_316,v3(X_314,Y_315),V4_317,H_309,S1_308,S2_318,S3_312,S4_311,e1(s(s(X_314)),Y_315),E2_307) ),
    inference(cnfTransformation,[status(thm)],[f_183]) ).

tff(c_5141,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(resolution,[status(thm)],[c_84,c_54]) ).

tff(c_5150,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_86,c_5141]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : PUZ038-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % 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.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 17:54:17 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 7.54/2.81  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.54/2.81  
% 7.54/2.81  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.54/2.85  
% 7.54/2.85  Inference rules
% 7.54/2.85  ----------------------
% 7.54/2.85  #Ref     : 0
% 7.54/2.85  #Sup     : 1001
% 7.54/2.85  #Fact    : 0
% 7.54/2.85  #Define  : 0
% 7.54/2.85  #Split   : 0
% 7.54/2.85  #Chain   : 0
% 7.54/2.85  #Close   : 0
% 7.54/2.85  
% 7.54/2.85  Ordering : KBO
% 7.54/2.85  
% 7.54/2.85  Simplification rules
% 7.54/2.85  ----------------------
% 7.54/2.85  #Subsume      : 214
% 7.54/2.85  #Demod        : 0
% 7.54/2.85  #Tautology    : 20
% 7.54/2.85  #SimpNegUnit  : 1
% 7.54/2.85  #BackRed      : 0
% 7.54/2.85  
% 7.54/2.85  #Partial instantiations: 0
% 7.54/2.85  #Strategies tried      : 1
% 7.54/2.85  
% 7.54/2.85  Timing (in seconds)
% 7.54/2.85  ----------------------
% 7.54/2.85  Preprocessing        : 0.69
% 7.54/2.85  Parsing              : 0.41
% 7.54/2.85  CNF conversion       : 0.04
% 7.54/2.85  Main loop            : 1.09
% 7.54/2.85  Inferencing          : 0.53
% 7.54/2.85  Reduction            : 0.16
% 7.54/2.86  Demodulation         : 0.08
% 7.54/2.86  BG Simplification    : 0.05
% 7.54/2.86  Subsumption          : 0.29
% 7.54/2.86  Abstraction          : 0.04
% 7.54/2.86  MUC search           : 0.00
% 7.54/2.86  Cooper               : 0.00
% 7.54/2.86  Total                : 1.84
% 7.54/2.86  Index Insertion      : 0.00
% 7.54/2.86  Index Deletion       : 0.00
% 7.54/2.86  Index Matching       : 0.00
% 7.54/2.86  BG Taut test         : 0.00
%------------------------------------------------------------------------------