TSTP Solution File: SWV211+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV211+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:24:22 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 526 ( 449 equ)
% Maximal formula atoms : 111 ( 29 avg)
% Number of connectives : 876 ( 368 ~; 150 |; 351 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 17 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 28 ( 5 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(39,conjecture,
! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> ( ( ~ ( n0 = X4
& n1 = X5 )
& ~ ( n0 = X4
& n2 = X5 )
& ~ ( n0 = X4
& n3 = X5 )
& ~ ( n0 = X4
& n4 = X5 )
& ~ ( n0 = X4
& n5 = X5 )
& ~ ( n0 = X5
& n1 = X4 )
& ~ ( n0 = X5
& n2 = X4 )
& ~ ( n0 = X5
& n3 = X4 )
& ~ ( n0 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X4
& n1 = X5 )
& ~ ( n1 = X4
& n2 = X5 )
& ~ ( n1 = X4
& n3 = X5 )
& ~ ( n1 = X4
& n4 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n1 = X5
& n2 = X4 )
& ~ ( n1 = X5
& n3 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X4
& n2 = X5 )
& ~ ( n2 = X4
& n3 = X5 )
& ~ ( n2 = X4
& n4 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n3 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n3 = X5 )
& ~ ( n3 = X4
& n4 = X5 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n4 = X4 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n4 = X5 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n0 = X4
& n0 = X5
& n1 = X4 )
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
file('/tmp/tmpEx9_g-/sel_SWV211+1.p_1',quaternion_ds1_symm_0001) ).
fof(64,negated_conjecture,
~ ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> ( ( ~ ( n0 = X4
& n1 = X5 )
& ~ ( n0 = X4
& n2 = X5 )
& ~ ( n0 = X4
& n3 = X5 )
& ~ ( n0 = X4
& n4 = X5 )
& ~ ( n0 = X4
& n5 = X5 )
& ~ ( n0 = X5
& n1 = X4 )
& ~ ( n0 = X5
& n2 = X4 )
& ~ ( n0 = X5
& n3 = X4 )
& ~ ( n0 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X4
& n1 = X5 )
& ~ ( n1 = X4
& n2 = X5 )
& ~ ( n1 = X4
& n3 = X5 )
& ~ ( n1 = X4
& n4 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n1 = X5
& n2 = X4 )
& ~ ( n1 = X5
& n3 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X4
& n2 = X5 )
& ~ ( n2 = X4
& n3 = X5 )
& ~ ( n2 = X4
& n4 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n3 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n3 = X5 )
& ~ ( n3 = X4
& n4 = X5 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n4 = X4 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n4 = X5 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n0 = X4
& n0 = X5
& n1 = X4 )
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
inference(assume_negation,[status(cth)],[39]) ).
fof(66,plain,
! [X5,X4] :
( epred1_2(X4,X5)
=> ( ~ ( n0 = X4
& n1 = X5 )
& ~ ( n0 = X4
& n2 = X5 )
& ~ ( n0 = X4
& n3 = X5 )
& ~ ( n0 = X4
& n4 = X5 )
& ~ ( n0 = X4
& n5 = X5 )
& ~ ( n0 = X5
& n1 = X4 )
& ~ ( n0 = X5
& n2 = X4 )
& ~ ( n0 = X5
& n3 = X4 )
& ~ ( n0 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X4
& n1 = X5 )
& ~ ( n1 = X4
& n2 = X5 )
& ~ ( n1 = X4
& n3 = X5 )
& ~ ( n1 = X4
& n4 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n1 = X5
& n2 = X4 )
& ~ ( n1 = X5
& n3 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X4
& n2 = X5 )
& ~ ( n2 = X4
& n3 = X5 )
& ~ ( n2 = X4
& n4 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n3 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n3 = X5 )
& ~ ( n3 = X4
& n4 = X5 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n4 = X4 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n4 = X5 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n0 = X4
& n0 = X5
& n1 = X4 ) ),
introduced(definition) ).
fof(67,negated_conjecture,
~ ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> ( epred1_2(X4,X5)
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
inference(apply_def,[status(esa)],[64,66,theory(equality)]) ).
fof(138,negated_conjecture,
? [X4,X5] :
( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5)
& epred1_2(X4,X5)
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(139,negated_conjecture,
? [X6,X7] :
( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n5)
& leq(X7,n5)
& epred1_2(X6,X7)
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(variable_rename,[status(thm)],[138]) ).
fof(140,negated_conjecture,
( leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n5)
& leq(esk2_0,n5)
& epred1_2(esk1_0,esk2_0)
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(skolemize,[status(esa)],[139]) ).
cnf(142,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[140]) ).
fof(183,plain,
! [X5,X4] :
( ~ epred1_2(X4,X5)
| ( ( n0 != X4
| n1 != X5 )
& ( n0 != X4
| n2 != X5 )
& ( n0 != X4
| n3 != X5 )
& ( n0 != X4
| n4 != X5 )
& ( n0 != X4
| n5 != X5 )
& ( n0 != X5
| n1 != X4 )
& ( n0 != X5
| n2 != X4 )
& ( n0 != X5
| n3 != X4 )
& ( n0 != X5
| n4 != X4 )
& ( n0 != X5
| n5 != X4 )
& ( n1 != X4
| n1 != X5 )
& ( n1 != X4
| n2 != X5 )
& ( n1 != X4
| n3 != X5 )
& ( n1 != X4
| n4 != X5 )
& ( n1 != X4
| n5 != X5 )
& ( n1 != X5
| n2 != X4 )
& ( n1 != X5
| n3 != X4 )
& ( n1 != X5
| n4 != X4 )
& ( n1 != X5
| n5 != X4 )
& ( n2 != X4
| n2 != X5 )
& ( n2 != X4
| n3 != X5 )
& ( n2 != X4
| n4 != X5 )
& ( n2 != X4
| n5 != X5 )
& ( n2 != X5
| n3 != X4 )
& ( n2 != X5
| n4 != X4 )
& ( n2 != X5
| n5 != X4 )
& ( n3 != X4
| n3 != X5 )
& ( n3 != X4
| n4 != X5 )
& ( n3 != X4
| n5 != X5 )
& ( n3 != X5
| n4 != X4 )
& ( n3 != X5
| n5 != X4 )
& ( n4 != X4
| n4 != X5 )
& ( n4 != X4
| n5 != X5 )
& ( n4 != X5
| n5 != X4 )
& ( n5 != X4
| n5 != X5 )
& n0 = X4
& n0 = X5
& n1 = X4 ) ),
inference(fof_nnf,[status(thm)],[66]) ).
fof(184,plain,
! [X6,X7] :
( ~ epred1_2(X7,X6)
| ( ( n0 != X7
| n1 != X6 )
& ( n0 != X7
| n2 != X6 )
& ( n0 != X7
| n3 != X6 )
& ( n0 != X7
| n4 != X6 )
& ( n0 != X7
| n5 != X6 )
& ( n0 != X6
| n1 != X7 )
& ( n0 != X6
| n2 != X7 )
& ( n0 != X6
| n3 != X7 )
& ( n0 != X6
| n4 != X7 )
& ( n0 != X6
| n5 != X7 )
& ( n1 != X7
| n1 != X6 )
& ( n1 != X7
| n2 != X6 )
& ( n1 != X7
| n3 != X6 )
& ( n1 != X7
| n4 != X6 )
& ( n1 != X7
| n5 != X6 )
& ( n1 != X6
| n2 != X7 )
& ( n1 != X6
| n3 != X7 )
& ( n1 != X6
| n4 != X7 )
& ( n1 != X6
| n5 != X7 )
& ( n2 != X7
| n2 != X6 )
& ( n2 != X7
| n3 != X6 )
& ( n2 != X7
| n4 != X6 )
& ( n2 != X7
| n5 != X6 )
& ( n2 != X6
| n3 != X7 )
& ( n2 != X6
| n4 != X7 )
& ( n2 != X6
| n5 != X7 )
& ( n3 != X7
| n3 != X6 )
& ( n3 != X7
| n4 != X6 )
& ( n3 != X7
| n5 != X6 )
& ( n3 != X6
| n4 != X7 )
& ( n3 != X6
| n5 != X7 )
& ( n4 != X7
| n4 != X6 )
& ( n4 != X7
| n5 != X6 )
& ( n4 != X6
| n5 != X7 )
& ( n5 != X7
| n5 != X6 )
& n0 = X7
& n0 = X6
& n1 = X7 ) ),
inference(variable_rename,[status(thm)],[183]) ).
fof(185,plain,
! [X6,X7] :
( ( n0 != X7
| n1 != X6
| ~ epred1_2(X7,X6) )
& ( n0 != X7
| n2 != X6
| ~ epred1_2(X7,X6) )
& ( n0 != X7
| n3 != X6
| ~ epred1_2(X7,X6) )
& ( n0 != X7
| n4 != X6
| ~ epred1_2(X7,X6) )
& ( n0 != X7
| n5 != X6
| ~ epred1_2(X7,X6) )
& ( n0 != X6
| n1 != X7
| ~ epred1_2(X7,X6) )
& ( n0 != X6
| n2 != X7
| ~ epred1_2(X7,X6) )
& ( n0 != X6
| n3 != X7
| ~ epred1_2(X7,X6) )
& ( n0 != X6
| n4 != X7
| ~ epred1_2(X7,X6) )
& ( n0 != X6
| n5 != X7
| ~ epred1_2(X7,X6) )
& ( n1 != X7
| n1 != X6
| ~ epred1_2(X7,X6) )
& ( n1 != X7
| n2 != X6
| ~ epred1_2(X7,X6) )
& ( n1 != X7
| n3 != X6
| ~ epred1_2(X7,X6) )
& ( n1 != X7
| n4 != X6
| ~ epred1_2(X7,X6) )
& ( n1 != X7
| n5 != X6
| ~ epred1_2(X7,X6) )
& ( n1 != X6
| n2 != X7
| ~ epred1_2(X7,X6) )
& ( n1 != X6
| n3 != X7
| ~ epred1_2(X7,X6) )
& ( n1 != X6
| n4 != X7
| ~ epred1_2(X7,X6) )
& ( n1 != X6
| n5 != X7
| ~ epred1_2(X7,X6) )
& ( n2 != X7
| n2 != X6
| ~ epred1_2(X7,X6) )
& ( n2 != X7
| n3 != X6
| ~ epred1_2(X7,X6) )
& ( n2 != X7
| n4 != X6
| ~ epred1_2(X7,X6) )
& ( n2 != X7
| n5 != X6
| ~ epred1_2(X7,X6) )
& ( n2 != X6
| n3 != X7
| ~ epred1_2(X7,X6) )
& ( n2 != X6
| n4 != X7
| ~ epred1_2(X7,X6) )
& ( n2 != X6
| n5 != X7
| ~ epred1_2(X7,X6) )
& ( n3 != X7
| n3 != X6
| ~ epred1_2(X7,X6) )
& ( n3 != X7
| n4 != X6
| ~ epred1_2(X7,X6) )
& ( n3 != X7
| n5 != X6
| ~ epred1_2(X7,X6) )
& ( n3 != X6
| n4 != X7
| ~ epred1_2(X7,X6) )
& ( n3 != X6
| n5 != X7
| ~ epred1_2(X7,X6) )
& ( n4 != X7
| n4 != X6
| ~ epred1_2(X7,X6) )
& ( n4 != X7
| n5 != X6
| ~ epred1_2(X7,X6) )
& ( n4 != X6
| n5 != X7
| ~ epred1_2(X7,X6) )
& ( n5 != X7
| n5 != X6
| ~ epred1_2(X7,X6) )
& ( n0 = X7
| ~ epred1_2(X7,X6) )
& ( n0 = X6
| ~ epred1_2(X7,X6) )
& ( n1 = X7
| ~ epred1_2(X7,X6) ) ),
inference(distribute,[status(thm)],[184]) ).
cnf(186,plain,
( n1 = X1
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[185]) ).
cnf(187,plain,
( n0 = X2
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[185]) ).
cnf(218,plain,
( ~ epred1_2(X1,X2)
| n1 != X1
| n0 != X2 ),
inference(split_conjunct,[status(thm)],[185]) ).
cnf(279,plain,
( n1 != X1
| ~ epred1_2(X1,X2) ),
inference(csr,[status(thm)],[218,187]) ).
cnf(280,plain,
~ epred1_2(X1,X2),
inference(csr,[status(thm)],[279,186]) ).
cnf(281,negated_conjecture,
$false,
inference(sr,[status(thm)],[142,280,theory(equality)]) ).
cnf(282,negated_conjecture,
$false,
281,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV211+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpEx9_g-/sel_SWV211+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV211+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV211+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV211+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
%
%------------------------------------------------------------------------------