TSTP Solution File: LCL236-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL236-1 : TPTP v3.4.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art09.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:07 EDT 2009
% Result : Unsatisfiable 0.1s
% Output : Refutation 0.1s
% 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 : 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 : 30 ( 2 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL236-1.tptp',unknown),
[] ).
cnf(154532152,plain,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(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/LCL236-1.tptp',unknown),
[] ).
cnf(154511992,plain,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
inference(rewrite,[status(thm)],[rule_2]),
[] ).
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/LCL236-1.tptp',unknown),
[] ).
cnf(154472208,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(162436784,plain,
( theorem(or(B,A))
| ~ theorem(or(A,B)) ),
inference(resolution,[status(thm)],[154511992,154472208]),
[] ).
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/LCL236-1.tptp',unknown),
[] ).
cnf(154527680,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/LCL236-1.tptp',unknown),
[] ).
cnf(154468368,plain,
axiom(or(not(A),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_3]),
[] ).
cnf(162371936,plain,
( theorem(or(not(A),B))
| ~ theorem(or(not(or(C,A)),B)) ),
inference(resolution,[status(thm)],[154527680,154468368]),
[] ).
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL236-1.tptp',unknown),
[] ).
cnf(154494720,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/LCL236-1.tptp',unknown),
[] ).
cnf(154464200,plain,
axiom(or(not(or(A,A)),A)),
inference(rewrite,[status(thm)],[axiom_1_2]),
[] ).
cnf(162295344,plain,
theorem(or(not(or(A,A)),A)),
inference(resolution,[status(thm)],[154494720,154464200]),
[] ).
cnf(162418696,plain,
theorem(or(not(A),A)),
inference(resolution,[status(thm)],[162371936,162295344]),
[] ).
cnf(163019024,plain,
theorem(or(A,not(A))),
inference(resolution,[status(thm)],[162436784,162418696]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[154532152,163019024]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q))))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL236-1.tptp',unknown),[]).
%
% cnf(154532152,plain,(~theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(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/LCL236-1.tptp',unknown),[]).
%
% cnf(154511992,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
%
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL236-1.tptp',unknown),[]).
%
% cnf(154472208,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(162436784,plain,(theorem(or(B,A))|~theorem(or(A,B))),inference(resolution,[status(thm)],[154511992,154472208]),[]).
%
% 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/LCL236-1.tptp',unknown),[]).
%
% cnf(154527680,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/LCL236-1.tptp',unknown),[]).
%
% cnf(154468368,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
%
% cnf(162371936,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[154527680,154468368]),[]).
%
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL236-1.tptp',unknown),[]).
%
% cnf(154494720,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/LCL236-1.tptp',unknown),[]).
%
% cnf(154464200,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
%
% cnf(162295344,plain,(theorem(or(not(or(A,A)),A))),inference(resolution,[status(thm)],[154494720,154464200]),[]).
%
% cnf(162418696,plain,(theorem(or(not(A),A))),inference(resolution,[status(thm)],[162371936,162295344]),[]).
%
% cnf(163019024,plain,(theorem(or(A,not(A)))),inference(resolution,[status(thm)],[162436784,162418696]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[154532152,163019024]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------