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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PUZ047+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 : n003.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:07 EDT 2023

% Result   : Theorem 2.90s 1.70s
% Output   : CNFRefutation 3.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   26 (  10 unt;   8 typ;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :   30 (   3 avg)
%            Number of connectives :   52 (  16   ~;   7   |;  14   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   5   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-5 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-1 aty)
%            Number of variables   :   40 (;  39   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > take_wolf > take_goat > take_cabbage > go_alone > start > south > north

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_99,negated_conjecture,
    ~ ( ( p(south,south,south,south,start)
        & ! [T] :
            ( p(south,north,south,north,T)
           => p(north,north,south,north,go_alone(T)) )
        & ! [T1] :
            ( p(north,north,south,north,T1)
           => p(south,north,south,north,go_alone(T1)) )
        & ! [T2] :
            ( p(south,south,north,south,T2)
           => p(north,south,north,south,go_alone(T2)) )
        & ! [T3] :
            ( p(north,south,north,south,T3)
           => p(south,south,north,south,go_alone(T3)) )
        & ! [T4] :
            ( p(south,south,south,north,T4)
           => p(north,north,south,north,take_wolf(T4)) )
        & ! [T5] :
            ( p(north,north,south,north,T5)
           => p(south,south,south,north,take_wolf(T5)) )
        & ! [T6] :
            ( p(south,south,north,south,T6)
           => p(north,north,north,south,take_wolf(T6)) )
        & ! [T7] :
            ( p(north,north,north,south,T7)
           => p(south,south,north,south,take_wolf(T7)) )
        & ! [X,Y,U] :
            ( p(south,X,south,Y,U)
           => p(north,X,north,Y,take_goat(U)) )
        & ! [X1,Y1,V] :
            ( p(north,X1,north,Y1,V)
           => p(south,X1,south,Y1,take_goat(V)) )
        & ! [T8] :
            ( p(south,north,south,south,T8)
           => p(north,north,south,north,take_cabbage(T8)) )
        & ! [T9] :
            ( p(north,north,south,north,T9)
           => p(south,north,south,south,take_cabbage(T9)) )
        & ! [U1] :
            ( p(south,south,north,south,U1)
           => p(north,south,north,north,take_cabbage(U1)) )
        & ! [V1] :
            ( p(north,south,north,north,V1)
           => p(south,south,north,south,take_cabbage(V1)) ) )
     => ? [Z] : p(north,north,north,north,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100) ).

tff(c_14,plain,
    ! [X_9,Y_10,U_11] :
      ( p(north,X_9,north,Y_10,take_goat(U_11))
      | ~ p(south,X_9,south,Y_10,U_11) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_12,plain,
    ! [X1_12,Y1_13,V_14] :
      ( p(south,X1_12,south,Y1_13,take_goat(V_14))
      | ~ p(north,X1_12,north,Y1_13,V_14) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_40,plain,
    ! [X_29,Y_30,U_31] :
      ( p(north,X_29,north,Y_30,take_goat(U_31))
      | ~ p(south,X_29,south,Y_30,U_31) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_2,plain,
    ! [Z_19] : ~ p(north,north,north,north,Z_19),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_45,plain,
    ! [U_31] : ~ p(south,north,south,north,U_31),
    inference(resolution,[status(thm)],[c_40,c_2]) ).

tff(c_28,plain,
    ! [T1_2] :
      ( p(south,north,south,north,go_alone(T1_2))
      | ~ p(north,north,south,north,T1_2) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_53,plain,
    ! [T1_2] : ~ p(north,north,south,north,T1_2),
    inference(negUnitSimplification,[status(thm)],[c_45,c_28]) ).

tff(c_10,plain,
    ! [T8_15] :
      ( p(north,north,south,north,take_cabbage(T8_15))
      | ~ p(south,north,south,south,T8_15) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_56,plain,
    ! [T8_35] : ~ p(south,north,south,south,T8_35),
    inference(negUnitSimplification,[status(thm)],[c_53,c_10]) ).

tff(c_61,plain,
    ! [V_14] : ~ p(north,north,north,south,V_14),
    inference(resolution,[status(thm)],[c_12,c_56]) ).

tff(c_18,plain,
    ! [T6_7] :
      ( p(north,north,north,south,take_wolf(T6_7))
      | ~ p(south,south,north,south,T6_7) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_62,plain,
    ! [T6_7] : ~ p(south,south,north,south,T6_7),
    inference(negUnitSimplification,[status(thm)],[c_61,c_18]) ).

tff(c_24,plain,
    ! [T3_4] :
      ( p(south,south,north,south,go_alone(T3_4))
      | ~ p(north,south,north,south,T3_4) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_72,plain,
    ! [T3_38] : ~ p(north,south,north,south,T3_38),
    inference(negUnitSimplification,[status(thm)],[c_62,c_24]) ).

tff(c_77,plain,
    ! [U_11] : ~ p(south,south,south,south,U_11),
    inference(resolution,[status(thm)],[c_14,c_72]) ).

tff(c_32,plain,
    p(south,south,south,south,start),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_85,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_77,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : PUZ047+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.14/0.36  % Computer : n003.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 17:39:53 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.90/1.70  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.13/1.71  
% 3.13/1.71  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.13/1.74  
% 3.13/1.74  Inference rules
% 3.13/1.74  ----------------------
% 3.13/1.74  #Ref     : 0
% 3.13/1.74  #Sup     : 6
% 3.13/1.74  #Fact    : 0
% 3.13/1.74  #Define  : 0
% 3.13/1.74  #Split   : 0
% 3.13/1.74  #Chain   : 0
% 3.13/1.74  #Close   : 0
% 3.13/1.74  
% 3.13/1.74  Ordering : KBO
% 3.13/1.74  
% 3.13/1.74  Simplification rules
% 3.13/1.74  ----------------------
% 3.13/1.74  #Subsume      : 4
% 3.13/1.75  #Demod        : 0
% 3.13/1.75  #Tautology    : 0
% 3.13/1.75  #SimpNegUnit  : 6
% 3.13/1.75  #BackRed      : 5
% 3.13/1.75  
% 3.13/1.75  #Partial instantiations: 0
% 3.13/1.75  #Strategies tried      : 1
% 3.13/1.75  
% 3.13/1.75  Timing (in seconds)
% 3.13/1.75  ----------------------
% 3.13/1.75  Preprocessing        : 0.47
% 3.13/1.75  Parsing              : 0.27
% 3.13/1.75  CNF conversion       : 0.03
% 3.13/1.75  Main loop            : 0.21
% 3.13/1.75  Inferencing          : 0.08
% 3.13/1.75  Reduction            : 0.05
% 3.13/1.75  Demodulation         : 0.03
% 3.13/1.75  BG Simplification    : 0.02
% 3.13/1.75  Subsumption          : 0.06
% 3.13/1.75  Abstraction          : 0.01
% 3.13/1.75  MUC search           : 0.00
% 3.13/1.75  Cooper               : 0.00
% 3.13/1.75  Total                : 0.74
% 3.13/1.75  Index Insertion      : 0.00
% 3.13/1.75  Index Deletion       : 0.00
% 3.13/1.75  Index Matching       : 0.00
% 3.13/1.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------