TSTP Solution File: SWV104+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV104+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:02 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 20 unt; 0 def)
% Number of atoms : 131 ( 104 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 130 ( 43 ~; 57 |; 27 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 37 ( 3 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X4,X5,X1,X6,X7] :
( ( X4 != X5
& a_select2(X1,X5) = X6 )
=> a_select2(tptp_update2(X1,X4,X7),X5) = X6 ),
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',sel2_update_2) ).
fof(10,axiom,
! [X1,X5,X6] : a_select2(tptp_update2(X1,X5,X6),X5) = X6,
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',sel2_update_1) ).
fof(19,axiom,
! [X1] : ~ gt(X1,X1),
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',irreflexivity_gt) ).
fof(29,axiom,
gt(n5,n3),
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',gt_5_3) ).
fof(32,axiom,
gt(n5,n4),
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',gt_5_4) ).
fof(43,axiom,
gt(n4,n3),
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',gt_4_3) ).
fof(50,conjecture,
( ( a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use )
=> ( a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use ) ),
file('/tmp/tmppTnefy/sel_SWV104+1.p_1',quaternion_ds1_inuse_0016) ).
fof(61,negated_conjecture,
~ ( ( a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use )
=> ( a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use ) ),
inference(assume_negation,[status(cth)],[50]) ).
fof(62,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[19,theory(equality)]) ).
fof(79,plain,
! [X4,X5,X1,X6,X7] :
( X4 = X5
| a_select2(X1,X5) != X6
| a_select2(tptp_update2(X1,X4,X7),X5) = X6 ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(80,plain,
! [X8,X9,X10,X11,X12] :
( X8 = X9
| a_select2(X10,X9) != X11
| a_select2(tptp_update2(X10,X8,X12),X9) = X11 ),
inference(variable_rename,[status(thm)],[79]) ).
cnf(81,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = X5
| X2 = X4
| a_select2(X1,X4) != X5 ),
inference(split_conjunct,[status(thm)],[80]) ).
fof(91,plain,
! [X7,X8,X9] : a_select2(tptp_update2(X7,X8,X9),X8) = X9,
inference(variable_rename,[status(thm)],[10]) ).
cnf(92,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[91]) ).
fof(109,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[62]) ).
cnf(110,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(132,plain,
gt(n5,n3),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(135,plain,
gt(n5,n4),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(148,plain,
gt(n4,n3),
inference(split_conjunct,[status(thm)],[43]) ).
fof(161,negated_conjecture,
( a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& ( a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use ) ),
inference(fof_nnf,[status(thm)],[61]) ).
cnf(162,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use ),
inference(split_conjunct,[status(thm)],[161]) ).
cnf(166,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
inference(split_conjunct,[status(thm)],[161]) ).
cnf(167,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
inference(split_conjunct,[status(thm)],[161]) ).
cnf(168,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
inference(split_conjunct,[status(thm)],[161]) ).
cnf(252,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[81,theory(equality)]) ).
cnf(434,negated_conjecture,
( $false
| a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(rw,[status(thm)],[162,167,theory(equality)]) ).
cnf(435,negated_conjecture,
( $false
| $false
| a_select3(u_defuse,n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(rw,[status(thm)],[434,168,theory(equality)]) ).
cnf(436,negated_conjecture,
( $false
| $false
| $false
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(rw,[status(thm)],[435,166,theory(equality)]) ).
cnf(437,negated_conjecture,
( $false
| $false
| $false
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| $false
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(rw,[status(thm)],[436,92,theory(equality)]) ).
cnf(438,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[437,theory(equality)]) ).
cnf(623,negated_conjecture,
( n5 = n4
| a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(spm,[status(thm)],[438,252,theory(equality)]) ).
cnf(624,negated_conjecture,
( n5 = n4
| $false
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(rw,[status(thm)],[623,92,theory(equality)]) ).
cnf(625,negated_conjecture,
( n5 = n4
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[624,theory(equality)]) ).
cnf(922,negated_conjecture,
( n5 = n4
| n5 = n3
| a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use ),
inference(spm,[status(thm)],[625,252,theory(equality)]) ).
cnf(979,negated_conjecture,
( n5 = n3
| n5 = n4
| n4 = n3
| a_select2(tptp_update2(xinit_defuse,n3,use),n3) != use ),
inference(spm,[status(thm)],[922,252,theory(equality)]) ).
cnf(984,negated_conjecture,
( n5 = n3
| n5 = n4
| n4 = n3
| $false ),
inference(rw,[status(thm)],[979,92,theory(equality)]) ).
cnf(985,negated_conjecture,
( n5 = n3
| n5 = n4
| n4 = n3 ),
inference(cn,[status(thm)],[984,theory(equality)]) ).
cnf(988,negated_conjecture,
( gt(n4,n4)
| n4 = n3
| n5 = n3 ),
inference(spm,[status(thm)],[135,985,theory(equality)]) ).
cnf(1012,negated_conjecture,
( n4 = n3
| n5 = n3 ),
inference(sr,[status(thm)],[988,110,theory(equality)]) ).
cnf(1040,negated_conjecture,
( gt(n3,n3)
| n4 = n3 ),
inference(spm,[status(thm)],[132,1012,theory(equality)]) ).
cnf(1064,negated_conjecture,
n4 = n3,
inference(sr,[status(thm)],[1040,110,theory(equality)]) ).
cnf(1120,plain,
gt(n3,n3),
inference(rw,[status(thm)],[148,1064,theory(equality)]) ).
cnf(1121,plain,
$false,
inference(sr,[status(thm)],[1120,110,theory(equality)]) ).
cnf(1122,plain,
$false,
1121,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV104+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmppTnefy/sel_SWV104+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV104+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV104+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV104+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
%
%------------------------------------------------------------------------------