TSTP Solution File: SWV379+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV379+1 : TPTP v5.0.0. Released 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:31:34 EST 2010
% Result : Theorem 183.69s
% Output : CNFRefutation 183.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 11 unt; 0 def)
% Number of atoms : 153 ( 50 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 150 ( 56 ~; 63 |; 19 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 127 ( 21 sgn 85 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',ax49) ).
fof(2,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_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/tmpFOU3mk/sel_SWV379+1.p_4',ax48) ).
fof(6,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',ax41) ).
fof(9,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',ax46) ).
fof(12,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',ax40) ).
fof(13,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/tmpFOU3mk/sel_SWV379+1.p_4',ax47) ).
fof(16,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',totality) ).
fof(17,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',stricly_smaller_definition) ).
fof(28,conjecture,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/tmp/tmpFOU3mk/sel_SWV379+1.p_4',l15_co) ).
fof(29,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(31,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
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)],[13,theory(equality)]) ).
fof(34,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(35,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[29,theory(equality)]) ).
fof(36,plain,
! [X1,X2,X3,X4] :
( X2 = create_slb
| ~ contains_slb(X2,findmin_pqp_res(X1))
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(37,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7) ),
inference(variable_rename,[status(thm)],[36]) ).
cnf(38,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)
| X2 = create_slb
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,plain,
! [X1,X2,X3,X4] :
( X2 = create_slb
| ~ contains_slb(X2,findmin_pqp_res(X1))
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_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)],[2]) ).
fof(40,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ strictly_less_than(findmin_pqp_res(X5),lookup_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)],[39]) ).
cnf(41,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(50,plain,
! [X1,X2,X3] :
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(51,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[50]) ).
cnf(52,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(61,plain,
! [X3,X4] : findmin_cpq_eff(triple(X3,create_slb,X4)) = triple(X3,create_slb,bad),
inference(variable_rename,[status(thm)],[9]) ).
cnf(62,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[61]) ).
fof(68,plain,
! [X1,X2] :
( ( ~ ok(triple(X1,X2,bad))
| ~ $true )
& ( $true
| ok(triple(X1,X2,bad)) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(69,plain,
! [X3,X4] :
( ( ~ ok(triple(X3,X4,bad))
| ~ $true )
& ( $true
| ok(triple(X3,X4,bad)) ) ),
inference(variable_rename,[status(thm)],[68]) ).
cnf(71,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(72,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(73,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)],[72]) ).
cnf(74,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)],[73]) ).
fof(79,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(80,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
fof(81,plain,
! [X1,X2] :
( ( ~ strictly_less_than(X1,X2)
| ( less_than(X1,X2)
& ~ less_than(X2,X1) ) )
& ( ~ less_than(X1,X2)
| less_than(X2,X1)
| strictly_less_than(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(82,plain,
! [X3,X4] :
( ( ~ strictly_less_than(X3,X4)
| ( less_than(X3,X4)
& ~ less_than(X4,X3) ) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(variable_rename,[status(thm)],[81]) ).
fof(83,plain,
! [X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[82]) ).
cnf(84,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[83]) ).
fof(118,negated_conjecture,
? [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
& ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(119,negated_conjecture,
? [X4,X5,X6] :
( ~ ok(triple(X4,X5,X6))
& ok(findmin_cpq_eff(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[118]) ).
fof(120,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
& ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[119]) ).
cnf(121,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(122,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(127,negated_conjecture,
bad = esk3_0,
inference(spm,[status(thm)],[122,52,theory(equality)]) ).
cnf(130,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[84,80]) ).
cnf(161,plain,
( create_slb = X2
| contains_slb(X2,findmin_pqp_res(X1))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(spm,[status(thm)],[71,74,theory(equality)]) ).
cnf(169,plain,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[41,74]) ).
cnf(171,plain,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X2,X3))
| create_slb = X2
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[169,130,theory(equality)]) ).
cnf(177,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))),
inference(rw,[status(thm)],[121,127,theory(equality)]) ).
cnf(179,negated_conjecture,
( create_slb = esk2_0
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[161,177,theory(equality)]) ).
cnf(1236,plain,
( create_slb = X2
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(spm,[status(thm)],[71,171,theory(equality)]) ).
cnf(1289,negated_conjecture,
( create_slb = esk2_0
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[1236,177,theory(equality)]) ).
cnf(1303,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| create_slb = esk2_0
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[38,1289,theory(equality)]) ).
cnf(1418,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[1303,179]) ).
cnf(1419,negated_conjecture,
( esk2_0 = create_slb
| ~ ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))) ),
inference(spm,[status(thm)],[71,1418,theory(equality)]) ).
cnf(1439,negated_conjecture,
( esk2_0 = create_slb
| $false ),
inference(rw,[status(thm)],[1419,177,theory(equality)]) ).
cnf(1440,negated_conjecture,
esk2_0 = create_slb,
inference(cn,[status(thm)],[1439,theory(equality)]) ).
cnf(1441,negated_conjecture,
ok(triple(esk1_0,create_slb,bad)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[177,1440,theory(equality)]),62,theory(equality)]) ).
cnf(1442,negated_conjecture,
$false,
inference(sr,[status(thm)],[1441,71,theory(equality)]) ).
cnf(1443,negated_conjecture,
$false,
1442,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV379+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFOU3mk/sel_SWV379+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpFOU3mk/sel_SWV379+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFOU3mk/sel_SWV379+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmpFOU3mk/sel_SWV379+1.p_4 with time limit 55
% -prover status Theorem
% Problem SWV379+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV379+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV379+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
%
%------------------------------------------------------------------------------