TSTP Solution File: SYN416+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN416+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 13:25:25 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 5 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 13 ( 4 ~; 2 |; 3 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 )
| ( q
=> p ) ),
file('/tmp/tmpLYKR6V/sel_SYN416+1.p_1',pel16) ).
fof(2,negated_conjecture,
~ ( ( p
=> q )
| ( q
=> p ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( p
& ~ q
& q
& ~ p ),
inference(fof_nnf,[status(thm)],[2]) ).
cnf(4,negated_conjecture,
~ p,
inference(split_conjunct,[status(thm)],[3]) ).
cnf(7,negated_conjecture,
p,
inference(split_conjunct,[status(thm)],[3]) ).
cnf(8,negated_conjecture,
$false,
inference(rw,[status(thm)],[4,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
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN416+1.p
% --creating new selector for []
% -running prover on /tmp/tmpLYKR6V/sel_SYN416+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN416+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN416+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN416+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
%
%------------------------------------------------------------------------------