TSTP Solution File: NUM291+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : NUM291+1 : TPTP v3.4.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art01.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:27 EDT 2009
% Result : Theorem 0.5s
% Output : Refutation 0.5s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 13 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(rdn_positive_less23,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),
[] ).
cnf(162824896,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(rewrite,[status(thm)],[rdn_positive_less23]),
[] ).
fof(less_entry_point_pos_pos,plain,
! [A,C,B,D] :
( ~ rdn_translate(A,rdn_pos(C))
| ~ rdn_translate(B,rdn_pos(D))
| ~ rdn_positive_less(C,D)
| less(A,B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),
[] ).
cnf(163152096,plain,
( ~ rdn_translate(A,rdn_pos(C))
| ~ rdn_translate(B,rdn_pos(D))
| ~ rdn_positive_less(C,D)
| less(A,B) ),
inference(rewrite,[status(thm)],[less_entry_point_pos_pos]),
[] ).
fof(rdn2,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),
[] ).
cnf(158322264,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(rewrite,[status(thm)],[rdn2]),
[] ).
cnf(182659184,plain,
( ~ rdn_translate(A,rdn_pos(B))
| ~ rdn_positive_less(rdnn(n2),B)
| less(n2,A) ),
inference(resolution,[status(thm)],[163152096,158322264]),
[] ).
fof(rdn3,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),
[] ).
cnf(158346536,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(rewrite,[status(thm)],[rdn3]),
[] ).
cnf(182822808,plain,
less(n2,n3),
inference(forward_subsumption_resolution__resolution,[status(thm)],[162824896,182659184,158346536]),
[] ).
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/NUM291+1.tptp',unknown),
[] ).
cnf(163255152,plain,
( ~ less(B,A)
| ~ less(A,B) ),
inference(rewrite,[status(thm)],[less_property]),
[] ).
fof(n3_not_less_n2,plain,
less(n3,n2),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),
[] ).
cnf(165086104,plain,
less(n3,n2),
inference(rewrite,[status(thm)],[n3_not_less_n2]),
[] ).
cnf(174402104,plain,
~ less(n2,n3),
inference(resolution,[status(thm)],[163255152,165086104]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[182822808,174402104]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(rdn_positive_less23,plain,(rdn_positive_less(rdnn(n2),rdnn(n3))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),[]).
%
% cnf(162824896,plain,(rdn_positive_less(rdnn(n2),rdnn(n3))),inference(rewrite,[status(thm)],[rdn_positive_less23]),[]).
%
% fof(less_entry_point_pos_pos,plain,(~rdn_translate(A,rdn_pos(C))|~rdn_translate(B,rdn_pos(D))|~rdn_positive_less(C,D)|less(A,B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),[]).
%
% cnf(163152096,plain,(~rdn_translate(A,rdn_pos(C))|~rdn_translate(B,rdn_pos(D))|~rdn_positive_less(C,D)|less(A,B)),inference(rewrite,[status(thm)],[less_entry_point_pos_pos]),[]).
%
% fof(rdn2,plain,(rdn_translate(n2,rdn_pos(rdnn(n2)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),[]).
%
% cnf(158322264,plain,(rdn_translate(n2,rdn_pos(rdnn(n2)))),inference(rewrite,[status(thm)],[rdn2]),[]).
%
% cnf(182659184,plain,(~rdn_translate(A,rdn_pos(B))|~rdn_positive_less(rdnn(n2),B)|less(n2,A)),inference(resolution,[status(thm)],[163152096,158322264]),[]).
%
% fof(rdn3,plain,(rdn_translate(n3,rdn_pos(rdnn(n3)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),[]).
%
% cnf(158346536,plain,(rdn_translate(n3,rdn_pos(rdnn(n3)))),inference(rewrite,[status(thm)],[rdn3]),[]).
%
% cnf(182822808,plain,(less(n2,n3)),inference(forward_subsumption_resolution__resolution,[status(thm)],[162824896,182659184,158346536]),[]).
%
% 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/NUM291+1.tptp',unknown),[]).
%
% cnf(163255152,plain,(~less(B,A)|~less(A,B)),inference(rewrite,[status(thm)],[less_property]),[]).
%
% fof(n3_not_less_n2,plain,(less(n3,n2)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM291+1.tptp',unknown),[]).
%
% cnf(165086104,plain,(less(n3,n2)),inference(rewrite,[status(thm)],[n3_not_less_n2]),[]).
%
% cnf(174402104,plain,(~less(n2,n3)),inference(resolution,[status(thm)],[163255152,165086104]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[182822808,174402104]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------