TSTP Solution File: LCL210-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL210-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art01.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 13:46:21 EDT 2009
% Result : Unsatisfiable 439.1s
% Output : Refutation 439.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 21 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 2 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166149080,plain,
~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
fof(rule_2,plain,
! [A,B] :
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166128920,plain,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
inference(rewrite,[status(thm)],[rule_2]),
[] ).
fof(axiom_1_5,plain,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166093104,plain,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(rewrite,[status(thm)],[axiom_1_5]),
[] ).
cnf(174166848,plain,
( theorem(or(B,or(A,C)))
| ~ theorem(or(A,or(B,C))) ),
inference(resolution,[status(thm)],[166128920,166093104]),
[] ).
fof(rule_3,plain,
! [A,B,C] :
( theorem(or(not(A),B))
| ~ axiom(or(not(A),C))
| ~ theorem(or(not(C),B)) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166144608,plain,
( theorem(or(not(A),B))
| ~ axiom(or(not(A),C))
| ~ theorem(or(not(C),B)) ),
inference(rewrite,[status(thm)],[rule_3]),
[] ).
fof(axiom_1_4,plain,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166089144,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(185803752,plain,
( theorem(or(not(or(B,C)),A))
| ~ theorem(or(not(or(C,B)),A)) ),
inference(resolution,[status(thm)],[166144608,166089144]),
[] ).
fof(axiom_1_3,plain,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166085304,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(185737032,plain,
( theorem(or(not(A),B))
| ~ theorem(or(not(or(C,A)),B)) ),
inference(resolution,[status(thm)],[166144608,166085304]),
[] ).
fof(axiom_1_6,plain,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166101296,plain,
axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(rewrite,[status(thm)],[axiom_1_6]),
[] ).
cnf(187253968,plain,
( theorem(or(not(or(not(B),C)),A))
| ~ theorem(or(not(or(not(or(D,B)),or(D,C))),A)) ),
inference(resolution,[status(thm)],[166144608,166101296]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166111648,plain,
( theorem(A)
| ~ axiom(A) ),
inference(rewrite,[status(thm)],[rule_1]),
[] ).
fof(axiom_1_2,plain,
! [A] : axiom(or(not(or(A,A)),A)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),
[] ).
cnf(166081136,plain,
axiom(or(not(or(A,A)),A)),
inference(rewrite,[status(thm)],[axiom_1_2]),
[] ).
cnf(173912120,plain,
theorem(or(not(or(A,A)),A)),
inference(resolution,[status(thm)],[166111648,166081136]),
[] ).
cnf(174086120,plain,
( theorem(A)
| ~ axiom(or(not(or(not(or(B,B)),B)),A)) ),
inference(resolution,[status(thm)],[166128920,173912120]),
[] ).
cnf(179223328,plain,
theorem(or(not(or(B,or(A,A))),or(B,A))),
inference(resolution,[status(thm)],[174086120,166101296]),
[] ).
cnf(198988472,plain,
theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))),
inference(resolution,[status(thm)],[187253968,179223328]),
[] ).
cnf(301797376,plain,
theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))),
inference(resolution,[status(thm)],[185803752,198988472]),
[] ).
cnf(546442664,plain,
theorem(or(not(not(B)),or(not(or(A,B)),A))),
inference(resolution,[status(thm)],[185737032,301797376]),
[] ).
cnf(546519408,plain,
theorem(or(not(or(A,B)),or(not(not(B)),A))),
inference(resolution,[status(thm)],[174166848,546442664]),
[] ).
cnf(546718592,plain,
theorem(or(not(or(A,B)),or(not(not(A)),B))),
inference(resolution,[status(thm)],[185803752,546519408]),
[] ).
cnf(546874968,plain,
theorem(or(not(not(B)),or(not(or(B,A)),A))),
inference(resolution,[status(thm)],[174166848,546718592]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[166149080,546874968]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 439 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(not(p)),or(not(or(p,q)),q)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166149080,plain,(~theorem(or(not(not(p)),or(not(or(p,q)),q)))),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166128920,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
%
% fof(axiom_1_5,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166093104,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
%
% cnf(174166848,plain,(theorem(or(B,or(A,C)))|~theorem(or(A,or(B,C)))),inference(resolution,[status(thm)],[166128920,166093104]),[]).
%
% fof(rule_3,plain,(theorem(or(not(A),B))|~axiom(or(not(A),C))|~theorem(or(not(C),B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166144608,plain,(theorem(or(not(A),B))|~axiom(or(not(A),C))|~theorem(or(not(C),B))),inference(rewrite,[status(thm)],[rule_3]),[]).
%
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166089144,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(185803752,plain,(theorem(or(not(or(B,C)),A))|~theorem(or(not(or(C,B)),A))),inference(resolution,[status(thm)],[166144608,166089144]),[]).
%
% fof(axiom_1_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166085304,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(185737032,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[166144608,166085304]),[]).
%
% fof(axiom_1_6,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166101296,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(rewrite,[status(thm)],[axiom_1_6]),[]).
%
% cnf(187253968,plain,(theorem(or(not(or(not(B),C)),A))|~theorem(or(not(or(not(or(D,B)),or(D,C))),A))),inference(resolution,[status(thm)],[166144608,166101296]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166111648,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
%
% fof(axiom_1_2,plain,(axiom(or(not(or(A,A)),A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL210-1.tptp',unknown),[]).
%
% cnf(166081136,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
%
% cnf(173912120,plain,(theorem(or(not(or(A,A)),A))),inference(resolution,[status(thm)],[166111648,166081136]),[]).
%
% cnf(174086120,plain,(theorem(A)|~axiom(or(not(or(not(or(B,B)),B)),A))),inference(resolution,[status(thm)],[166128920,173912120]),[]).
%
% cnf(179223328,plain,(theorem(or(not(or(B,or(A,A))),or(B,A)))),inference(resolution,[status(thm)],[174086120,166101296]),[]).
%
% cnf(198988472,plain,(theorem(or(not(or(not(A),B)),or(not(or(B,A)),B)))),inference(resolution,[status(thm)],[187253968,179223328]),[]).
%
% cnf(301797376,plain,(theorem(or(not(or(A,not(B))),or(not(or(A,B)),A)))),inference(resolution,[status(thm)],[185803752,198988472]),[]).
%
% cnf(546442664,plain,(theorem(or(not(not(B)),or(not(or(A,B)),A)))),inference(resolution,[status(thm)],[185737032,301797376]),[]).
%
% cnf(546519408,plain,(theorem(or(not(or(A,B)),or(not(not(B)),A)))),inference(resolution,[status(thm)],[174166848,546442664]),[]).
%
% cnf(546718592,plain,(theorem(or(not(or(A,B)),or(not(not(A)),B)))),inference(resolution,[status(thm)],[185803752,546519408]),[]).
%
% cnf(546874968,plain,(theorem(or(not(not(B)),or(not(or(B,A)),A)))),inference(resolution,[status(thm)],[174166848,546718592]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[166149080,546874968]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------