TSTP Solution File: LCL656+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL656+1.001 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 : Sat Dec 25 19:26:32 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 362 ( 0 equ)
% Maximal formula atoms : 66 ( 13 avg)
% Number of connectives : 587 ( 252 ~; 213 |; 122 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 0 sgn 56 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
file('/tmp/tmpVgyt03/sel_LCL656+1.001.p_1',main) ).
fof(2,axiom,
! [X1] : r1(X1,X1),
file('/tmp/tmpVgyt03/sel_LCL656+1.001.p_1',reflexivity) ).
fof(3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(4,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(5,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ? [X1] :
( r1(X2,X1)
& ~ p2(X1)
& ~ p102(X1)
& p101(X1) )
& ? [X1] :
( r1(X2,X1)
& p2(X1)
& ~ p102(X1)
& p101(X1) ) )
| p101(X2)
| ~ p100(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X1)
& p100(X1) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(6,negated_conjecture,
? [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| p2(X4) )
& ! [X5] :
( ~ r1(X3,X5)
| ( ( ( ? [X6] :
( r1(X5,X6)
& ~ p2(X6)
& ~ p102(X6)
& p101(X6) )
& ? [X7] :
( r1(X5,X7)
& p2(X7)
& ~ p102(X7)
& p101(X7) ) )
| p101(X5)
| ~ p100(X5) )
& ( ( ( ! [X8] :
( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8) )
| p2(X5) )
& ( ! [X9] :
( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9) )
| ~ p2(X5) ) )
| ~ p101(X5) )
& ( ( ( ! [X10] :
( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10) )
| p1(X5) )
& ( ! [X11] :
( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11) )
| ~ p1(X5) ) )
| ~ p100(X5) )
& ( p101(X5)
| ~ p102(X5) )
& ( p100(X5)
| ~ p101(X5) ) ) )
& ~ p101(X3)
& p100(X3) ),
inference(variable_rename,[status(thm)],[5]) ).
fof(7,negated_conjecture,
( ! [X4] :
( ~ r1(esk1_0,X4)
| p2(X4) )
& ! [X5] :
( ~ r1(esk1_0,X5)
| ( ( ( r1(X5,esk2_1(X5))
& ~ p2(esk2_1(X5))
& ~ p102(esk2_1(X5))
& p101(esk2_1(X5))
& r1(X5,esk3_1(X5))
& p2(esk3_1(X5))
& ~ p102(esk3_1(X5))
& p101(esk3_1(X5)) )
| p101(X5)
| ~ p100(X5) )
& ( ( ( ! [X8] :
( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8) )
| p2(X5) )
& ( ! [X9] :
( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9) )
| ~ p2(X5) ) )
| ~ p101(X5) )
& ( ( ( ! [X10] :
( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10) )
| p1(X5) )
& ( ! [X11] :
( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11) )
| ~ p1(X5) ) )
| ~ p100(X5) )
& ( p101(X5)
| ~ p102(X5) )
& ( p100(X5)
| ~ p101(X5) ) ) )
& ~ p101(esk1_0)
& p100(esk1_0) ),
inference(skolemize,[status(esa)],[6]) ).
fof(8,negated_conjecture,
! [X4,X5,X8,X9,X10,X11] :
( ( ( ( ( ( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11)
| ~ p1(X5) )
& ( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10)
| p1(X5) ) )
| ~ p100(X5) )
& ( ( ( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9)
| ~ p2(X5) )
& ( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8)
| p2(X5) ) )
| ~ p101(X5) )
& ( ( r1(X5,esk2_1(X5))
& ~ p2(esk2_1(X5))
& ~ p102(esk2_1(X5))
& p101(esk2_1(X5))
& r1(X5,esk3_1(X5))
& p2(esk3_1(X5))
& ~ p102(esk3_1(X5))
& p101(esk3_1(X5)) )
| p101(X5)
| ~ p100(X5) )
& ( p101(X5)
| ~ p102(X5) )
& ( p100(X5)
| ~ p101(X5) ) )
| ~ r1(esk1_0,X5) )
& ~ p101(esk1_0)
& p100(esk1_0)
& ( ~ r1(esk1_0,X4)
| p2(X4) ) ),
inference(shift_quantors,[status(thm)],[7]) ).
fof(9,negated_conjecture,
! [X4,X5,X8,X9,X10,X11] :
( ( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11)
| ~ p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10)
| p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9)
| ~ p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8)
| p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( r1(X5,esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p2(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( r1(X5,esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p2(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(X5)
| ~ p102(X5)
| ~ r1(esk1_0,X5) )
& ( p100(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ~ p101(esk1_0)
& p100(esk1_0)
& ( ~ r1(esk1_0,X4)
| p2(X4) ) ),
inference(distribute,[status(thm)],[8]) ).
cnf(10,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(11,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(12,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(21,negated_conjecture,
( p101(X1)
| ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p2(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(22,negated_conjecture,
( p101(X1)
| r1(X1,esk2_1(X1))
| ~ r1(esk1_0,X1)
| ~ p100(X1) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(27,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[2]) ).
cnf(28,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(46,negated_conjecture,
( p101(esk1_0)
| r1(esk1_0,esk2_1(esk1_0))
| ~ p100(esk1_0) ),
inference(spm,[status(thm)],[22,28,theory(equality)]) ).
cnf(47,negated_conjecture,
( p101(esk1_0)
| r1(esk1_0,esk2_1(esk1_0))
| $false ),
inference(rw,[status(thm)],[46,11,theory(equality)]) ).
cnf(48,negated_conjecture,
( p101(esk1_0)
| r1(esk1_0,esk2_1(esk1_0)) ),
inference(cn,[status(thm)],[47,theory(equality)]) ).
cnf(49,negated_conjecture,
r1(esk1_0,esk2_1(esk1_0)),
inference(sr,[status(thm)],[48,12,theory(equality)]) ).
cnf(66,negated_conjecture,
p2(esk2_1(esk1_0)),
inference(spm,[status(thm)],[10,49,theory(equality)]) ).
cnf(87,negated_conjecture,
( p101(esk1_0)
| ~ p100(esk1_0)
| ~ r1(esk1_0,esk1_0) ),
inference(spm,[status(thm)],[21,66,theory(equality)]) ).
cnf(88,negated_conjecture,
( p101(esk1_0)
| $false
| ~ r1(esk1_0,esk1_0) ),
inference(rw,[status(thm)],[87,11,theory(equality)]) ).
cnf(89,negated_conjecture,
( p101(esk1_0)
| $false
| $false ),
inference(rw,[status(thm)],[88,28,theory(equality)]) ).
cnf(90,negated_conjecture,
p101(esk1_0),
inference(cn,[status(thm)],[89,theory(equality)]) ).
cnf(91,negated_conjecture,
$false,
inference(sr,[status(thm)],[90,12,theory(equality)]) ).
cnf(92,negated_conjecture,
$false,
91,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL656+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpVgyt03/sel_LCL656+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL656+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL656+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL656+1.001.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
%
%------------------------------------------------------------------------------