TSTP Solution File: SWV231+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV231+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:25:50 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 282 ( 197 equ)
% Maximal formula atoms : 47 ( 14 avg)
% Number of connectives : 412 ( 149 ~; 63 |; 183 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 40 ( 5 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(34,conjecture,
( ( ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> a_select3(q_ds1_filter,X4,X5) = a_select3(q_ds1_filter,X5,X4) )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n2)
& leq(X7,n2) )
=> a_select3(r_ds1_filter,X6,X7) = a_select3(r_ds1_filter,X7,X6) ) )
=> ! [X8,X9] :
( ( leq(n0,X8)
& leq(n0,X9)
& leq(X8,n5)
& leq(X9,n5) )
=> ( ( ~ ( n0 = X9
& n4 = X8 )
& ~ ( n0 = X9
& n5 = X8 )
& ~ ( n1 = X9
& n4 = X8 )
& ~ ( n1 = X9
& n5 = X8 )
& ~ ( n2 = X9
& n4 = X8 )
& ~ ( n2 = X9
& n5 = X8 )
& ~ ( n3 = X8
& n5 = X9 )
& ~ ( n3 = X9
& n4 = X8 )
& ~ ( n3 = X9
& n5 = X8 )
& ~ ( n4 = X8
& n4 = X9 )
& ~ ( n4 = X8
& n5 = X9 )
& ~ ( n4 = X9
& n5 = X8 )
& ~ ( n5 = X8
& n5 = X9 )
& n3 = X8
& n4 = X9
& n5 = X8
& n5 = X9 )
=> n0 = a_select2(xinit_noise,n5) ) ) ),
file('/tmp/tmpHWx-Cg/sel_SWV231+1.p_1',quaternion_ds1_symm_0801) ).
fof(57,negated_conjecture,
~ ( ( ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> a_select3(q_ds1_filter,X4,X5) = a_select3(q_ds1_filter,X5,X4) )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n2)
& leq(X7,n2) )
=> a_select3(r_ds1_filter,X6,X7) = a_select3(r_ds1_filter,X7,X6) ) )
=> ! [X8,X9] :
( ( leq(n0,X8)
& leq(n0,X9)
& leq(X8,n5)
& leq(X9,n5) )
=> ( ( ~ ( n0 = X9
& n4 = X8 )
& ~ ( n0 = X9
& n5 = X8 )
& ~ ( n1 = X9
& n4 = X8 )
& ~ ( n1 = X9
& n5 = X8 )
& ~ ( n2 = X9
& n4 = X8 )
& ~ ( n2 = X9
& n5 = X8 )
& ~ ( n3 = X8
& n5 = X9 )
& ~ ( n3 = X9
& n4 = X8 )
& ~ ( n3 = X9
& n5 = X8 )
& ~ ( n4 = X8
& n4 = X9 )
& ~ ( n4 = X8
& n5 = X9 )
& ~ ( n4 = X9
& n5 = X8 )
& ~ ( n5 = X8
& n5 = X9 )
& n3 = X8
& n4 = X9
& n5 = X8
& n5 = X9 )
=> n0 = a_select2(xinit_noise,n5) ) ) ),
inference(assume_negation,[status(cth)],[34]) ).
fof(59,plain,
( epred1_0
=> ( ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> a_select3(q_ds1_filter,X4,X5) = a_select3(q_ds1_filter,X5,X4) )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n2)
& leq(X7,n2) )
=> a_select3(r_ds1_filter,X6,X7) = a_select3(r_ds1_filter,X7,X6) ) ) ),
introduced(definition) ).
fof(60,plain,
! [X8,X9] :
( epred2_2(X9,X8)
=> ( ~ ( n0 = X9
& n4 = X8 )
& ~ ( n0 = X9
& n5 = X8 )
& ~ ( n1 = X9
& n4 = X8 )
& ~ ( n1 = X9
& n5 = X8 )
& ~ ( n2 = X9
& n4 = X8 )
& ~ ( n2 = X9
& n5 = X8 )
& ~ ( n3 = X8
& n5 = X9 )
& ~ ( n3 = X9
& n4 = X8 )
& ~ ( n3 = X9
& n5 = X8 )
& ~ ( n4 = X8
& n4 = X9 )
& ~ ( n4 = X8
& n5 = X9 )
& ~ ( n4 = X9
& n5 = X8 )
& ~ ( n5 = X8
& n5 = X9 )
& n3 = X8
& n4 = X9
& n5 = X8
& n5 = X9 ) ),
introduced(definition) ).
fof(61,negated_conjecture,
~ ( epred1_0
=> ! [X8,X9] :
( ( leq(n0,X8)
& leq(n0,X9)
& leq(X8,n5)
& leq(X9,n5) )
=> ( epred2_2(X9,X8)
=> n0 = a_select2(xinit_noise,n5) ) ) ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[57,59,theory(equality)]),60,theory(equality)]) ).
fof(127,negated_conjecture,
( epred1_0
& ? [X8,X9] :
( leq(n0,X8)
& leq(n0,X9)
& leq(X8,n5)
& leq(X9,n5)
& epred2_2(X9,X8)
& n0 != a_select2(xinit_noise,n5) ) ),
inference(fof_nnf,[status(thm)],[61]) ).
fof(128,negated_conjecture,
( epred1_0
& ? [X10,X11] :
( leq(n0,X10)
& leq(n0,X11)
& leq(X10,n5)
& leq(X11,n5)
& epred2_2(X11,X10)
& n0 != a_select2(xinit_noise,n5) ) ),
inference(variable_rename,[status(thm)],[127]) ).
fof(129,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n5)
& leq(esk2_0,n5)
& epred2_2(esk2_0,esk1_0)
& n0 != a_select2(xinit_noise,n5) ),
inference(skolemize,[status(esa)],[128]) ).
cnf(131,negated_conjecture,
epred2_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[129]) ).
fof(177,plain,
! [X8,X9] :
( ~ epred2_2(X9,X8)
| ( ( n0 != X9
| n4 != X8 )
& ( n0 != X9
| n5 != X8 )
& ( n1 != X9
| n4 != X8 )
& ( n1 != X9
| n5 != X8 )
& ( n2 != X9
| n4 != X8 )
& ( n2 != X9
| n5 != X8 )
& ( n3 != X8
| n5 != X9 )
& ( n3 != X9
| n4 != X8 )
& ( n3 != X9
| n5 != X8 )
& ( n4 != X8
| n4 != X9 )
& ( n4 != X8
| n5 != X9 )
& ( n4 != X9
| n5 != X8 )
& ( n5 != X8
| n5 != X9 )
& n3 = X8
& n4 = X9
& n5 = X8
& n5 = X9 ) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(178,plain,
! [X10,X11] :
( ~ epred2_2(X11,X10)
| ( ( n0 != X11
| n4 != X10 )
& ( n0 != X11
| n5 != X10 )
& ( n1 != X11
| n4 != X10 )
& ( n1 != X11
| n5 != X10 )
& ( n2 != X11
| n4 != X10 )
& ( n2 != X11
| n5 != X10 )
& ( n3 != X10
| n5 != X11 )
& ( n3 != X11
| n4 != X10 )
& ( n3 != X11
| n5 != X10 )
& ( n4 != X10
| n4 != X11 )
& ( n4 != X10
| n5 != X11 )
& ( n4 != X11
| n5 != X10 )
& ( n5 != X10
| n5 != X11 )
& n3 = X10
& n4 = X11
& n5 = X10
& n5 = X11 ) ),
inference(variable_rename,[status(thm)],[177]) ).
fof(179,plain,
! [X10,X11] :
( ( n0 != X11
| n4 != X10
| ~ epred2_2(X11,X10) )
& ( n0 != X11
| n5 != X10
| ~ epred2_2(X11,X10) )
& ( n1 != X11
| n4 != X10
| ~ epred2_2(X11,X10) )
& ( n1 != X11
| n5 != X10
| ~ epred2_2(X11,X10) )
& ( n2 != X11
| n4 != X10
| ~ epred2_2(X11,X10) )
& ( n2 != X11
| n5 != X10
| ~ epred2_2(X11,X10) )
& ( n3 != X10
| n5 != X11
| ~ epred2_2(X11,X10) )
& ( n3 != X11
| n4 != X10
| ~ epred2_2(X11,X10) )
& ( n3 != X11
| n5 != X10
| ~ epred2_2(X11,X10) )
& ( n4 != X10
| n4 != X11
| ~ epred2_2(X11,X10) )
& ( n4 != X10
| n5 != X11
| ~ epred2_2(X11,X10) )
& ( n4 != X11
| n5 != X10
| ~ epred2_2(X11,X10) )
& ( n5 != X10
| n5 != X11
| ~ epred2_2(X11,X10) )
& ( n3 = X10
| ~ epred2_2(X11,X10) )
& ( n4 = X11
| ~ epred2_2(X11,X10) )
& ( n5 = X10
| ~ epred2_2(X11,X10) )
& ( n5 = X11
| ~ epred2_2(X11,X10) ) ),
inference(distribute,[status(thm)],[178]) ).
cnf(180,plain,
( n5 = X1
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[179]) ).
cnf(181,plain,
( n5 = X2
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[179]) ).
cnf(184,plain,
( ~ epred2_2(X1,X2)
| n5 != X1
| n5 != X2 ),
inference(split_conjunct,[status(thm)],[179]) ).
cnf(223,plain,
( n5 != X2
| ~ epred2_2(X1,X2) ),
inference(csr,[status(thm)],[184,180]) ).
cnf(224,plain,
~ epred2_2(X1,X2),
inference(csr,[status(thm)],[223,181]) ).
cnf(225,negated_conjecture,
$false,
inference(sr,[status(thm)],[131,224,theory(equality)]) ).
cnf(226,negated_conjecture,
$false,
225,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV231+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpHWx-Cg/sel_SWV231+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV231+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV231+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV231+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
%
%------------------------------------------------------------------------------