TSTP Solution File: HEN001-3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : HEN001-3 : TPTP v3.4.2. Released v1.0.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 @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May 6 13:14:49 EDT 2009
% Result : Unsatisfiable 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of formulae : 7 ( 5 unt; 0 def)
% Number of atoms : 9 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 1 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(identity_is_largest,plain,
! [A] : less_equal(A,identity),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/HEN/HEN001-3.tptp',unknown),
[] ).
cnf(159098600,plain,
less_equal(A,identity),
inference(rewrite,[status(thm)],[identity_is_largest]),
[] ).
fof(quotient_less_equal1,plain,
! [A,B] :
( ~ less_equal(A,B)
| $equal(zero,divide(A,B)) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/HEN/HEN001-3.tptp',unknown),
[] ).
cnf(159062104,plain,
( ~ less_equal(A,B)
| $equal(zero,divide(A,B)) ),
inference(rewrite,[status(thm)],[quotient_less_equal1]),
[] ).
fof(prove_a_divide_id_is_zero,plain,
~ $equal(divide(a,identity),zero),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/HEN/HEN001-3.tptp',unknown),
[] ).
cnf(159102368,plain,
~ $equal(divide(a,identity),zero),
inference(rewrite,[status(thm)],[prove_a_divide_id_is_zero]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__paramodulation,[status(thm)],[159098600,159062104,159102368,theory(equality)]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(identity_is_largest,plain,(less_equal(A,identity)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/HEN/HEN001-3.tptp',unknown),[]).
%
% cnf(159098600,plain,(less_equal(A,identity)),inference(rewrite,[status(thm)],[identity_is_largest]),[]).
%
% fof(quotient_less_equal1,plain,(~less_equal(A,B)|$equal(zero,divide(A,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/HEN/HEN001-3.tptp',unknown),[]).
%
% cnf(159062104,plain,(~less_equal(A,B)|$equal(zero,divide(A,B))),inference(rewrite,[status(thm)],[quotient_less_equal1]),[]).
%
% fof(prove_a_divide_id_is_zero,plain,(~$equal(divide(a,identity),zero)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/HEN/HEN001-3.tptp',unknown),[]).
%
% cnf(159102368,plain,(~$equal(divide(a,identity),zero)),inference(rewrite,[status(thm)],[prove_a_divide_id_is_zero]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[159098600,159062104,159102368,theory(equality)]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------