TSTP Solution File: LCL201-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL201-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:58 EDT 2009
% Result : Unsatisfiable 44.9s
% Output : Refutation 44.9s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 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 : 50 ( 9 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL201-1.tptp',unknown),
[] ).
cnf(152624088,plain,
~ theorem(or(not(not(or(p,q))),or(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/LCL201-1.tptp',unknown),
[] ).
cnf(152603928,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/LCL201-1.tptp',unknown),
[] ).
cnf(152568112,plain,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(rewrite,[status(thm)],[axiom_1_5]),
[] ).
cnf(160620936,plain,
( theorem(or(B,or(A,C)))
| ~ theorem(or(A,or(B,C))) ),
inference(resolution,[status(thm)],[152603928,152568112]),
[] ).
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/LCL201-1.tptp',unknown),
[] ).
cnf(152619616,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/LCL201-1.tptp',unknown),
[] ).
cnf(152560312,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(172040288,plain,
( theorem(or(not(A),B))
| ~ theorem(or(not(or(C,A)),B)) ),
inference(resolution,[status(thm)],[152619616,152560312]),
[] ).
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/LCL201-1.tptp',unknown),
[] ).
cnf(152564152,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(172108888,plain,
( theorem(or(not(or(B,C)),A))
| ~ theorem(or(not(or(C,B)),A)) ),
inference(resolution,[status(thm)],[152619616,152564152]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL201-1.tptp',unknown),
[] ).
cnf(152586656,plain,
( theorem(A)
| ~ axiom(A) ),
inference(rewrite,[status(thm)],[rule_1]),
[] ).
cnf(160479888,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(resolution,[status(thm)],[152586656,152564152]),
[] ).
cnf(172358448,plain,
theorem(or(not(A),or(A,B))),
inference(resolution,[status(thm)],[172040288,160479888]),
[] ).
cnf(172984552,plain,
theorem(or(A,or(not(A),B))),
inference(resolution,[status(thm)],[160620936,172358448]),
[] ).
cnf(173237976,plain,
theorem(or(not(or(A,B)),or(not(not(or(B,A))),C))),
inference(resolution,[status(thm)],[172108888,172984552]),
[] ).
cnf(241398176,plain,
theorem(or(not(A),or(not(not(or(A,B))),C))),
inference(resolution,[status(thm)],[172040288,173237976]),
[] ).
cnf(270426280,plain,
theorem(or(not(not(or(B,C))),or(not(B),A))),
inference(resolution,[status(thm)],[160620936,241398176]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[152624088,270426280]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 45 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(not(or(p,q))),or(not(p),q)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL201-1.tptp',unknown),[]).
%
% cnf(152624088,plain,(~theorem(or(not(not(or(p,q))),or(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/LCL201-1.tptp',unknown),[]).
%
% cnf(152603928,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/LCL201-1.tptp',unknown),[]).
%
% cnf(152568112,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
%
% cnf(160620936,plain,(theorem(or(B,or(A,C)))|~theorem(or(A,or(B,C)))),inference(resolution,[status(thm)],[152603928,152568112]),[]).
%
% 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/LCL201-1.tptp',unknown),[]).
%
% cnf(152619616,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/LCL201-1.tptp',unknown),[]).
%
% cnf(152560312,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(172040288,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[152619616,152560312]),[]).
%
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL201-1.tptp',unknown),[]).
%
% cnf(152564152,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(172108888,plain,(theorem(or(not(or(B,C)),A))|~theorem(or(not(or(C,B)),A))),inference(resolution,[status(thm)],[152619616,152564152]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL201-1.tptp',unknown),[]).
%
% cnf(152586656,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
%
% cnf(160479888,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[152586656,152564152]),[]).
%
% cnf(172358448,plain,(theorem(or(not(A),or(A,B)))),inference(resolution,[status(thm)],[172040288,160479888]),[]).
%
% cnf(172984552,plain,(theorem(or(A,or(not(A),B)))),inference(resolution,[status(thm)],[160620936,172358448]),[]).
%
% cnf(173237976,plain,(theorem(or(not(or(A,B)),or(not(not(or(B,A))),C)))),inference(resolution,[status(thm)],[172108888,172984552]),[]).
%
% cnf(241398176,plain,(theorem(or(not(A),or(not(not(or(A,B))),C)))),inference(resolution,[status(thm)],[172040288,173237976]),[]).
%
% cnf(270426280,plain,(theorem(or(not(not(or(B,C))),or(not(B),A)))),inference(resolution,[status(thm)],[160620936,241398176]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[152624088,270426280]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------