TSTP Solution File: LCL192-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL192-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art03.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:36 EDT 2009
% Result : Unsatisfiable 588.0s
% Output : Refutation 588.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
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/LCL192-1.tptp',unknown),
[] ).
cnf(161944848,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/LCL192-1.tptp',unknown),
[] ).
cnf(161893304,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(183510096,plain,
( theorem(or(not(or(B,C)),A))
| ~ theorem(or(not(or(C,B)),A)) ),
inference(resolution,[status(thm)],[161944848,161893304]),
[] ).
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/LCL192-1.tptp',unknown),
[] ).
cnf(161897296,plain,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(rewrite,[status(thm)],[axiom_1_5]),
[] ).
cnf(170030576,plain,
( theorem(or(not(or(B,or(C,D))),A))
| ~ theorem(or(not(or(C,or(B,D))),A)) ),
inference(resolution,[status(thm)],[161944848,161897296]),
[] ).
fof(rule_2,plain,
! [A,B] :
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL192-1.tptp',unknown),
[] ).
cnf(161929128,plain,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
inference(rewrite,[status(thm)],[rule_2]),
[] ).
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/LCL192-1.tptp',unknown),
[] ).
cnf(161905520,plain,
axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(rewrite,[status(thm)],[axiom_1_6]),
[] ).
cnf(170129512,plain,
( theorem(or(not(or(C,A)),or(C,B)))
| ~ theorem(or(not(A),B)) ),
inference(resolution,[status(thm)],[161929128,161905520]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL192-1.tptp',unknown),
[] ).
cnf(161911824,plain,
( theorem(A)
| ~ axiom(A) ),
inference(rewrite,[status(thm)],[rule_1]),
[] ).
cnf(169883448,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(resolution,[status(thm)],[161911824,161893304]),
[] ).
cnf(185348480,plain,
theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))),
inference(resolution,[status(thm)],[170129512,169883448]),
[] ).
cnf(272186008,plain,
theorem(or(not(or(A,or(B,C))),or(B,or(C,A)))),
inference(resolution,[status(thm)],[170030576,185348480]),
[] ).
cnf(480731728,plain,
theorem(or(not(or(or(B,C),A)),or(B,or(C,A)))),
inference(resolution,[status(thm)],[183510096,272186008]),
[] ).
fof(prove_this,plain,
~ theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL192-1.tptp',unknown),
[] ).
cnf(161949336,plain,
~ theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
cnf(170104432,plain,
( theorem(or(B,A))
| ~ theorem(or(A,B)) ),
inference(resolution,[status(thm)],[161929128,161893304]),
[] ).
cnf(174809864,plain,
~ theorem(or(or(p,or(q,r)),not(or(or(p,q),r)))),
inference(resolution,[status(thm)],[161949336,170104432]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[480731728,174809864,170104432]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 587 seconds
% START OF PROOF SEQUENCE
% 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/LCL192-1.tptp',unknown),[]).
%
% cnf(161944848,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/LCL192-1.tptp',unknown),[]).
%
% cnf(161893304,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(183510096,plain,(theorem(or(not(or(B,C)),A))|~theorem(or(not(or(C,B)),A))),inference(resolution,[status(thm)],[161944848,161893304]),[]).
%
% 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/LCL192-1.tptp',unknown),[]).
%
% cnf(161897296,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
%
% cnf(170030576,plain,(theorem(or(not(or(B,or(C,D))),A))|~theorem(or(not(or(C,or(B,D))),A))),inference(resolution,[status(thm)],[161944848,161897296]),[]).
%
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL192-1.tptp',unknown),[]).
%
% cnf(161929128,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
%
% 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/LCL192-1.tptp',unknown),[]).
%
% cnf(161905520,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(rewrite,[status(thm)],[axiom_1_6]),[]).
%
% cnf(170129512,plain,(theorem(or(not(or(C,A)),or(C,B)))|~theorem(or(not(A),B))),inference(resolution,[status(thm)],[161929128,161905520]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL192-1.tptp',unknown),[]).
%
% cnf(161911824,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
%
% cnf(169883448,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[161911824,161893304]),[]).
%
% cnf(185348480,plain,(theorem(or(not(or(A,or(B,C))),or(A,or(C,B))))),inference(resolution,[status(thm)],[170129512,169883448]),[]).
%
% cnf(272186008,plain,(theorem(or(not(or(A,or(B,C))),or(B,or(C,A))))),inference(resolution,[status(thm)],[170030576,185348480]),[]).
%
% cnf(480731728,plain,(theorem(or(not(or(or(B,C),A)),or(B,or(C,A))))),inference(resolution,[status(thm)],[183510096,272186008]),[]).
%
% fof(prove_this,plain,(~theorem(or(not(or(or(p,q),r)),or(p,or(q,r))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL192-1.tptp',unknown),[]).
%
% cnf(161949336,plain,(~theorem(or(not(or(or(p,q),r)),or(p,or(q,r))))),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% cnf(170104432,plain,(theorem(or(B,A))|~theorem(or(A,B))),inference(resolution,[status(thm)],[161929128,161893304]),[]).
%
% cnf(174809864,plain,(~theorem(or(or(p,or(q,r)),not(or(or(p,q),r))))),inference(resolution,[status(thm)],[161949336,170104432]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[480731728,174809864,170104432]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------