↑ Up

Faust---1.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SYN233-1 : TPTP v3.4.2. Released v1.1.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 17:18:40 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(axiom_13,plain,
    r0(e),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),
    [] ).

cnf(153279768,plain,
    r0(e),
    inference(rewrite,[status(thm)],[axiom_13]),
    [] ).

fof(rule_215,plain,
    ! [A,B] :
      ( l3(A,B)
      | ~ r0(A)
      | ~ p2(A,B,A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),
    [] ).

cnf(155946048,plain,
    ( l3(A,B)
    | ~ r0(A)
    | ~ p2(A,B,A) ),
    inference(rewrite,[status(thm)],[rule_215]),
    [] ).

fof(rule_159,plain,
    ! [A] :
      ( p2(A,A,A)
      | ~ k1(A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),
    [] ).

cnf(155194816,plain,
    ( p2(A,A,A)
    | ~ k1(A) ),
    inference(rewrite,[status(thm)],[rule_159]),
    [] ).

fof(rule_001,plain,
    ! [A,B] :
      ( k1(A)
      | ~ n0(B,A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),
    [] ).

cnf(153403824,plain,
    ( k1(A)
    | ~ n0(B,A) ),
    inference(rewrite,[status(thm)],[rule_001]),
    [] ).

fof(axiom_3,plain,
    n0(d,e),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),
    [] ).

cnf(153213984,plain,
    n0(d,e),
    inference(rewrite,[status(thm)],[axiom_3]),
    [] ).

cnf(166745064,plain,
    k1(e),
    inference(resolution,[status(thm)],[153403824,153213984]),
    [] ).

cnf(166870312,plain,
    p2(e,e,e),
    inference(resolution,[status(thm)],[155194816,166745064]),
    [] ).

cnf(169851648,plain,
    l3(e,e),
    inference(forward_subsumption_resolution__resolution,[status(thm)],[153279768,155946048,166870312]),
    [] ).

fof(prove_this,plain,
    ! [A] : ~ l3(e,A),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),
    [] ).

cnf(157579112,plain,
    ~ l3(e,A),
    inference(rewrite,[status(thm)],[prove_this]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[169851648,157579112]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(axiom_13,plain,(r0(e)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),[]).
% 
% cnf(153279768,plain,(r0(e)),inference(rewrite,[status(thm)],[axiom_13]),[]).
% 
% fof(rule_215,plain,(l3(A,B)|~r0(A)|~p2(A,B,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),[]).
% 
% cnf(155946048,plain,(l3(A,B)|~r0(A)|~p2(A,B,A)),inference(rewrite,[status(thm)],[rule_215]),[]).
% 
% fof(rule_159,plain,(p2(A,A,A)|~k1(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),[]).
% 
% cnf(155194816,plain,(p2(A,A,A)|~k1(A)),inference(rewrite,[status(thm)],[rule_159]),[]).
% 
% fof(rule_001,plain,(k1(A)|~n0(B,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),[]).
% 
% cnf(153403824,plain,(k1(A)|~n0(B,A)),inference(rewrite,[status(thm)],[rule_001]),[]).
% 
% fof(axiom_3,plain,(n0(d,e)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),[]).
% 
% cnf(153213984,plain,(n0(d,e)),inference(rewrite,[status(thm)],[axiom_3]),[]).
% 
% cnf(166745064,plain,(k1(e)),inference(resolution,[status(thm)],[153403824,153213984]),[]).
% 
% cnf(166870312,plain,(p2(e,e,e)),inference(resolution,[status(thm)],[155194816,166745064]),[]).
% 
% cnf(169851648,plain,(l3(e,e)),inference(forward_subsumption_resolution__resolution,[status(thm)],[153279768,155946048,166870312]),[]).
% 
% fof(prove_this,plain,(~l3(e,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN233-1.tptp',unknown),[]).
% 
% cnf(157579112,plain,(~l3(e,A)),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[169851648,157579112]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------