TSTP Solution File: SYN291-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN291-1 : TPTP v3.4.2. Released v1.1.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 @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May 6 17:45:08 EDT 2009
% Result : Unsatisfiable 0.3s
% Output : Refutation 0.3s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 15 ( 6 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
! [A,B] : ~ q1(d,A,B),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN291-1.tptp',unknown),
[] ).
cnf(160414256,plain,
~ q1(d,A,B),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
fof(rule_110,plain,
! [A,B,C] :
( q1(A,A,A)
| ~ m0(B,C,A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN291-1.tptp',unknown),
[] ).
cnf(157432472,plain,
( q1(A,A,A)
| ~ m0(B,C,A) ),
inference(rewrite,[status(thm)],[rule_110]),
[] ).
fof(axiom_19,plain,
! [A,B] : m0(A,d,B),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN291-1.tptp',unknown),
[] ).
cnf(156141648,plain,
m0(A,d,B),
inference(rewrite,[status(thm)],[axiom_19]),
[] ).
cnf(171648696,plain,
q1(A,A,A),
inference(resolution,[status(thm)],[157432472,156141648]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[160414256,171648696]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~q1(d,A,B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN291-1.tptp',unknown),[]).
%
% cnf(160414256,plain,(~q1(d,A,B)),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% fof(rule_110,plain,(q1(A,A,A)|~m0(B,C,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN291-1.tptp',unknown),[]).
%
% cnf(157432472,plain,(q1(A,A,A)|~m0(B,C,A)),inference(rewrite,[status(thm)],[rule_110]),[]).
%
% fof(axiom_19,plain,(m0(A,d,B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN291-1.tptp',unknown),[]).
%
% cnf(156141648,plain,(m0(A,d,B)),inference(rewrite,[status(thm)],[axiom_19]),[]).
%
% cnf(171648696,plain,(q1(A,A,A)),inference(resolution,[status(thm)],[157432472,156141648]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[160414256,171648696]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------