%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET117-7 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art06.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 15:28:50 EDT 2009
% Result : Unsatisfiable 0.6s
% Output : Refutation 0.6s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of formulae : 7 ( 7 unt; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 2 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(ordered_pair_is_set,plain,
! [A,B] : member(ordered_pair(A,B),universal_class),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET117-7.tptp',unknown),
[] ).
cnf(166908104,plain,
member(ordered_pair(A,B),universal_class),
inference(rewrite,[status(thm)],[ordered_pair_is_set]),
[] ).
fof(prove_corollary_1_to_ordered_pairs_are_sets_2,plain,
~ member(x,universal_class),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET117-7.tptp',unknown),
[] ).
cnf(167058336,plain,
~ member(x,universal_class),
inference(rewrite,[status(thm)],[prove_corollary_1_to_ordered_pairs_are_sets_2]),
[] ).
fof(prove_corollary_1_to_ordered_pairs_are_sets_1,plain,
$equal(ordered_pair(first(x),second(x)),x),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET117-7.tptp',unknown),
[] ).
cnf(167053568,plain,
$equal(ordered_pair(first(x),second(x)),x),
inference(rewrite,[status(thm)],[prove_corollary_1_to_ordered_pairs_are_sets_1]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__paramodulation,[status(thm)],[166908104,167058336,167053568,theory(equality)]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(ordered_pair_is_set,plain,(member(ordered_pair(A,B),universal_class)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET117-7.tptp',unknown),[]).
%
% cnf(166908104,plain,(member(ordered_pair(A,B),universal_class)),inference(rewrite,[status(thm)],[ordered_pair_is_set]),[]).
%
% fof(prove_corollary_1_to_ordered_pairs_are_sets_2,plain,(~member(x,universal_class)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET117-7.tptp',unknown),[]).
%
% cnf(167058336,plain,(~member(x,universal_class)),inference(rewrite,[status(thm)],[prove_corollary_1_to_ordered_pairs_are_sets_2]),[]).
%
% fof(prove_corollary_1_to_ordered_pairs_are_sets_1,plain,($equal(ordered_pair(first(x),second(x)),x)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET117-7.tptp',unknown),[]).
%
% cnf(167053568,plain,($equal(ordered_pair(first(x),second(x)),x)),inference(rewrite,[status(thm)],[prove_corollary_1_to_ordered_pairs_are_sets_1]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[166908104,167058336,167053568,theory(equality)]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------