TSTP Solution File: SWV105+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV105+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 12:06:14 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 6 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 12 ( 3 ~; 0 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(26,axiom,
true,
file('/tmp/tmpLIGmvi/sel_SWV105+1.p_1',ttrue) ).
fof(59,conjecture,
( ( leq(n0,pv43)
& leq(pv43,minus(n6,n1)) )
=> ( lt(n0,a_select2(sigma,pv43))
=> true ) ),
file('/tmp/tmpLIGmvi/sel_SWV105+1.p_1',quaternion_ds1_inuse_0017) ).
fof(73,negated_conjecture,
~ ( ( leq(n0,pv43)
& leq(pv43,minus(n6,n1)) )
=> ( lt(n0,a_select2(sigma,pv43))
=> true ) ),
inference(assume_negation,[status(cth)],[59]) ).
cnf(137,plain,
true,
inference(split_conjunct,[status(thm)],[26]) ).
fof(182,negated_conjecture,
( leq(n0,pv43)
& leq(pv43,minus(n6,n1))
& lt(n0,a_select2(sigma,pv43))
& ~ true ),
inference(fof_nnf,[status(thm)],[73]) ).
cnf(183,negated_conjecture,
~ true,
inference(split_conjunct,[status(thm)],[182]) ).
cnf(237,negated_conjecture,
$false,
inference(rw,[status(thm)],[183,137,theory(equality)]) ).
cnf(238,negated_conjecture,
$false,
inference(cn,[status(thm)],[237,theory(equality)]) ).
cnf(239,negated_conjecture,
$false,
238,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV105+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpLIGmvi/sel_SWV105+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV105+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV105+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV105+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
%
%------------------------------------------------------------------------------