TSTP Solution File: SWV107+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV107+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:37 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 : 36 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 30 ( 3 ~; 0 |; 13 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(26,axiom,
true,
file('/tmp/tmpb5-_kQ/sel_SWV107+1.p_1',ttrue) ).
fof(55,conjecture,
( geq(minus(n3,n1),n0)
=> ( geq(minus(n6,n1),n0)
=> ( ( geq(n2,n0)
& geq(minus(n999,n1),n0) )
=> ( geq(minus(n6,n1),n0)
=> ( geq(minus(n6,n1),n0)
=> ( geq(minus(n6,n1),n0)
=> ( ( geq(minus(n3,n1),n0)
& geq(minus(n999,n1),n0) )
=> true ) ) ) ) ) ) ),
file('/tmp/tmpb5-_kQ/sel_SWV107+1.p_1',quaternion_ds1_inuse_0019) ).
fof(81,negated_conjecture,
~ ( geq(minus(n3,n1),n0)
=> ( geq(minus(n6,n1),n0)
=> ( ( geq(n2,n0)
& geq(minus(n999,n1),n0) )
=> ( geq(minus(n6,n1),n0)
=> ( geq(minus(n6,n1),n0)
=> ( geq(minus(n6,n1),n0)
=> ( ( geq(minus(n3,n1),n0)
& geq(minus(n999,n1),n0) )
=> true ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[55]) ).
cnf(145,plain,
true,
inference(split_conjunct,[status(thm)],[26]) ).
fof(184,negated_conjecture,
( geq(minus(n3,n1),n0)
& geq(minus(n6,n1),n0)
& geq(n2,n0)
& geq(minus(n999,n1),n0)
& geq(minus(n6,n1),n0)
& geq(minus(n6,n1),n0)
& geq(minus(n6,n1),n0)
& geq(minus(n3,n1),n0)
& geq(minus(n999,n1),n0)
& ~ true ),
inference(fof_nnf,[status(thm)],[81]) ).
cnf(185,negated_conjecture,
~ true,
inference(split_conjunct,[status(thm)],[184]) ).
cnf(259,negated_conjecture,
$false,
inference(rw,[status(thm)],[185,145,theory(equality)]) ).
cnf(260,negated_conjecture,
$false,
inference(cn,[status(thm)],[259,theory(equality)]) ).
cnf(261,negated_conjecture,
$false,
260,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV107+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpb5-_kQ/sel_SWV107+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV107+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV107+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV107+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
%
%------------------------------------------------------------------------------