↑ Up

Faust---1.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : PUZ008-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art10.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May  6 15:10:11 EDT 2009

% Result   : Unsatisfiable 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    7 (   5 unt;   0 def)
%            Number of atoms       :    9 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (   4 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(extra_cannibal_meal_on_east_bank,plain,
    ! [A,B,C,D] : achievable(west(A,B),C,east(m(s(D)),c(s(s(D))))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/PUZ/PUZ008-1.tptp',unknown),
    [] ).

cnf(161557592,plain,
    achievable(west(A,B),C,east(m(s(D)),c(s(s(D))))),
    inference(rewrite,[status(thm)],[extra_cannibal_meal_on_east_bank]),
    [] ).

fof(missionary_west_to_east,plain,
    ! [A,B,C,D] :
      ( ~ achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D)))
      | achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D))) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/PUZ/PUZ008-1.tptp',unknown),
    [] ).

cnf(161504448,plain,
    ( ~ achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D)))
    | achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D))) ),
    inference(rewrite,[status(thm)],[missionary_west_to_east]),
    [] ).

fof(prove_can_get_to_east_bank,plain,
    ! [A] : ~ achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/PUZ/PUZ008-1.tptp',unknown),
    [] ).

cnf(161573672,plain,
    ~ achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    inference(rewrite,[status(thm)],[prove_can_get_to_east_bank]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[161557592,161504448,161573672]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(extra_cannibal_meal_on_east_bank,plain,(achievable(west(A,B),C,east(m(s(D)),c(s(s(D)))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/PUZ/PUZ008-1.tptp',unknown),[]).
% 
% cnf(161557592,plain,(achievable(west(A,B),C,east(m(s(D)),c(s(s(D)))))),inference(rewrite,[status(thm)],[extra_cannibal_meal_on_east_bank]),[]).
% 
% fof(missionary_west_to_east,plain,(~achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/PUZ/PUZ008-1.tptp',unknown),[]).
% 
% cnf(161504448,plain,(~achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D)))),inference(rewrite,[status(thm)],[missionary_west_to_east]),[]).
% 
% fof(prove_can_get_to_east_bank,plain,(~achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0))))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/PUZ/PUZ008-1.tptp',unknown),[]).
% 
% cnf(161573672,plain,(~achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0))))))),inference(rewrite,[status(thm)],[prove_can_get_to_east_bank]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[161557592,161504448,161573672]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------