TSTP Solution File: SYN389+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN389+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 13:19:05 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 20 ( 6 ~; 4 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 3 ( 2 usr; 3 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ( p
=> q )
=> p )
=> p ),
file('/tmp/tmp1Hk1yI/sel_SYN389+1.p_1',pel8) ).
fof(2,negated_conjecture,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ( p
& ~ q )
| p )
& ~ p ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( p
| p )
& ( ~ q
| p )
& ~ p ),
inference(distribute,[status(thm)],[3]) ).
cnf(5,negated_conjecture,
~ p,
inference(split_conjunct,[status(thm)],[4]) ).
cnf(7,negated_conjecture,
( p
| p ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(8,negated_conjecture,
$false,
inference(rw,[status(thm)],[5,7,theory(equality)]) ).
cnf(9,negated_conjecture,
$false,
inference(cn,[status(thm)],[8,theory(equality)]) ).
cnf(10,negated_conjecture,
$false,
9,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN389+1.p
% --creating new selector for []
% -running prover on /tmp/tmp1Hk1yI/sel_SYN389+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN389+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN389+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN389+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------