TSTP Solution File: GRP031-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : GRP031-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May 6 12:18:47 EDT 2009
% Result : Unsatisfiable 64.9s
% Output : Refutation 64.9s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 45 ( 1 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(associativity2,plain,
! [A,B,C,D,E,F] :
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(A,E,F)
| product(C,D,F) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),
[] ).
cnf(169475216,plain,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(A,E,F)
| product(C,D,F) ),
inference(rewrite,[status(thm)],[associativity2]),
[] ).
fof(left_inverse,plain,
! [A] : product(inverse(A),A,identity),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),
[] ).
cnf(169482248,plain,
product(inverse(A),A,identity),
inference(rewrite,[status(thm)],[left_inverse]),
[] ).
cnf(177503680,plain,
( ~ product(inverse(D),A,B)
| ~ product(A,C,D)
| product(B,C,identity) ),
inference(resolution,[status(thm)],[169475216,169482248]),
[] ).
fof(left_identity,plain,
! [A] : product(identity,A,A),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),
[] ).
cnf(169478480,plain,
product(identity,A,A),
inference(rewrite,[status(thm)],[left_identity]),
[] ).
cnf(177540128,plain,
( ~ product(inverse(B),identity,A)
| product(A,B,identity) ),
inference(resolution,[status(thm)],[177503680,169478480]),
[] ).
fof(associativity1,plain,
! [A,B,C,D,E,F] :
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(C,D,F)
| product(A,E,F) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),
[] ).
cnf(169470952,plain,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(C,D,F)
| product(A,E,F) ),
inference(rewrite,[status(thm)],[associativity1]),
[] ).
cnf(177387328,plain,
( ~ product(A,B,C)
| ~ product(identity,B,D)
| product(inverse(A),C,D) ),
inference(resolution,[status(thm)],[169470952,169482248]),
[] ).
cnf(177442896,plain,
( ~ product(A,B,C)
| product(inverse(A),C,B) ),
inference(resolution,[status(thm)],[177387328,169478480]),
[] ).
cnf(184118344,plain,
product(inverse(inverse(A)),identity,A),
inference(resolution,[status(thm)],[177442896,169482248]),
[] ).
cnf(326862432,plain,
product(A,inverse(A),identity),
inference(resolution,[status(thm)],[177540128,184118344]),
[] ).
fof(prove_a_has_an_inverse,plain,
! [A] : ~ product(a,A,identity),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),
[] ).
cnf(169485976,plain,
~ product(a,A,identity),
inference(rewrite,[status(thm)],[prove_a_has_an_inverse]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[326862432,169485976]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 64 seconds
% START OF PROOF SEQUENCE
% fof(associativity2,plain,(~product(A,B,C)|~product(B,D,E)|~product(A,E,F)|product(C,D,F)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),[]).
%
% cnf(169475216,plain,(~product(A,B,C)|~product(B,D,E)|~product(A,E,F)|product(C,D,F)),inference(rewrite,[status(thm)],[associativity2]),[]).
%
% fof(left_inverse,plain,(product(inverse(A),A,identity)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),[]).
%
% cnf(169482248,plain,(product(inverse(A),A,identity)),inference(rewrite,[status(thm)],[left_inverse]),[]).
%
% cnf(177503680,plain,(~product(inverse(D),A,B)|~product(A,C,D)|product(B,C,identity)),inference(resolution,[status(thm)],[169475216,169482248]),[]).
%
% fof(left_identity,plain,(product(identity,A,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),[]).
%
% cnf(169478480,plain,(product(identity,A,A)),inference(rewrite,[status(thm)],[left_identity]),[]).
%
% cnf(177540128,plain,(~product(inverse(B),identity,A)|product(A,B,identity)),inference(resolution,[status(thm)],[177503680,169478480]),[]).
%
% fof(associativity1,plain,(~product(A,B,C)|~product(B,D,E)|~product(C,D,F)|product(A,E,F)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),[]).
%
% cnf(169470952,plain,(~product(A,B,C)|~product(B,D,E)|~product(C,D,F)|product(A,E,F)),inference(rewrite,[status(thm)],[associativity1]),[]).
%
% cnf(177387328,plain,(~product(A,B,C)|~product(identity,B,D)|product(inverse(A),C,D)),inference(resolution,[status(thm)],[169470952,169482248]),[]).
%
% cnf(177442896,plain,(~product(A,B,C)|product(inverse(A),C,B)),inference(resolution,[status(thm)],[177387328,169478480]),[]).
%
% cnf(184118344,plain,(product(inverse(inverse(A)),identity,A)),inference(resolution,[status(thm)],[177442896,169482248]),[]).
%
% cnf(326862432,plain,(product(A,inverse(A),identity)),inference(resolution,[status(thm)],[177540128,184118344]),[]).
%
% fof(prove_a_has_an_inverse,plain,(~product(a,A,identity)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP031-1.tptp',unknown),[]).
%
% cnf(169485976,plain,(~product(a,A,identity)),inference(rewrite,[status(thm)],[prove_a_has_an_inverse]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[326862432,169485976]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------