TSTP Solution File: NUM387+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : NUM387+1 : TPTP v3.4.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art10.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:03:15 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 7 unt; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 7 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(t10_ordinal1,plain,
! [A] : in(A,succ(A)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM387+1.tptp',unknown),
[] ).
cnf(142644760,plain,
in(A,succ(A)),
inference(rewrite,[status(thm)],[t10_ordinal1]),
[] ).
fof(antisymmetry_r2_hidden,plain,
! [A,B] :
( ~ in(A,B)
| ~ in(B,A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM387+1.tptp',unknown),
[] ).
cnf(142343296,plain,
( ~ in(A,B)
| ~ in(B,A) ),
inference(rewrite,[status(thm)],[antisymmetry_r2_hidden]),
[] ).
cnf(151146048,plain,
~ in(succ(A),A),
inference(resolution,[status(thm)],[142343296,142644760]),
[] ).
fof(t14_ordinal1,plain,
$equal(succ(a),a),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM387+1.tptp',unknown),
[] ).
cnf(142670728,plain,
$equal(succ(a),a),
inference(rewrite,[status(thm)],[t14_ordinal1]),
[] ).
cnf(154594792,plain,
~ in(a,a),
inference(paramodulation,[status(thm)],[151146048,142670728,theory(equality)]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__paramodulation,[status(thm)],[142644760,154594792,142670728,theory(equality)]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(t10_ordinal1,plain,(in(A,succ(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM387+1.tptp',unknown),[]).
%
% cnf(142644760,plain,(in(A,succ(A))),inference(rewrite,[status(thm)],[t10_ordinal1]),[]).
%
% fof(antisymmetry_r2_hidden,plain,(~in(A,B)|~in(B,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM387+1.tptp',unknown),[]).
%
% cnf(142343296,plain,(~in(A,B)|~in(B,A)),inference(rewrite,[status(thm)],[antisymmetry_r2_hidden]),[]).
%
% cnf(151146048,plain,(~in(succ(A),A)),inference(resolution,[status(thm)],[142343296,142644760]),[]).
%
% fof(t14_ordinal1,plain,($equal(succ(a),a)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/NUM/NUM387+1.tptp',unknown),[]).
%
% cnf(142670728,plain,($equal(succ(a),a)),inference(rewrite,[status(thm)],[t14_ordinal1]),[]).
%
% cnf(154594792,plain,(~in(a,a)),inference(paramodulation,[status(thm)],[151146048,142670728,theory(equality)]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[142644760,154594792,142670728,theory(equality)]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------