TSTP Solution File: SWV415+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV415+2 : 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:40:57 EST 2010
% Result : Theorem 239.71s
% Output : CNFRefutation 239.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 21 unt; 0 def)
% Number of atoms : 79 ( 73 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 28 ~; 32 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 18 con; 0-3 aty)
% Number of variables : 236 ( 85 sgn 95 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/tmp/tmpJUWdqa/sel_SWV415+2.p_5',ax42) ).
fof(33,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/tmp/tmpJUWdqa/sel_SWV415+2.p_5',ax54) ).
fof(34,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/tmp/tmpJUWdqa/sel_SWV415+2.p_5',ax55) ).
fof(37,axiom,
( ( ! [X1,X2,X3,X4] : i(triple(X1,create_slb,X3)) = i(triple(X2,create_slb,X4))
& ! [X5] :
( ! [X6,X7,X8,X9] : i(triple(X6,X5,X8)) = i(triple(X7,X5,X9))
=> ! [X10,X11,X12,X13,X14,X15] : i(triple(X10,insert_slb(X5,pair(X14,X15)),X12)) = i(triple(X11,insert_slb(X5,pair(X14,X15)),X13)) ) )
=> ! [X16,X17,X18,X19,X20] : i(triple(X16,X18,X19)) = i(triple(X17,X18,X20)) ),
file('/tmp/tmpJUWdqa/sel_SWV415+2.p_5',big2_induction) ).
fof(38,conjecture,
! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/tmp/tmpJUWdqa/sel_SWV415+2.p_5',co2) ).
fof(39,negated_conjecture,
~ ! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
inference(assume_negation,[status(cth)],[38]) ).
fof(63,plain,
! [X5,X6,X7,X8] : insert_cpq(triple(X5,X6,X7),X8) = triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),
inference(variable_rename,[status(thm)],[7]) ).
cnf(64,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[63]) ).
fof(140,plain,
! [X3,X4] : i(triple(X3,create_slb,X4)) = create_pq,
inference(variable_rename,[status(thm)],[33]) ).
cnf(141,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[140]) ).
fof(142,plain,
! [X6,X7,X8,X9,X10] : i(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) = insert_pq(i(triple(X6,X7,X8)),X9),
inference(variable_rename,[status(thm)],[34]) ).
cnf(143,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[142]) ).
fof(149,plain,
( ? [X1,X2,X3,X4] : i(triple(X1,create_slb,X3)) != i(triple(X2,create_slb,X4))
| ? [X5] :
( ! [X6,X7,X8,X9] : i(triple(X6,X5,X8)) = i(triple(X7,X5,X9))
& ? [X10,X11,X12,X13,X14,X15] : i(triple(X10,insert_slb(X5,pair(X14,X15)),X12)) != i(triple(X11,insert_slb(X5,pair(X14,X15)),X13)) )
| ! [X16,X17,X18,X19,X20] : i(triple(X16,X18,X19)) = i(triple(X17,X18,X20)) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(150,plain,
( ? [X21,X22,X23,X24] : i(triple(X21,create_slb,X23)) != i(triple(X22,create_slb,X24))
| ? [X25] :
( ! [X26,X27,X28,X29] : i(triple(X26,X25,X28)) = i(triple(X27,X25,X29))
& ? [X30,X31,X32,X33,X34,X35] : i(triple(X30,insert_slb(X25,pair(X34,X35)),X32)) != i(triple(X31,insert_slb(X25,pair(X34,X35)),X33)) )
| ! [X36,X37,X38,X39,X40] : i(triple(X36,X38,X39)) = i(triple(X37,X38,X40)) ),
inference(variable_rename,[status(thm)],[149]) ).
fof(151,plain,
( i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0))
| ( ! [X26,X27,X28,X29] : i(triple(X26,esk6_0,X28)) = i(triple(X27,esk6_0,X29))
& i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) != i(triple(esk8_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk10_0)) )
| ! [X36,X37,X38,X39,X40] : i(triple(X36,X38,X39)) = i(triple(X37,X38,X40)) ),
inference(skolemize,[status(esa)],[150]) ).
fof(152,plain,
! [X26,X27,X28,X29,X36,X37,X38,X39,X40] :
( i(triple(X36,X38,X39)) = i(triple(X37,X38,X40))
| ( i(triple(X26,esk6_0,X28)) = i(triple(X27,esk6_0,X29))
& i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) != i(triple(esk8_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk10_0)) )
| i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0)) ),
inference(shift_quantors,[status(thm)],[151]) ).
fof(153,plain,
! [X26,X27,X28,X29,X36,X37,X38,X39,X40] :
( ( i(triple(X26,esk6_0,X28)) = i(triple(X27,esk6_0,X29))
| i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0))
| i(triple(X36,X38,X39)) = i(triple(X37,X38,X40)) )
& ( i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) != i(triple(esk8_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk10_0))
| i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0))
| i(triple(X36,X38,X39)) = i(triple(X37,X38,X40)) ) ),
inference(distribute,[status(thm)],[152]) ).
cnf(154,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0))
| i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) != i(triple(esk8_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk10_0)) ),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(155,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(X6,esk6_0,X7)) = i(triple(X8,esk6_0,X9))
| i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0)) ),
inference(split_conjunct,[status(thm)],[153]) ).
fof(156,negated_conjecture,
? [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) != insert_pq(i(triple(X1,X2,X3)),X4),
inference(fof_nnf,[status(thm)],[39]) ).
fof(157,negated_conjecture,
? [X5,X6,X7,X8] : i(insert_cpq(triple(X5,X6,X7),X8)) != insert_pq(i(triple(X5,X6,X7)),X8),
inference(variable_rename,[status(thm)],[156]) ).
fof(158,negated_conjecture,
i(insert_cpq(triple(esk13_0,esk14_0,esk15_0),esk16_0)) != insert_pq(i(triple(esk13_0,esk14_0,esk15_0)),esk16_0),
inference(skolemize,[status(esa)],[157]) ).
cnf(159,negated_conjecture,
i(insert_cpq(triple(esk13_0,esk14_0,esk15_0),esk16_0)) != insert_pq(i(triple(esk13_0,esk14_0,esk15_0)),esk16_0),
inference(split_conjunct,[status(thm)],[158]) ).
cnf(229,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(X6,esk6_0,X7)) = i(triple(X8,esk6_0,X9))
| create_pq != i(triple(esk2_0,create_slb,esk4_0)) ),
inference(rw,[status(thm)],[155,141,theory(equality)]) ).
cnf(230,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(X6,esk6_0,X7)) = i(triple(X8,esk6_0,X9))
| $false ),
inference(rw,[status(thm)],[229,141,theory(equality)]) ).
cnf(231,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(X6,esk6_0,X7)) = i(triple(X8,esk6_0,X9)) ),
inference(cn,[status(thm)],[230,theory(equality)]) ).
cnf(232,plain,
( i(triple(X10,esk6_0,X11)) = i(triple(X8,esk6_0,X9))
| i(triple(X12,esk6_0,X13)) != i(triple(X8,esk6_0,X9)) ),
inference(ef,[status(thm)],[231,theory(equality)]) ).
cnf(282,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| create_pq != i(triple(esk2_0,create_slb,esk4_0))
| i(triple(esk8_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk10_0)) != i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) ),
inference(rw,[status(thm)],[154,141,theory(equality)]) ).
cnf(283,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| $false
| i(triple(esk8_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk10_0)) != i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) ),
inference(rw,[status(thm)],[282,141,theory(equality)]) ).
cnf(284,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| $false
| insert_pq(i(triple(esk8_0,esk6_0,esk10_0)),esk11_0) != i(triple(esk7_0,insert_slb(esk6_0,pair(esk11_0,esk12_0)),esk9_0)) ),
inference(rw,[status(thm)],[283,143,theory(equality)]) ).
cnf(285,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| $false
| insert_pq(i(triple(esk8_0,esk6_0,esk10_0)),esk11_0) != insert_pq(i(triple(esk7_0,esk6_0,esk9_0)),esk11_0) ),
inference(rw,[status(thm)],[284,143,theory(equality)]) ).
cnf(286,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| insert_pq(i(triple(esk8_0,esk6_0,esk10_0)),esk11_0) != insert_pq(i(triple(esk7_0,esk6_0,esk9_0)),esk11_0) ),
inference(cn,[status(thm)],[285,theory(equality)]) ).
cnf(2668,plain,
i(triple(X10,esk6_0,X11)) = i(triple(X8,esk6_0,X9)),
inference(csr,[status(thm)],[232,231]) ).
cnf(2675,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| insert_pq(i(triple(X6,esk6_0,X7)),esk11_0) != insert_pq(i(triple(esk8_0,esk6_0,esk10_0)),esk11_0) ),
inference(spm,[status(thm)],[286,2668,theory(equality)]) ).
cnf(2677,plain,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(sr,[status(thm)],[2675,2668,theory(equality)]) ).
cnf(2712,plain,
i(insert_cpq(triple(X1,X3,X4),X2)) = i(triple(X5,insert_slb(X3,pair(X2,bottom)),X6)),
inference(spm,[status(thm)],[2677,64,theory(equality)]) ).
cnf(2734,plain,
i(insert_cpq(triple(X1,X3,X4),X2)) = insert_pq(i(triple(X5,X3,X6)),X2),
inference(rw,[status(thm)],[2712,143,theory(equality)]) ).
cnf(2887,negated_conjecture,
$false,
inference(sr,[status(thm)],[159,2734,theory(equality)]) ).
cnf(2888,negated_conjecture,
$false,
2887,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV415+2.p
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpJUWdqa/sel_SWV415+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpJUWdqa/sel_SWV415+2.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpJUWdqa/sel_SWV415+2.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpJUWdqa/sel_SWV415+2.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% -running prover on /tmp/tmpJUWdqa/sel_SWV415+2.p_5 with time limit 55
% -prover status Theorem
% Problem SWV415+2.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV415+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV415+2.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
%
%------------------------------------------------------------------------------