TSTP Solution File: SWV372+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV372+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:27:57 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 17 unt; 0 def)
% Number of atoms : 131 ( 36 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 119 ( 53 ~; 46 |; 9 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 137 ( 24 sgn 89 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',ax46) ).
fof(10,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',ax47) ).
fof(13,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',ax20) ).
fof(22,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',ax51) ).
fof(23,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',ax39) ).
fof(27,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',l8_co) ).
fof(28,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ phi(triple(X1,X2,X3)) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',l8_lX) ).
fof(29,axiom,
! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',l8_l9) ).
fof(30,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_pq(i(triple(X1,X2,X3)),X4) ),
file('/tmp/tmpPXastF/sel_SWV372+1.p_1',l8_li56) ).
fof(31,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[27]) ).
fof(32,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(33,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(36,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ phi(triple(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(37,plain,
! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[29,theory(equality)]) ).
fof(69,plain,
! [X3,X4] : findmin_cpq_eff(triple(X3,create_slb,X4)) = triple(X3,create_slb,bad),
inference(variable_rename,[status(thm)],[9]) ).
cnf(70,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[69]) ).
fof(71,plain,
! [X1,X2,X3,X4] :
( X2 = create_slb
| contains_slb(X2,findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(72,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| contains_slb(X6,findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
inference(variable_rename,[status(thm)],[71]) ).
cnf(73,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(82,plain,
! [X2] : ~ contains_slb(create_slb,X2),
inference(variable_rename,[status(thm)],[33]) ).
cnf(83,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[82]) ).
fof(110,plain,
! [X1,X2,X3,X4] :
( X2 = create_slb
| findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(111,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| findmin_cpq_res(triple(X5,X6,X7)) = findmin_pqp_res(X5) ),
inference(variable_rename,[status(thm)],[110]) ).
cnf(112,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[111]) ).
fof(113,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_cpq(triple(X1,X2,X3),X4)
| contains_slb(X2,X4) )
& ( ~ contains_slb(X2,X4)
| contains_cpq(triple(X1,X2,X3),X4) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(114,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X6,X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(variable_rename,[status(thm)],[113]) ).
cnf(115,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(116,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(124,negated_conjecture,
? [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
& ~ contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(125,negated_conjecture,
? [X4,X5,X6] :
( phi(findmin_cpq_eff(triple(X4,X5,X6)))
& ~ contains_pq(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[124]) ).
fof(126,negated_conjecture,
( phi(findmin_cpq_eff(triple(esk2_0,esk3_0,esk4_0)))
& ~ contains_pq(i(triple(esk2_0,esk3_0,esk4_0)),findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0))) ),
inference(skolemize,[status(esa)],[125]) ).
cnf(127,negated_conjecture,
~ contains_pq(i(triple(esk2_0,esk3_0,esk4_0)),findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0))),
inference(split_conjunct,[status(thm)],[126]) ).
cnf(128,negated_conjecture,
phi(findmin_cpq_eff(triple(esk2_0,esk3_0,esk4_0))),
inference(split_conjunct,[status(thm)],[126]) ).
fof(129,plain,
! [X1,X2,X3] :
( ok(triple(X1,X2,X3))
| ~ phi(triple(X1,X2,X3)) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(130,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| ~ phi(triple(X4,X5,X6)) ),
inference(variable_rename,[status(thm)],[129]) ).
cnf(131,plain,
( ok(triple(X1,X2,X3))
| ~ phi(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[130]) ).
fof(132,plain,
! [X1,X2,X3] :
( contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(133,plain,
! [X4,X5,X6] :
( contains_cpq(triple(X4,X5,X6),findmin_cpq_res(triple(X4,X5,X6)))
| ~ ok(findmin_cpq_eff(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[132]) ).
cnf(134,plain,
( contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[133]) ).
fof(135,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_cpq(triple(X1,X2,X3),X4)
| contains_pq(i(triple(X1,X2,X3)),X4) )
& ( ~ contains_pq(i(triple(X1,X2,X3)),X4)
| contains_cpq(triple(X1,X2,X3),X4) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(136,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_pq(i(triple(X5,X6,X7)),X8) )
& ( ~ contains_pq(i(triple(X5,X6,X7)),X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(variable_rename,[status(thm)],[135]) ).
cnf(138,plain,
( contains_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(149,negated_conjecture,
( create_slb = esk3_0
| ~ contains_pq(i(triple(esk2_0,esk3_0,esk4_0)),findmin_pqp_res(esk2_0)) ),
inference(spm,[status(thm)],[127,112,theory(equality)]) ).
cnf(158,plain,
~ contains_cpq(triple(esk2_0,esk3_0,esk4_0),findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0))),
inference(spm,[status(thm)],[127,138,theory(equality)]) ).
cnf(169,plain,
( contains_slb(X1,findmin_cpq_res(triple(X2,X1,X3)))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[116,134,theory(equality)]) ).
cnf(202,plain,
( findmin_cpq_eff(triple(X1,X2,X4)) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| contains_slb(X2,findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[73,73,theory(equality)]) ).
cnf(215,plain,
( esk3_0 = create_slb
| ~ contains_cpq(triple(esk2_0,esk3_0,esk4_0),findmin_pqp_res(esk2_0)) ),
inference(spm,[status(thm)],[149,138,theory(equality)]) ).
cnf(216,plain,
( esk3_0 = create_slb
| ~ contains_slb(esk3_0,findmin_pqp_res(esk2_0)) ),
inference(spm,[status(thm)],[215,115,theory(equality)]) ).
cnf(219,plain,
~ ok(findmin_cpq_eff(triple(esk2_0,esk3_0,esk4_0))),
inference(spm,[status(thm)],[158,134,theory(equality)]) ).
cnf(438,plain,
( contains_slb(create_slb,findmin_cpq_res(triple(X1,create_slb,X2)))
| ~ ok(triple(X1,create_slb,bad)) ),
inference(spm,[status(thm)],[169,70,theory(equality)]) ).
cnf(441,plain,
~ ok(triple(X1,create_slb,bad)),
inference(sr,[status(thm)],[438,83,theory(equality)]) ).
cnf(442,negated_conjecture,
( phi(findmin_cpq_eff(triple(esk2_0,esk3_0,X1)))
| create_slb = esk3_0
| contains_slb(esk3_0,findmin_pqp_res(esk2_0)) ),
inference(spm,[status(thm)],[128,202,theory(equality)]) ).
cnf(446,plain,
( create_slb = esk3_0
| contains_slb(esk3_0,findmin_pqp_res(esk2_0))
| ~ ok(findmin_cpq_eff(triple(esk2_0,esk3_0,X1))) ),
inference(spm,[status(thm)],[219,202,theory(equality)]) ).
cnf(465,plain,
~ phi(triple(X1,create_slb,bad)),
inference(spm,[status(thm)],[441,131,theory(equality)]) ).
cnf(469,plain,
( esk3_0 = create_slb
| ~ ok(findmin_cpq_eff(triple(esk2_0,esk3_0,X1))) ),
inference(csr,[status(thm)],[446,216]) ).
cnf(470,plain,
( esk3_0 = create_slb
| contains_slb(esk3_0,findmin_pqp_res(esk2_0))
| ~ ok(triple(esk2_0,update_slb(esk3_0,findmin_pqp_res(esk2_0)),bad)) ),
inference(spm,[status(thm)],[469,73,theory(equality)]) ).
cnf(475,negated_conjecture,
( esk3_0 = create_slb
| phi(findmin_cpq_eff(triple(esk2_0,esk3_0,X1))) ),
inference(csr,[status(thm)],[442,216]) ).
cnf(476,negated_conjecture,
( esk3_0 = create_slb
| phi(triple(esk2_0,update_slb(esk3_0,findmin_pqp_res(esk2_0)),bad))
| contains_slb(esk3_0,findmin_pqp_res(esk2_0)) ),
inference(spm,[status(thm)],[475,73,theory(equality)]) ).
cnf(488,negated_conjecture,
( esk3_0 = create_slb
| phi(triple(esk2_0,update_slb(esk3_0,findmin_pqp_res(esk2_0)),bad)) ),
inference(csr,[status(thm)],[476,216]) ).
cnf(491,plain,
( esk3_0 = create_slb
| ~ ok(triple(esk2_0,update_slb(esk3_0,findmin_pqp_res(esk2_0)),bad)) ),
inference(csr,[status(thm)],[470,216]) ).
cnf(493,plain,
( esk3_0 = create_slb
| ~ phi(triple(esk2_0,update_slb(esk3_0,findmin_pqp_res(esk2_0)),bad)) ),
inference(spm,[status(thm)],[491,131,theory(equality)]) ).
cnf(495,plain,
esk3_0 = create_slb,
inference(csr,[status(thm)],[493,488]) ).
cnf(496,negated_conjecture,
phi(triple(esk2_0,create_slb,bad)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[128,495,theory(equality)]),70,theory(equality)]) ).
cnf(497,negated_conjecture,
$false,
inference(sr,[status(thm)],[496,465,theory(equality)]) ).
cnf(498,negated_conjecture,
$false,
497,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV372+1.p
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% -running prover on /tmp/tmpPXastF/sel_SWV372+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV372+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV372+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV372+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
%
%------------------------------------------------------------------------------