TSTP Solution File: LCL176-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL176-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:44:51 EDT 2009
% Result : Unsatisfiable 0.2s
% Output : Refutation 0.2s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 26 ( 4 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(rule_2,plain,
! [A,B] :
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),
[] ).
cnf(143127048,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/LCL176-1.tptp',unknown),
[] ).
cnf(143109808,plain,
( theorem(A)
| ~ axiom(A) ),
inference(rewrite,[status(thm)],[rule_1]),
[] ).
fof(axiom_1_3,plain,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),
[] ).
cnf(143087640,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(151162848,plain,
theorem(or(not(A),or(B,A))),
inference(resolution,[status(thm)],[143109808,143087640]),
[] ).
cnf(151222848,plain,
( theorem(A)
| ~ axiom(or(not(or(not(B),or(C,B))),A)) ),
inference(resolution,[status(thm)],[143127048,151162848]),
[] ).
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/LCL176-1.tptp',unknown),
[] ).
cnf(143095408,plain,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(rewrite,[status(thm)],[axiom_1_5]),
[] ).
cnf(158678256,plain,
theorem(or(B,or(not(A),A))),
inference(resolution,[status(thm)],[151222848,143095408]),
[] ).
fof(axiom_1_2,plain,
! [A] : axiom(or(not(or(A,A)),A)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),
[] ).
cnf(143083504,plain,
axiom(or(not(or(A,A)),A)),
inference(rewrite,[status(thm)],[axiom_1_2]),
[] ).
cnf(151002976,plain,
( theorem(A)
| ~ theorem(or(A,A)) ),
inference(resolution,[status(thm)],[143127048,143083504]),
[] ).
fof(prove_this,plain,
~ theorem(or(not(p),p)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),
[] ).
cnf(143151144,plain,
~ theorem(or(not(p),p)),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
cnf(151021480,plain,
~ theorem(or(or(not(p),p),or(not(p),p))),
inference(resolution,[status(thm)],[151002976,143151144]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[158678256,151021480]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),[]).
%
% cnf(143127048,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/LCL176-1.tptp',unknown),[]).
%
% cnf(143109808,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
%
% fof(axiom_1_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),[]).
%
% cnf(143087640,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(151162848,plain,(theorem(or(not(A),or(B,A)))),inference(resolution,[status(thm)],[143109808,143087640]),[]).
%
% cnf(151222848,plain,(theorem(A)|~axiom(or(not(or(not(B),or(C,B))),A))),inference(resolution,[status(thm)],[143127048,151162848]),[]).
%
% 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/LCL176-1.tptp',unknown),[]).
%
% cnf(143095408,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
%
% cnf(158678256,plain,(theorem(or(B,or(not(A),A)))),inference(resolution,[status(thm)],[151222848,143095408]),[]).
%
% fof(axiom_1_2,plain,(axiom(or(not(or(A,A)),A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),[]).
%
% cnf(143083504,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
%
% cnf(151002976,plain,(theorem(A)|~theorem(or(A,A))),inference(resolution,[status(thm)],[143127048,143083504]),[]).
%
% fof(prove_this,plain,(~theorem(or(not(p),p))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL176-1.tptp',unknown),[]).
%
% cnf(143151144,plain,(~theorem(or(not(p),p))),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% cnf(151021480,plain,(~theorem(or(or(not(p),p),or(not(p),p)))),inference(resolution,[status(thm)],[151002976,143151144]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[158678256,151021480]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------