TSTP Solution File: NUM302+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : NUM302+1 : TPTP v3.4.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art04.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:51:47 EDT 2009
% Result : Theorem 0.3s
% Output : Refutation 0.3s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 12 ( 4 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(nn2_less_something,plain,
! [A] : ~ less(nn2,A),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),
[] ).
cnf(166752456,plain,
~ less(nn2,A),
inference(rewrite,[status(thm)],[nn2_less_something]),
[] ).
fof(less_entry_point_neg_pos,plain,
! [A,C,B,D] :
( ~ rdn_translate(A,rdn_neg(C))
| ~ rdn_translate(B,rdn_pos(D))
| less(A,B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),
[] ).
cnf(164842440,plain,
( ~ rdn_translate(A,rdn_neg(C))
| ~ rdn_translate(B,rdn_pos(D))
| less(A,B) ),
inference(rewrite,[status(thm)],[less_entry_point_neg_pos]),
[] ).
fof(rdn6,plain,
rdn_translate(n6,rdn_pos(rdnn(n6))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),
[] ).
cnf(160036048,plain,
rdn_translate(n6,rdn_pos(rdnn(n6))),
inference(rewrite,[status(thm)],[rdn6]),
[] ).
cnf(180169720,plain,
( ~ rdn_translate(A,rdn_neg(B))
| less(A,n6) ),
inference(resolution,[status(thm)],[164842440,160036048]),
[] ).
fof(rdnn2,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),
[] ).
cnf(162420376,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(rewrite,[status(thm)],[rdnn2]),
[] ).
cnf(181414224,plain,
less(nn2,n6),
inference(resolution,[status(thm)],[180169720,162420376]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[166752456,181414224]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(nn2_less_something,plain,(~less(nn2,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),[]).
%
% cnf(166752456,plain,(~less(nn2,A)),inference(rewrite,[status(thm)],[nn2_less_something]),[]).
%
% fof(less_entry_point_neg_pos,plain,(~rdn_translate(A,rdn_neg(C))|~rdn_translate(B,rdn_pos(D))|less(A,B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),[]).
%
% cnf(164842440,plain,(~rdn_translate(A,rdn_neg(C))|~rdn_translate(B,rdn_pos(D))|less(A,B)),inference(rewrite,[status(thm)],[less_entry_point_neg_pos]),[]).
%
% fof(rdn6,plain,(rdn_translate(n6,rdn_pos(rdnn(n6)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),[]).
%
% cnf(160036048,plain,(rdn_translate(n6,rdn_pos(rdnn(n6)))),inference(rewrite,[status(thm)],[rdn6]),[]).
%
% cnf(180169720,plain,(~rdn_translate(A,rdn_neg(B))|less(A,n6)),inference(resolution,[status(thm)],[164842440,160036048]),[]).
%
% fof(rdnn2,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM302+1.tptp',unknown),[]).
%
% cnf(162420376,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),inference(rewrite,[status(thm)],[rdnn2]),[]).
%
% cnf(181414224,plain,(less(nn2,n6)),inference(resolution,[status(thm)],[180169720,162420376]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[166752456,181414224]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------