TSTP Solution File: LCL211-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL211-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art08.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:24 EDT 2009
% Result : Unsatisfiable 388.2s
% Output : Refutation 388.2s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 16 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 49 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
~ theorem(or(not(not(q)),or(not(or(p,q)),p))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),
[] ).
cnf(149311272,plain,
~ theorem(or(not(not(q)),or(not(or(p,q)),p))),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
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/LCL211-1.tptp',unknown),
[] ).
cnf(149306800,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_3,plain,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),
[] ).
cnf(149247488,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(157151152,plain,
( theorem(or(not(A),B))
| ~ theorem(or(not(or(C,A)),B)) ),
inference(resolution,[status(thm)],[149306800,149247488]),
[] ).
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/LCL211-1.tptp',unknown),
[] ).
cnf(149251328,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(169550008,plain,
( theorem(or(not(or(B,C)),A))
| ~ theorem(or(not(or(C,B)),A)) ),
inference(resolution,[status(thm)],[149306800,149251328]),
[] ).
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/LCL211-1.tptp',unknown),
[] ).
cnf(149267568,plain,
axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(rewrite,[status(thm)],[axiom_1_6]),
[] ).
cnf(170969504,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)],[149306800,149267568]),
[] ).
fof(rule_2,plain,
! [A,B] :
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),
[] ).
cnf(149291112,plain,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
inference(rewrite,[status(thm)],[rule_2]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),
[] ).
cnf(149273840,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/LCL211-1.tptp',unknown),
[] ).
cnf(149243320,plain,
axiom(or(not(or(A,A)),A)),
inference(rewrite,[status(thm)],[axiom_1_2]),
[] ).
cnf(157074496,plain,
theorem(or(not(or(A,A)),A)),
inference(resolution,[status(thm)],[149273840,149243320]),
[] ).
cnf(157287728,plain,
( theorem(A)
| ~ axiom(or(not(or(not(or(B,B)),B)),A)) ),
inference(resolution,[status(thm)],[149291112,157074496]),
[] ).
cnf(162525568,plain,
theorem(or(not(or(B,or(A,A))),or(B,A))),
inference(resolution,[status(thm)],[157287728,149267568]),
[] ).
cnf(184731488,plain,
theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))),
inference(resolution,[status(thm)],[170969504,162525568]),
[] ).
cnf(292587072,plain,
theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))),
inference(resolution,[status(thm)],[169550008,184731488]),
[] ).
cnf(524290080,plain,
theorem(or(not(not(B)),or(not(or(A,B)),A))),
inference(resolution,[status(thm)],[157151152,292587072]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[149311272,524290080]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 387 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(not(q)),or(not(or(p,q)),p)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),[]).
%
% cnf(149311272,plain,(~theorem(or(not(not(q)),or(not(or(p,q)),p)))),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% 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/LCL211-1.tptp',unknown),[]).
%
% cnf(149306800,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_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),[]).
%
% cnf(149247488,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(157151152,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[149306800,149247488]),[]).
%
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),[]).
%
% cnf(149251328,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(169550008,plain,(theorem(or(not(or(B,C)),A))|~theorem(or(not(or(C,B)),A))),inference(resolution,[status(thm)],[149306800,149251328]),[]).
%
% 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/LCL211-1.tptp',unknown),[]).
%
% cnf(149267568,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(rewrite,[status(thm)],[axiom_1_6]),[]).
%
% cnf(170969504,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)],[149306800,149267568]),[]).
%
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),[]).
%
% cnf(149291112,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL211-1.tptp',unknown),[]).
%
% cnf(149273840,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/LCL211-1.tptp',unknown),[]).
%
% cnf(149243320,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
%
% cnf(157074496,plain,(theorem(or(not(or(A,A)),A))),inference(resolution,[status(thm)],[149273840,149243320]),[]).
%
% cnf(157287728,plain,(theorem(A)|~axiom(or(not(or(not(or(B,B)),B)),A))),inference(resolution,[status(thm)],[149291112,157074496]),[]).
%
% cnf(162525568,plain,(theorem(or(not(or(B,or(A,A))),or(B,A)))),inference(resolution,[status(thm)],[157287728,149267568]),[]).
%
% cnf(184731488,plain,(theorem(or(not(or(not(A),B)),or(not(or(B,A)),B)))),inference(resolution,[status(thm)],[170969504,162525568]),[]).
%
% cnf(292587072,plain,(theorem(or(not(or(A,not(B))),or(not(or(A,B)),A)))),inference(resolution,[status(thm)],[169550008,184731488]),[]).
%
% cnf(524290080,plain,(theorem(or(not(not(B)),or(not(or(A,B)),A)))),inference(resolution,[status(thm)],[157151152,292587072]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[149311272,524290080]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------