↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : PUZ047+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:23:13 AM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (  10 unt;   0 def)
%            Number of atoms       :   82 (   0 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :   76 (  12   ~;   6   |;  28   &)
%                                         (   0 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            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   :   53 (   5 sgn  36   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thm100,conjecture,
    ( ( ! [V1] :
          ( p(north,south,north,north,V1)
         => p(south,south,north,south,take_cabbage(V1)) )
      & ! [U1] :
          ( p(south,south,north,south,U1)
         => p(north,south,north,north,take_cabbage(U1)) )
      & ! [T9] :
          ( p(north,north,south,north,T9)
         => p(south,north,south,south,take_cabbage(T9)) )
      & ! [T8] :
          ( p(south,north,south,south,T8)
         => p(north,north,south,north,take_cabbage(T8)) )
      & ! [X1,Y1,V] :
          ( p(north,X1,north,Y1,V)
         => p(south,X1,south,Y1,take_goat(V)) )
      & ! [X,Y,U] :
          ( p(south,X,south,Y,U)
         => p(north,X,north,Y,take_goat(U)) )
      & ! [T7] :
          ( p(north,north,north,south,T7)
         => p(south,south,north,south,take_wolf(T7)) )
      & ! [T6] :
          ( p(south,south,north,south,T6)
         => p(north,north,north,south,take_wolf(T6)) )
      & ! [T5] :
          ( p(north,north,south,north,T5)
         => p(south,south,south,north,take_wolf(T5)) )
      & ! [T4] :
          ( p(south,south,south,north,T4)
         => p(north,north,south,north,take_wolf(T4)) )
      & ! [T3] :
          ( p(north,south,north,south,T3)
         => p(south,south,north,south,go_alone(T3)) )
      & ! [T2] :
          ( p(south,south,north,south,T2)
         => p(north,south,north,south,go_alone(T2)) )
      & ! [T1] :
          ( p(north,north,south,north,T1)
         => p(south,north,south,north,go_alone(T1)) )
      & ! [T] :
          ( p(south,north,south,north,T)
         => p(north,north,south,north,go_alone(T)) )
      & p(south,south,south,south,start) )
   => ? [Z] : p(north,north,north,north,Z) ),
    file('theBenchmark.p',thm100) ).

fof(thm100_neg,negated_conjecture,
    ~ ( ( ! [V1] :
            ( p(north,south,north,north,V1)
           => p(south,south,north,south,take_cabbage(V1)) )
        & ! [U1] :
            ( p(south,south,north,south,U1)
           => p(north,south,north,north,take_cabbage(U1)) )
        & ! [T9] :
            ( p(north,north,south,north,T9)
           => p(south,north,south,south,take_cabbage(T9)) )
        & ! [T8] :
            ( p(south,north,south,south,T8)
           => p(north,north,south,north,take_cabbage(T8)) )
        & ! [X1,Y1,V] :
            ( p(north,X1,north,Y1,V)
           => p(south,X1,south,Y1,take_goat(V)) )
        & ! [X,Y,U] :
            ( p(south,X,south,Y,U)
           => p(north,X,north,Y,take_goat(U)) )
        & ! [T7] :
            ( p(north,north,north,south,T7)
           => p(south,south,north,south,take_wolf(T7)) )
        & ! [T6] :
            ( p(south,south,north,south,T6)
           => p(north,north,north,south,take_wolf(T6)) )
        & ! [T5] :
            ( p(north,north,south,north,T5)
           => p(south,south,south,north,take_wolf(T5)) )
        & ! [T4] :
            ( p(south,south,south,north,T4)
           => p(north,north,south,north,take_wolf(T4)) )
        & ! [T3] :
            ( p(north,south,north,south,T3)
           => p(south,south,north,south,go_alone(T3)) )
        & ! [T2] :
            ( p(south,south,north,south,T2)
           => p(north,south,north,south,go_alone(T2)) )
        & ! [T1] :
            ( p(north,north,south,north,T1)
           => p(south,north,south,north,go_alone(T1)) )
        & ! [T] :
            ( p(south,north,south,north,T)
           => p(north,north,south,north,go_alone(T)) )
        & p(south,south,south,south,start) )
     => ? [Z] : p(north,north,north,north,Z) ),
    inference(assume_negation,[status(cth)],[thm100]) ).

cnf(c_2,negated_conjecture,
    p(south,south,south,south,start),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_4,negated_conjecture,
    ( p(south,north,south,north,go_alone(A))
    | ~ p(north,north,south,north,A) ),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_6,negated_conjecture,
    ( p(south,south,north,south,go_alone(A))
    | ~ p(north,south,north,south,A) ),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_7,negated_conjecture,
    ( p(north,north,south,north,take_wolf(A))
    | ~ p(south,south,south,north,A) ),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_11,negated_conjecture,
    ( p(north,A,north,B,take_goat(C))
    | ~ p(south,A,south,B,C) ),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_12,negated_conjecture,
    ( p(south,A,south,B,take_goat(C))
    | ~ p(north,A,north,B,C) ),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_15,negated_conjecture,
    ( p(north,south,north,north,take_cabbage(A))
    | ~ p(south,south,north,south,A) ),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_17,negated_conjecture,
    ~ p(north,north,north,north,A),
    inference(clausify,[status(thm)],[thm100_neg]) ).

cnf(c_18,negated_conjecture,
    p(north,south,north,south,take_goat(start)),
    inference(resolve,[status(thm)],[c_11,c_2]) ).

cnf(c_19,plain,
    ~ p(south,north,south,north,A),
    inference(resolve,[status(thm)],[c_17,c_11]) ).

cnf(c_21,negated_conjecture,
    p(south,south,north,south,go_alone(take_goat(start))),
    inference(resolve,[status(thm)],[c_6,c_18]) ).

cnf(c_22,plain,
    ~ p(north,north,south,north,A),
    inference(resolve,[status(thm)],[c_19,c_4]) ).

cnf(c_24,plain,
    ~ p(south,south,south,north,A),
    inference(resolve,[status(thm)],[c_22,c_7]) ).

cnf(c_26,plain,
    ~ p(north,south,north,north,A),
    inference(resolve,[status(thm)],[c_24,c_12]) ).

cnf(c_28,negated_conjecture,
    p(north,south,north,north,take_cabbage(go_alone(take_goat(start)))),
    inference(resolve,[status(thm)],[c_15,c_21]) ).

cnf(c_29,plain,
    $false,
    inference(resolve,[status(thm)],[c_28,c_26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ047+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n002.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 05:10:20 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 887672 was started by sandbox on n002,
% 0.09/0.37  % Sat Sep 26 05:10:20 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.09/0.39  
% 0.09/0.39  % SZS status Theorem for theBenchmark
% 0.09/0.39  
% 0.09/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39  % Length of proof is 17.
% 0.09/0.39  % Level of proof is 6.
% 0.09/0.39  % Maximum clause weight is 13.000.
% 0.09/0.39  % Given clauses 23.
% 0.09/0.39  
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------