TSTP Solution File: LCL171-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL171-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art07.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:33 EDT 2009
% Result : Unsatisfiable 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 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 : 8 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(rule_1,plain,
! [A] :
( theorem(A)
| ~ axiom(A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL171-1.tptp',unknown),
[] ).
cnf(155245888,plain,
( theorem(A)
| ~ axiom(A) ),
inference(rewrite,[status(thm)],[rule_1]),
[] ).
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/LCL171-1.tptp',unknown),
[] ).
cnf(155223376,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(rewrite,[status(thm)],[axiom_1_4]),
[] ).
cnf(163264960,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(resolution,[status(thm)],[155245888,155223376]),
[] ).
fof(prove_this,plain,
~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p)))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL171-1.tptp',unknown),
[] ).
cnf(155283304,plain,
~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p)))),
inference(rewrite,[status(thm)],[prove_this]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[163264960,155283304]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL171-1.tptp',unknown),[]).
%
% cnf(155245888,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
%
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL171-1.tptp',unknown),[]).
%
% cnf(155223376,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
%
% cnf(163264960,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[155245888,155223376]),[]).
%
% fof(prove_this,plain,(~theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL171-1.tptp',unknown),[]).
%
% cnf(155283304,plain,(~theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))),inference(rewrite,[status(thm)],[prove_this]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[163264960,155283304]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------