TSTP Solution File: NUM300+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : NUM300+1 : TPTP v3.4.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art05.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:43 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 : 13 ( 8 ~; 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 : 14 ( 6 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(rdnn1,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM300+1.tptp',unknown),
[] ).
cnf(161802880,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
inference(rewrite,[status(thm)],[rdnn1]),
[] ).
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/NUM300+1.tptp',unknown),
[] ).
cnf(164237872,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(rdn0,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM300+1.tptp',unknown),
[] ).
cnf(159301856,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(rewrite,[status(thm)],[rdn0]),
[] ).
cnf(176922712,plain,
( ~ rdn_translate(A,rdn_neg(B))
| less(A,n0) ),
inference(resolution,[status(thm)],[164237872,159301856]),
[] ).
fof(something_less_n0,plain,
! [A] : ~ less(A,n0),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM300+1.tptp',unknown),
[] ).
cnf(166147888,plain,
~ less(A,n0),
inference(rewrite,[status(thm)],[something_less_n0]),
[] ).
cnf(176944272,plain,
~ rdn_translate(A,rdn_neg(B)),
inference(resolution,[status(thm)],[176922712,166147888]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[161802880,176944272]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(rdnn1,plain,(rdn_translate(nn1,rdn_neg(rdnn(n1)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM300+1.tptp',unknown),[]).
%
% cnf(161802880,plain,(rdn_translate(nn1,rdn_neg(rdnn(n1)))),inference(rewrite,[status(thm)],[rdnn1]),[]).
%
% 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/NUM300+1.tptp',unknown),[]).
%
% cnf(164237872,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(rdn0,plain,(rdn_translate(n0,rdn_pos(rdnn(n0)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM300+1.tptp',unknown),[]).
%
% cnf(159301856,plain,(rdn_translate(n0,rdn_pos(rdnn(n0)))),inference(rewrite,[status(thm)],[rdn0]),[]).
%
% cnf(176922712,plain,(~rdn_translate(A,rdn_neg(B))|less(A,n0)),inference(resolution,[status(thm)],[164237872,159301856]),[]).
%
% fof(something_less_n0,plain,(~less(A,n0)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM300+1.tptp',unknown),[]).
%
% cnf(166147888,plain,(~less(A,n0)),inference(rewrite,[status(thm)],[something_less_n0]),[]).
%
% cnf(176944272,plain,(~rdn_translate(A,rdn_neg(B))),inference(resolution,[status(thm)],[176922712,166147888]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[161802880,176944272]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------