TSTP Solution File: SWC347+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC347+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 11:36:32 EST 2010
% Result : Theorem 0.67s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 274 ( 74 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 365 ( 135 ~; 126 |; 85 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 56 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpozwjU4/sel_SWC347+1.p_1',ax28) ).
fof(20,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmpozwjU4/sel_SWC347+1.p_1',ax7) ).
fof(40,axiom,
ssList(nil),
file('/tmp/tmpozwjU4/sel_SWC347+1.p_1',ax17) ).
fof(41,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ) ),
file('/tmp/tmpozwjU4/sel_SWC347+1.p_1',co1) ).
fof(42,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[41]) ).
fof(45,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(84,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(85,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[84]) ).
cnf(86,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[85]) ).
fof(122,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(X1,X2)
| ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) )
& ( ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| app(app(X3,X2),X4) != X1 ) )
| segmentP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(123,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,X6),X8) = X5 ) ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[122]) ).
fof(124,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[123]) ).
fof(125,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6) )
& ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) ) )
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[124]) ).
fof(126,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk5_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[125]) ).
cnf(130,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[126]) ).
cnf(225,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[40]) ).
fof(226,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& strictorderedP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X3
| ~ lt(X8,X6) ) ) ) ) )
& ( nil = X4
| nil != X3 )
& ( ~ segmentP(X2,X1)
| ~ strictorderedP(X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(227,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& ? [X14] :
( ssList(X14)
& app(X12,X14) = X13
& strictorderedP(X12)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != X14
| ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| app(X18,cons(X17,nil)) != X12
| ~ lt(X17,X15) ) ) ) ) )
& ( nil = X13
| nil != X12 )
& ( ~ segmentP(X11,X10)
| ~ strictorderedP(X10) ) ) ) ) ),
inference(variable_rename,[status(thm)],[226]) ).
fof(228,negated_conjecture,
( ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ssList(esk17_0)
& app(esk15_0,esk17_0) = esk16_0
& strictorderedP(esk15_0)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != esk17_0
| ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk15_0
| ~ lt(X17,X15) ) ) ) )
& ( nil = esk16_0
| nil != esk15_0 )
& ( ~ segmentP(esk14_0,esk13_0)
| ~ strictorderedP(esk13_0) ) ),
inference(skolemize,[status(esa)],[227]) ).
fof(229,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk15_0
| ~ lt(X17,X15)
| ~ ssItem(X17)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk17_0
| ~ ssItem(X15) )
& app(esk15_0,esk17_0) = esk16_0
& strictorderedP(esk15_0)
& ssList(esk17_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ( nil = esk16_0
| nil != esk15_0 )
& ( ~ segmentP(esk14_0,esk13_0)
| ~ strictorderedP(esk13_0) )
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(shift_quantors,[status(thm)],[228]) ).
cnf(230,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(231,negated_conjecture,
ssList(esk14_0),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(234,negated_conjecture,
( ~ strictorderedP(esk13_0)
| ~ segmentP(esk14_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(236,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[229]) ).
cnf(237,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[229]) ).
cnf(238,negated_conjecture,
ssList(esk17_0),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(239,negated_conjecture,
strictorderedP(esk15_0),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(240,negated_conjecture,
app(esk15_0,esk17_0) = esk16_0,
inference(split_conjunct,[status(thm)],[229]) ).
cnf(242,negated_conjecture,
ssList(esk15_0),
inference(rw,[status(thm)],[230,236,theory(equality)]) ).
cnf(243,negated_conjecture,
ssList(esk16_0),
inference(rw,[status(thm)],[231,237,theory(equality)]) ).
cnf(246,negated_conjecture,
( $false
| ~ segmentP(esk14_0,esk13_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[234,236,theory(equality)]),239,theory(equality)]) ).
cnf(247,negated_conjecture,
( $false
| ~ segmentP(esk16_0,esk15_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[246,237,theory(equality)]),236,theory(equality)]) ).
cnf(248,negated_conjecture,
~ segmentP(esk16_0,esk15_0),
inference(cn,[status(thm)],[247,theory(equality)]) ).
cnf(412,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[130,86,theory(equality)]) ).
cnf(422,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[412,225,theory(equality)]) ).
cnf(423,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[422,theory(equality)]) ).
cnf(9316,negated_conjecture,
( segmentP(X1,esk15_0)
| esk16_0 != X1
| ~ ssList(esk17_0)
| ~ ssList(esk15_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[423,240,theory(equality)]) ).
cnf(9356,negated_conjecture,
( segmentP(X1,esk15_0)
| esk16_0 != X1
| ~ ssList(esk17_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[9316,242,theory(equality)]) ).
cnf(9357,negated_conjecture,
( segmentP(X1,esk15_0)
| esk16_0 != X1
| ~ ssList(esk17_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[9356,theory(equality)]) ).
cnf(10786,negated_conjecture,
( ~ ssList(esk17_0)
| ~ ssList(esk16_0) ),
inference(spm,[status(thm)],[248,9357,theory(equality)]) ).
cnf(10791,negated_conjecture,
( ~ ssList(esk17_0)
| $false ),
inference(rw,[status(thm)],[10786,243,theory(equality)]) ).
cnf(10792,negated_conjecture,
~ ssList(esk17_0),
inference(cn,[status(thm)],[10791,theory(equality)]) ).
cnf(10805,negated_conjecture,
$false,
inference(sr,[status(thm)],[238,10792,theory(equality)]) ).
cnf(10806,negated_conjecture,
$false,
10805,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC347+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpozwjU4/sel_SWC347+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC347+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC347+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC347+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
%
%------------------------------------------------------------------------------