TSTP Solution File: SWV232+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV232+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 12:30:20 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 210 ( 127 equ)
% Maximal formula atoms : 29 ( 11 avg)
% Number of connectives : 297 ( 106 ~; 55 |; 123 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 42 ( 5 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(35,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) )
=> ( ( ~ ( n0 = X6
& n1 = X7 )
& ~ ( n0 = X6
& n2 = X7 )
& ~ ( n0 = X7
& n2 = X6 )
& ~ ( n1 = X6
& n1 = X7 )
& ~ ( n1 = X6
& n2 = X7 )
& ~ ( n1 = X7
& n2 = X6 )
& ~ ( n2 = X6
& n2 = X7 )
& n0 = X7
& n1 = X6
& n1 = X7
& n2 = X6 )
=> a_select2(rho,n1) = n0 ) ) ),
file('/tmp/tmpRmD7zF/sel_SWV232+1.p_1',quaternion_ds1_symm_0841) ).
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) )
=> ( ( ~ ( n0 = X6
& n1 = X7 )
& ~ ( n0 = X6
& n2 = X7 )
& ~ ( n0 = X7
& n2 = X6 )
& ~ ( n1 = X6
& n1 = X7 )
& ~ ( n1 = X6
& n2 = X7 )
& ~ ( n1 = X7
& n2 = X6 )
& ~ ( n2 = X6
& n2 = X7 )
& n0 = X7
& n1 = X6
& n1 = X7
& n2 = X6 )
=> a_select2(rho,n1) = n0 ) ) ),
inference(assume_negation,[status(cth)],[35]) ).
fof(59,plain,
! [X7,X6] :
( epred1_2(X6,X7)
=> ( ~ ( n0 = X6
& n1 = X7 )
& ~ ( n0 = X6
& n2 = X7 )
& ~ ( n0 = X7
& n2 = X6 )
& ~ ( n1 = X6
& n1 = X7 )
& ~ ( n1 = X6
& n2 = X7 )
& ~ ( n1 = X7
& n2 = X6 )
& ~ ( n2 = X6
& n2 = X7 )
& n0 = X7
& n1 = X6
& n1 = X7
& n2 = X6 ) ),
introduced(definition) ).
fof(60,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) )
=> ( epred1_2(X6,X7)
=> a_select2(rho,n1) = n0 ) ) ),
inference(apply_def,[status(esa)],[57,59,theory(equality)]) ).
fof(127,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)
& epred1_2(X6,X7)
& a_select2(rho,n1) != n0 ) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(128,negated_conjecture,
( ! [X8,X9] :
( ~ leq(n0,X8)
| ~ leq(n0,X9)
| ~ leq(X8,n5)
| ~ leq(X9,n5)
| a_select3(q_ds1_filter,X8,X9) = a_select3(q_ds1_filter,X9,X8) )
& ? [X10,X11] :
( leq(n0,X10)
& leq(n0,X11)
& leq(X10,n2)
& leq(X11,n2)
& epred1_2(X10,X11)
& a_select2(rho,n1) != n0 ) ),
inference(variable_rename,[status(thm)],[127]) ).
fof(129,negated_conjecture,
( ! [X8,X9] :
( ~ leq(n0,X8)
| ~ leq(n0,X9)
| ~ leq(X8,n5)
| ~ leq(X9,n5)
| a_select3(q_ds1_filter,X8,X9) = a_select3(q_ds1_filter,X9,X8) )
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(esk2_0,n2)
& epred1_2(esk1_0,esk2_0)
& a_select2(rho,n1) != n0 ),
inference(skolemize,[status(esa)],[128]) ).
fof(130,negated_conjecture,
! [X8,X9] :
( ( ~ leq(n0,X8)
| ~ leq(n0,X9)
| ~ leq(X8,n5)
| ~ leq(X9,n5)
| a_select3(q_ds1_filter,X8,X9) = a_select3(q_ds1_filter,X9,X8) )
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(esk2_0,n2)
& epred1_2(esk1_0,esk2_0)
& a_select2(rho,n1) != n0 ),
inference(shift_quantors,[status(thm)],[129]) ).
cnf(132,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[130]) ).
fof(171,plain,
! [X7,X6] :
( ~ epred1_2(X6,X7)
| ( ( n0 != X6
| n1 != X7 )
& ( n0 != X6
| n2 != X7 )
& ( n0 != X7
| n2 != X6 )
& ( n1 != X6
| n1 != X7 )
& ( n1 != X6
| n2 != X7 )
& ( n1 != X7
| n2 != X6 )
& ( n2 != X6
| n2 != X7 )
& n0 = X7
& n1 = X6
& n1 = X7
& n2 = X6 ) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(172,plain,
! [X8,X9] :
( ~ epred1_2(X9,X8)
| ( ( n0 != X9
| n1 != X8 )
& ( n0 != X9
| n2 != X8 )
& ( n0 != X8
| n2 != X9 )
& ( n1 != X9
| n1 != X8 )
& ( n1 != X9
| n2 != X8 )
& ( n1 != X8
| n2 != X9 )
& ( n2 != X9
| n2 != X8 )
& n0 = X8
& n1 = X9
& n1 = X8
& n2 = X9 ) ),
inference(variable_rename,[status(thm)],[171]) ).
fof(173,plain,
! [X8,X9] :
( ( n0 != X9
| n1 != X8
| ~ epred1_2(X9,X8) )
& ( n0 != X9
| n2 != X8
| ~ epred1_2(X9,X8) )
& ( n0 != X8
| n2 != X9
| ~ epred1_2(X9,X8) )
& ( n1 != X9
| n1 != X8
| ~ epred1_2(X9,X8) )
& ( n1 != X9
| n2 != X8
| ~ epred1_2(X9,X8) )
& ( n1 != X8
| n2 != X9
| ~ epred1_2(X9,X8) )
& ( n2 != X9
| n2 != X8
| ~ epred1_2(X9,X8) )
& ( n0 = X8
| ~ epred1_2(X9,X8) )
& ( n1 = X9
| ~ epred1_2(X9,X8) )
& ( n1 = X8
| ~ epred1_2(X9,X8) )
& ( n2 = X9
| ~ epred1_2(X9,X8) ) ),
inference(distribute,[status(thm)],[172]) ).
cnf(175,plain,
( n1 = X2
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[173]) ).
cnf(176,plain,
( n1 = X1
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[173]) ).
cnf(181,plain,
( ~ epred1_2(X1,X2)
| n1 != X2
| n1 != X1 ),
inference(split_conjunct,[status(thm)],[173]) ).
cnf(213,plain,
( n1 != X2
| ~ epred1_2(X1,X2) ),
inference(csr,[status(thm)],[181,176]) ).
cnf(214,plain,
~ epred1_2(X1,X2),
inference(csr,[status(thm)],[213,175]) ).
cnf(215,negated_conjecture,
$false,
inference(sr,[status(thm)],[132,214,theory(equality)]) ).
cnf(216,negated_conjecture,
$false,
215,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV232+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpRmD7zF/sel_SWV232+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV232+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV232+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV232+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
%
%------------------------------------------------------------------------------