TSTP Solution File: NUM298+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : NUM298+1 : TPTP v3.4.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art09.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:39 EDT 2009
% Result : Theorem 0.5s
% Output : Refutation 0.5s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 10 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 14 ( 3 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
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/NUM298+1.tptp',unknown),
[] ).
cnf(153603072,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(rdn2,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM298+1.tptp',unknown),
[] ).
cnf(148733528,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(rewrite,[status(thm)],[rdn2]),
[] ).
cnf(166675176,plain,
( ~ rdn_translate(A,rdn_neg(B))
| less(A,n2) ),
inference(resolution,[status(thm)],[153603072,148733528]),
[] ).
fof(rdnn2,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM298+1.tptp',unknown),
[] ).
cnf(151194024,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(rewrite,[status(thm)],[rdnn2]),
[] ).
cnf(173106496,plain,
less(nn2,n2),
inference(resolution,[status(thm)],[166675176,151194024]),
[] ).
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/NUM298+1.tptp',unknown),
[] ).
cnf(153666416,plain,
( ~ less(B,A)
| ~ less(A,B) ),
inference(rewrite,[status(thm)],[less_property]),
[] ).
fof(n2_not_less_nn2,plain,
less(n2,nn2),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM298+1.tptp',unknown),
[] ).
cnf(155497368,plain,
less(n2,nn2),
inference(rewrite,[status(thm)],[n2_not_less_nn2]),
[] ).
cnf(164760720,plain,
~ less(nn2,n2),
inference(resolution,[status(thm)],[153666416,155497368]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[173106496,164760720]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% 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/NUM298+1.tptp',unknown),[]).
%
% cnf(153603072,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(rdn2,plain,(rdn_translate(n2,rdn_pos(rdnn(n2)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM298+1.tptp',unknown),[]).
%
% cnf(148733528,plain,(rdn_translate(n2,rdn_pos(rdnn(n2)))),inference(rewrite,[status(thm)],[rdn2]),[]).
%
% cnf(166675176,plain,(~rdn_translate(A,rdn_neg(B))|less(A,n2)),inference(resolution,[status(thm)],[153603072,148733528]),[]).
%
% fof(rdnn2,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM298+1.tptp',unknown),[]).
%
% cnf(151194024,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),inference(rewrite,[status(thm)],[rdnn2]),[]).
%
% cnf(173106496,plain,(less(nn2,n2)),inference(resolution,[status(thm)],[166675176,151194024]),[]).
%
% 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/NUM298+1.tptp',unknown),[]).
%
% cnf(153666416,plain,(~less(B,A)|~less(A,B)),inference(rewrite,[status(thm)],[less_property]),[]).
%
% fof(n2_not_less_nn2,plain,(less(n2,nn2)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM298+1.tptp',unknown),[]).
%
% cnf(155497368,plain,(less(n2,nn2)),inference(rewrite,[status(thm)],[n2_not_less_nn2]),[]).
%
% cnf(164760720,plain,(~less(nn2,n2)),inference(resolution,[status(thm)],[153666416,155497368]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[173106496,164760720]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------