TSTP Solution File: RNG102+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG102+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 02:22:28 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 159 ( 58 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 228 ( 95 ~; 94 |; 36 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 59 ( 0 sgn 30 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/tmp/tmpmxSdKd/sel_RNG102+1.p_1',m__1933) ).
fof(19,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/tmp/tmpmxSdKd/sel_RNG102+1.p_1',mDefPrIdeal) ).
fof(35,axiom,
aElement0(xc),
file('/tmp/tmpmxSdKd/sel_RNG102+1.p_1',m__1905) ).
fof(40,conjecture,
? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy ),
file('/tmp/tmpmxSdKd/sel_RNG102+1.p_1',m__) ).
fof(42,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy ),
inference(assume_negation,[status(cth)],[40]) ).
cnf(91,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[9]) ).
fof(126,plain,
! [X1] :
( ~ aElement0(X1)
| ! [X2] :
( ( X2 != slsdtgt0(X1)
| ( aSet0(X2)
& ! [X3] :
( ( ~ aElementOf0(X3,X2)
| ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) )
& ( ! [X4] :
( ~ aElement0(X4)
| sdtasdt0(X1,X4) != X3 )
| aElementOf0(X3,X2) ) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( ( ~ aElementOf0(X3,X2)
| ! [X4] :
( ~ aElement0(X4)
| sdtasdt0(X1,X4) != X3 ) )
& ( aElementOf0(X3,X2)
| ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) )
| X2 = slsdtgt0(X1) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(127,plain,
! [X5] :
( ~ aElement0(X5)
| ! [X6] :
( ( X6 != slsdtgt0(X5)
| ( aSet0(X6)
& ! [X7] :
( ( ~ aElementOf0(X7,X6)
| ? [X8] :
( aElement0(X8)
& sdtasdt0(X5,X8) = X7 ) )
& ( ! [X9] :
( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7 )
| aElementOf0(X7,X6) ) ) ) )
& ( ~ aSet0(X6)
| ? [X10] :
( ( ~ aElementOf0(X10,X6)
| ! [X11] :
( ~ aElement0(X11)
| sdtasdt0(X5,X11) != X10 ) )
& ( aElementOf0(X10,X6)
| ? [X12] :
( aElement0(X12)
& sdtasdt0(X5,X12) = X10 ) ) )
| X6 = slsdtgt0(X5) ) ) ),
inference(variable_rename,[status(thm)],[126]) ).
fof(128,plain,
! [X5] :
( ~ aElement0(X5)
| ! [X6] :
( ( X6 != slsdtgt0(X5)
| ( aSet0(X6)
& ! [X7] :
( ( ~ aElementOf0(X7,X6)
| ( aElement0(esk6_3(X5,X6,X7))
& sdtasdt0(X5,esk6_3(X5,X6,X7)) = X7 ) )
& ( ! [X9] :
( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7 )
| aElementOf0(X7,X6) ) ) ) )
& ( ~ aSet0(X6)
| ( ( ~ aElementOf0(esk7_2(X5,X6),X6)
| ! [X11] :
( ~ aElement0(X11)
| sdtasdt0(X5,X11) != esk7_2(X5,X6) ) )
& ( aElementOf0(esk7_2(X5,X6),X6)
| ( aElement0(esk8_2(X5,X6))
& sdtasdt0(X5,esk8_2(X5,X6)) = esk7_2(X5,X6) ) ) )
| X6 = slsdtgt0(X5) ) ) ),
inference(skolemize,[status(esa)],[127]) ).
fof(129,plain,
! [X5,X6,X7,X9,X11] :
( ( ( ( ( ~ aElement0(X11)
| sdtasdt0(X5,X11) != esk7_2(X5,X6)
| ~ aElementOf0(esk7_2(X5,X6),X6) )
& ( aElementOf0(esk7_2(X5,X6),X6)
| ( aElement0(esk8_2(X5,X6))
& sdtasdt0(X5,esk8_2(X5,X6)) = esk7_2(X5,X6) ) ) )
| ~ aSet0(X6)
| X6 = slsdtgt0(X5) )
& ( ( ( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7
| aElementOf0(X7,X6) )
& ( ~ aElementOf0(X7,X6)
| ( aElement0(esk6_3(X5,X6,X7))
& sdtasdt0(X5,esk6_3(X5,X6,X7)) = X7 ) )
& aSet0(X6) )
| X6 != slsdtgt0(X5) ) )
| ~ aElement0(X5) ),
inference(shift_quantors,[status(thm)],[128]) ).
fof(130,plain,
! [X5,X6,X7,X9,X11] :
( ( ~ aElement0(X11)
| sdtasdt0(X5,X11) != esk7_2(X5,X6)
| ~ aElementOf0(esk7_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk8_2(X5,X6))
| aElementOf0(esk7_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk8_2(X5,X6)) = esk7_2(X5,X6)
| aElementOf0(esk7_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7
| aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk6_3(X5,X6,X7))
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk6_3(X5,X6,X7)) = X7
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aSet0(X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) ) ),
inference(distribute,[status(thm)],[129]) ).
cnf(132,plain,
( sdtasdt0(X1,esk6_3(X1,X2,X3)) = X3
| ~ aElement0(X1)
| X2 != slsdtgt0(X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(133,plain,
( aElement0(esk6_3(X1,X2,X3))
| ~ aElement0(X1)
| X2 != slsdtgt0(X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(217,plain,
aElement0(xc),
inference(split_conjunct,[status(thm)],[35]) ).
fof(243,negated_conjecture,
! [X1] :
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != xy ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(244,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| sdtasdt0(xc,X2) != xy ),
inference(variable_rename,[status(thm)],[243]) ).
cnf(245,negated_conjecture,
( sdtasdt0(xc,X1) != xy
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(510,negated_conjecture,
( X2 != xy
| ~ aElement0(esk6_3(xc,X1,X2))
| slsdtgt0(xc) != X1
| ~ aElement0(xc)
| ~ aElementOf0(X2,X1) ),
inference(spm,[status(thm)],[245,132,theory(equality)]) ).
cnf(522,negated_conjecture,
( X2 != xy
| ~ aElement0(esk6_3(xc,X1,X2))
| slsdtgt0(xc) != X1
| $false
| ~ aElementOf0(X2,X1) ),
inference(rw,[status(thm)],[510,217,theory(equality)]) ).
cnf(523,negated_conjecture,
( X2 != xy
| ~ aElement0(esk6_3(xc,X1,X2))
| slsdtgt0(xc) != X1
| ~ aElementOf0(X2,X1) ),
inference(cn,[status(thm)],[522,theory(equality)]) ).
cnf(810,negated_conjecture,
( slsdtgt0(xc) != X1
| X2 != xy
| ~ aElementOf0(X2,X1)
| ~ aElement0(xc) ),
inference(spm,[status(thm)],[523,133,theory(equality)]) ).
cnf(811,negated_conjecture,
( slsdtgt0(xc) != X1
| X2 != xy
| ~ aElementOf0(X2,X1)
| $false ),
inference(rw,[status(thm)],[810,217,theory(equality)]) ).
cnf(812,negated_conjecture,
( slsdtgt0(xc) != X1
| X2 != xy
| ~ aElementOf0(X2,X1) ),
inference(cn,[status(thm)],[811,theory(equality)]) ).
cnf(813,negated_conjecture,
( X1 != xy
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
inference(er,[status(thm)],[812,theory(equality)]) ).
cnf(816,plain,
$false,
inference(spm,[status(thm)],[813,91,theory(equality)]) ).
cnf(826,plain,
$false,
816,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG102+1.p
% --creating new selector for []
% -running prover on /tmp/tmpmxSdKd/sel_RNG102+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG102+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG102+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG102+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
%
%------------------------------------------------------------------------------