TSTP Solution File: SWV022+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV022+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 11:49:53 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 5 unt; 0 def)
% Number of atoms : 5 ( 3 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(54,conjecture,
init = init,
file('/tmp/tmpO1713n/sel_SWV022+1.p_1',gauss_init_0001) ).
fof(57,negated_conjecture,
init != init,
inference(assume_negation,[status(cth)],[54]) ).
fof(59,negated_conjecture,
init != init,
inference(fof_simplification,[status(thm)],[57,theory(equality)]) ).
cnf(157,negated_conjecture,
$false,
inference(split_conjunct,[status(thm)],[59]) ).
cnf(182,negated_conjecture,
$false,
157,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV022+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpO1713n/sel_SWV022+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV022+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV022+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV022+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
%
%------------------------------------------------------------------------------