TSTP Solution File: LCL187-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL187-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:45:19 EDT 2009
% Result : Unsatisfiable 0.6s
% Output : Refutation 0.6s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 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 : 38 ( 4 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
~ theorem(or(not(p),or(not(not(p)),q))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL187-1.tptp',unknown),
[] ).
cnf(166122752,plain,
~ theorem(or(not(p),or(not(not(p)),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/LCL187-1.tptp',unknown),
[] ).
cnf(166102632,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/LCL187-1.tptp',unknown),
[] ).
cnf(166066808,plain,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(rewrite,[status(thm)],[axiom_1_5]),
[] ).
cnf(174254088,plain,
( theorem(or(B,or(A,C)))
| ~ theorem(or(A,or(B,C))) ),
inference(resolution,[status(thm)],[166102632,166066808]),
[] ).
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/LCL187-1.tptp',unknown),
[] ).
cnf(166118320,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/LCL187-1.tptp',unknown),
[] ).
cnf(166059008,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(173962328,plain,
( theorem(or(not(A),B))
| ~ theorem(or(not(or(C,A)),B)) ),
inference(resolution,[status(thm)],[166118320,166059008]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL187-1.tptp',unknown),
[] ).
cnf(166081272,plain,
( theorem(A)
| ~ axiom(A) ),
inference(rewrite,[status(thm)],[rule_1]),
[] ).
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/LCL187-1.tptp',unknown),
[] ).
cnf(166062848,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(174011176,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(resolution,[status(thm)],[166081272,166062848]),
[] ).
cnf(187904912,plain,
theorem(or(not(A),or(A,B))),
inference(resolution,[status(thm)],[173962328,174011176]),
[] ).
cnf(188453096,plain,
theorem(or(A,or(not(A),B))),
inference(resolution,[status(thm)],[174254088,187904912]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[166122752,188453096]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(p),or(not(not(p)),q)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL187-1.tptp',unknown),[]).
%
% cnf(166122752,plain,(~theorem(or(not(p),or(not(not(p)),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/LCL187-1.tptp',unknown),[]).
%
% cnf(166102632,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/LCL187-1.tptp',unknown),[]).
%
% cnf(166066808,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
%
% cnf(174254088,plain,(theorem(or(B,or(A,C)))|~theorem(or(A,or(B,C)))),inference(resolution,[status(thm)],[166102632,166066808]),[]).
%
% 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/LCL187-1.tptp',unknown),[]).
%
% cnf(166118320,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/LCL187-1.tptp',unknown),[]).
%
% cnf(166059008,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(173962328,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[166118320,166059008]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL187-1.tptp',unknown),[]).
%
% cnf(166081272,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
%
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL187-1.tptp',unknown),[]).
%
% cnf(166062848,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(174011176,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[166081272,166062848]),[]).
%
% cnf(187904912,plain,(theorem(or(not(A),or(A,B)))),inference(resolution,[status(thm)],[173962328,174011176]),[]).
%
% cnf(188453096,plain,(theorem(or(A,or(not(A),B)))),inference(resolution,[status(thm)],[174254088,187904912]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[166122752,188453096]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------