↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art07.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 14:52:39 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(less_property,plain,
    ! [A,B] :
      ( ( ~ $equal(A,B)
        | ~ less(A,B) )
      & ( ~ less(B,A)
        | ~ less(A,B) )
      & ( less(A,B)
        | less(B,A)
        | $equal(A,B) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM343+1.tptp',unknown),
    [] ).

cnf(168060200,plain,
    ( ~ less(B,A)
    | ~ less(A,B) ),
    inference(rewrite,[status(thm)],[less_property]),
    [] ).

fof(sum_something_n0_samething,plain,
    ! [A] :
      ( less(nn1,A)
      & less(A,n1)
      & ~ sum(n21,A,n21) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM343+1.tptp',unknown),
    [] ).

cnf(163058264,plain,
    less(A,n1),
    inference(rewrite,[status(thm)],[sum_something_n0_samething]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[168060200,163058264]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(less_property,plain,(((~$equal(A,B)|~less(A,B))&(~less(B,A)|~less(A,B))&(less(A,B)|less(B,A)|$equal(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM343+1.tptp',unknown),[]).
% 
% cnf(168060200,plain,(~less(B,A)|~less(A,B)),inference(rewrite,[status(thm)],[less_property]),[]).
% 
% fof(sum_something_n0_samething,plain,((less(nn1,A)&less(A,n1)&~sum(n21,A,n21))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM343+1.tptp',unknown),[]).
% 
% cnf(163058264,plain,(less(A,n1)),inference(rewrite,[status(thm)],[sum_something_n0_samething]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[168060200,163058264]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------