TSTP Solution File: SWV374+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV374+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:28:47 EST 2010
% Result : Theorem 0.30s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 8 unt; 0 def)
% Number of atoms : 128 ( 37 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 129 ( 45 ~; 55 |; 21 &)
% ( 3 <=>; 5 =>; 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 : 92 ( 16 sgn 58 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/tmp/tmp00lAsi/sel_SWV374+1.p_1',ax46) ).
fof(10,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/tmp00lAsi/sel_SWV374+1.p_1',ax48) ).
fof(13,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/tmp/tmp00lAsi/sel_SWV374+1.p_1',totality) ).
fof(14,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/tmp/tmp00lAsi/sel_SWV374+1.p_1',stricly_smaller_definition) ).
fof(18,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/tmp/tmp00lAsi/sel_SWV374+1.p_1',ax40) ).
fof(19,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/tmp00lAsi/sel_SWV374+1.p_1',ax47) ).
fof(22,conjecture,
! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
file('/tmp/tmp00lAsi/sel_SWV374+1.p_1',l10_co) ).
fof(23,negated_conjecture,
~ ! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
inference(assume_negation,[status(cth)],[22]) ).
fof(25,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(27,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)],[19,theory(equality)]) ).
fof(49,plain,
! [X3,X4] : findmin_cpq_eff(triple(X3,create_slb,X4)) = triple(X3,create_slb,bad),
inference(variable_rename,[status(thm)],[8]) ).
cnf(50,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[49]) ).
fof(54,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)],[10]) ).
fof(55,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)],[54]) ).
cnf(56,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)],[55]) ).
fof(62,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[13]) ).
cnf(63,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(64,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)],[25]) ).
fof(65,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)],[64]) ).
fof(66,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)],[65]) ).
cnf(67,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(80,plain,
! [X1,X2] :
( ( ~ ok(triple(X1,X2,bad))
| ~ $true )
& ( $true
| ok(triple(X1,X2,bad)) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(81,plain,
! [X3,X4] :
( ( ~ ok(triple(X3,X4,bad))
| ~ $true )
& ( $true
| ok(triple(X3,X4,bad)) ) ),
inference(variable_rename,[status(thm)],[80]) ).
cnf(83,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(84,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)],[27]) ).
fof(85,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)],[84]) ).
cnf(86,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)],[85]) ).
fof(95,negated_conjecture,
? [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
& ( X2 = create_slb
| ~ contains_slb(X2,findmin_pqp_res(X1))
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(96,negated_conjecture,
? [X4,X5,X6] :
( ok(findmin_cpq_eff(triple(X4,X5,X6)))
& ( X5 = create_slb
| ~ contains_slb(X5,findmin_pqp_res(X4))
| ~ less_than(lookup_slb(X5,findmin_pqp_res(X4)),findmin_pqp_res(X4)) ) ),
inference(variable_rename,[status(thm)],[95]) ).
fof(97,negated_conjecture,
( ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ( esk2_0 = create_slb
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| ~ less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ) ),
inference(skolemize,[status(esa)],[96]) ).
cnf(98,negated_conjecture,
( esk2_0 = create_slb
| ~ less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(split_conjunct,[status(thm)],[97]) ).
cnf(99,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[97]) ).
cnf(108,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[67,63]) ).
cnf(117,plain,
( create_slb = X2
| contains_slb(X2,findmin_pqp_res(X1))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(spm,[status(thm)],[83,86,theory(equality)]) ).
cnf(145,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)],[56,86]) ).
cnf(147,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)],[145,108,theory(equality)]) ).
cnf(149,negated_conjecture,
( create_slb = esk2_0
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[117,99,theory(equality)]) ).
cnf(1503,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)],[83,147,theory(equality)]) ).
cnf(1553,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)],[1503,99,theory(equality)]) ).
cnf(1570,negated_conjecture,
( esk2_0 = create_slb
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[98,1553,theory(equality)]) ).
cnf(1587,negated_conjecture,
esk2_0 = create_slb,
inference(csr,[status(thm)],[1570,149]) ).
cnf(1588,negated_conjecture,
ok(triple(esk1_0,create_slb,bad)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[99,1587,theory(equality)]),50,theory(equality)]) ).
cnf(1589,negated_conjecture,
$false,
inference(sr,[status(thm)],[1588,83,theory(equality)]) ).
cnf(1590,negated_conjecture,
$false,
1589,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV374+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmp00lAsi/sel_SWV374+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV374+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV374+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV374+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
%
%------------------------------------------------------------------------------