TSTP Solution File: SWV411+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV411+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:40:16 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 102 ( 29 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 112 ( 39 ~; 41 |; 24 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 94 ( 10 sgn 54 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/tmp/tmpo6MnCR/sel_SWV411+1.p_1',ax21) ).
fof(3,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/tmp/tmpo6MnCR/sel_SWV411+1.p_1',ax23) ).
fof(5,conjecture,
! [X1] :
( ! [X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) )
=> ! [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
=> ? [X7] : pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
file('/tmp/tmpo6MnCR/sel_SWV411+1.p_1',l47_co) ).
fof(6,negated_conjecture,
~ ! [X1] :
( ! [X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) )
=> ! [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
=> ? [X7] : pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(9,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(insert_slb(X1,pair(X2,X4)),X3)
| contains_slb(X1,X3)
| X2 = X3 )
& ( ( ~ contains_slb(X1,X3)
& X2 != X3 )
| contains_slb(insert_slb(X1,pair(X2,X4)),X3) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(10,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ( ~ contains_slb(X5,X7)
& X6 != X7 )
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(11,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ~ contains_slb(X5,X7)
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) )
& ( X6 != X7
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(distribute,[status(thm)],[10]) ).
cnf(14,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[11]) ).
fof(17,plain,
! [X1,X2,X3,X4,X5] :
( ( ~ pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
| pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) )
& ( ( ~ pair_in_list(X1,X3,X5)
& ( X2 != X3
| X4 != X5 ) )
| pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(18,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10)
| pair_in_list(X6,X8,X10)
| ( X7 = X8
& X9 = X10 ) )
& ( ( ~ pair_in_list(X6,X8,X10)
& ( X7 != X8
| X9 != X10 ) )
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(variable_rename,[status(thm)],[17]) ).
fof(19,plain,
! [X6,X7,X8,X9,X10] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X6,X8,X10)
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X7 != X8
| X9 != X10
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(distribute,[status(thm)],[18]) ).
cnf(20,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(21,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(26,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ contains_slb(X1,X2)
| ? [X3] : pair_in_list(X1,X2,X3) )
& ? [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
& ! [X7] : ~ pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(27,negated_conjecture,
? [X8] :
( ! [X9] :
( ~ contains_slb(X8,X9)
| ? [X10] : pair_in_list(X8,X9,X10) )
& ? [X11,X12,X13] :
( contains_slb(insert_slb(X8,pair(X12,X13)),X11)
& ! [X14] : ~ pair_in_list(insert_slb(X8,pair(X12,X13)),X11,X14) ) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( ! [X9] :
( ~ contains_slb(esk1_0,X9)
| pair_in_list(esk1_0,X9,esk2_1(X9)) )
& contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)
& ! [X14] : ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X14) ),
inference(skolemize,[status(esa)],[27]) ).
fof(29,negated_conjecture,
! [X9,X14] :
( ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X14)
& contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)
& ( ~ contains_slb(esk1_0,X9)
| pair_in_list(esk1_0,X9,esk2_1(X9)) ) ),
inference(shift_quantors,[status(thm)],[28]) ).
cnf(30,negated_conjecture,
( pair_in_list(esk1_0,X1,esk2_1(X1))
| ~ contains_slb(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,negated_conjecture,
contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(32,negated_conjecture,
~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(35,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X3)
| X2 != X4 ),
inference(er,[status(thm)],[20,theory(equality)]) ).
cnf(36,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[35,theory(equality)]) ).
cnf(37,negated_conjecture,
( esk4_0 = esk3_0
| contains_slb(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[14,31,theory(equality)]) ).
cnf(38,negated_conjecture,
( pair_in_list(esk1_0,esk3_0,esk2_1(esk3_0))
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[30,37,theory(equality)]) ).
cnf(42,negated_conjecture,
( pair_in_list(insert_slb(esk1_0,pair(X1,X2)),esk3_0,esk2_1(esk3_0))
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[21,38,theory(equality)]) ).
cnf(54,negated_conjecture,
esk3_0 = esk4_0,
inference(spm,[status(thm)],[32,42,theory(equality)]) ).
cnf(59,negated_conjecture,
~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk4_0,X1),
inference(rw,[status(thm)],[32,54,theory(equality)]) ).
cnf(68,negated_conjecture,
$false,
inference(spm,[status(thm)],[59,36,theory(equality)]) ).
cnf(69,negated_conjecture,
$false,
68,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV411+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax]
% -running prover on /tmp/tmpo6MnCR/sel_SWV411+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV411+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV411+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV411+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
%
%------------------------------------------------------------------------------