TSTP Solution File: LCL238-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL238-1 : TPTP v3.4.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art02.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:47:13 EDT 2009
% Result : Unsatisfiable 2.5s
% Output : Refutation 2.5s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 35 ( 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 : 34 ( 1 sgn 11 !; 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/LCL238-1.tptp',unknown),
[] ).
cnf(168889952,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/LCL238-1.tptp',unknown),
[] ).
cnf(168838568,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(187495928,plain,
( theorem(or(not(or(B,C)),A))
| ~ theorem(or(not(or(C,B)),A)) ),
inference(resolution,[status(thm)],[168889952,168838568]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),
[] ).
cnf(168856992,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/LCL238-1.tptp',unknown),
[] ).
cnf(168830560,plain,
axiom(or(not(or(A,A)),A)),
inference(rewrite,[status(thm)],[axiom_1_2]),
[] ).
cnf(176657744,plain,
theorem(or(not(or(A,A)),A)),
inference(resolution,[status(thm)],[168856992,168830560]),
[] ).
cnf(176806504,plain,
( theorem(or(not(A),B))
| ~ axiom(or(not(A),or(B,B))) ),
inference(resolution,[status(thm)],[168889952,176657744]),
[] ).
fof(axiom_1_3,plain,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),
[] ).
cnf(168834728,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(176824008,plain,
theorem(or(not(A),A)),
inference(resolution,[status(thm)],[176806504,168834728]),
[] ).
fof(rule_2,plain,
! [A,B] :
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),
[] ).
cnf(168874264,plain,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
inference(rewrite,[status(thm)],[rule_2]),
[] ).
cnf(176916704,plain,
( theorem(or(B,A))
| ~ theorem(or(A,B)) ),
inference(resolution,[status(thm)],[168874264,168838568]),
[] ).
cnf(181292384,plain,
theorem(or(A,not(A))),
inference(resolution,[status(thm)],[176824008,176916704]),
[] ).
cnf(187581128,plain,
theorem(or(not(or(A,B)),not(not(or(B,A))))),
inference(resolution,[status(thm)],[187495928,181292384]),
[] ).
fof(prove_this,plain,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),
[] ).
cnf(168894424,plain,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[187581128,168894424,176916704]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 2 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/LCL238-1.tptp',unknown),[]).
%
% cnf(168889952,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/LCL238-1.tptp',unknown),[]).
%
% cnf(168838568,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(187495928,plain,(theorem(or(not(or(B,C)),A))|~theorem(or(not(or(C,B)),A))),inference(resolution,[status(thm)],[168889952,168838568]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),[]).
%
% cnf(168856992,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/LCL238-1.tptp',unknown),[]).
%
% cnf(168830560,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
%
% cnf(176657744,plain,(theorem(or(not(or(A,A)),A))),inference(resolution,[status(thm)],[168856992,168830560]),[]).
%
% cnf(176806504,plain,(theorem(or(not(A),B))|~axiom(or(not(A),or(B,B)))),inference(resolution,[status(thm)],[168889952,176657744]),[]).
%
% fof(axiom_1_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),[]).
%
% cnf(168834728,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(176824008,plain,(theorem(or(not(A),A))),inference(resolution,[status(thm)],[176806504,168834728]),[]).
%
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),[]).
%
% cnf(168874264,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
%
% cnf(176916704,plain,(theorem(or(B,A))|~theorem(or(A,B))),inference(resolution,[status(thm)],[168874264,168838568]),[]).
%
% cnf(181292384,plain,(theorem(or(A,not(A)))),inference(resolution,[status(thm)],[176824008,176916704]),[]).
%
% cnf(187581128,plain,(theorem(or(not(or(A,B)),not(not(or(B,A)))))),inference(resolution,[status(thm)],[187495928,181292384]),[]).
%
% fof(prove_this,plain,(~theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p)))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL238-1.tptp',unknown),[]).
%
% cnf(168894424,plain,(~theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p)))))),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[187581128,168894424,176916704]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------