TSTP Solution File: RNG121+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG121+4 : TPTP v5.0.0. Released v4.0.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 02:34:33 EST 2010
% Result : Theorem 0.34s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 104 ( 33 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 111 ( 33 ~; 26 |; 51 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 10 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(40,axiom,
( aElement0(xa)
& aElement0(xb) ),
file('/tmp/tmpm31slv/sel_RNG121+4.p_1',m__2091) ).
fof(42,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/tmp/tmpm31slv/sel_RNG121+4.p_1',mAddZero) ).
fof(44,axiom,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xa )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xb )
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/tmp/tmpm31slv/sel_RNG121+4.p_1',m__2203) ).
fof(53,conjecture,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| aElementOf0(xb,xI) ),
file('/tmp/tmpm31slv/sel_RNG121+4.p_1',m__) ).
fof(54,negated_conjecture,
~ ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| aElementOf0(xb,xI) ),
inference(assume_negation,[status(cth)],[53]) ).
fof(56,negated_conjecture,
~ ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| aElementOf0(xb,xI) ),
inference(fof_simplification,[status(thm)],[54,theory(equality)]) ).
cnf(329,plain,
aElement0(xb),
inference(split_conjunct,[status(thm)],[40]) ).
fof(339,plain,
! [X1] :
( ~ aElement0(X1)
| ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(340,plain,
! [X2] :
( ~ aElement0(X2)
| ( sdtpldt0(X2,sz00) = X2
& X2 = sdtpldt0(sz00,X2) ) ),
inference(variable_rename,[status(thm)],[339]) ).
fof(341,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aElement0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aElement0(X2) ) ),
inference(distribute,[status(thm)],[340]) ).
cnf(342,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[341]) ).
fof(347,plain,
( ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = sz00 )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = xa )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X4] :
( aElement0(X4)
& sdtasdt0(xb,X4) = sz00 )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X5] :
( aElement0(X5)
& sdtasdt0(xb,X5) = xb )
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(variable_rename,[status(thm)],[44]) ).
fof(348,plain,
( aElement0(esk36_0)
& sdtasdt0(xa,esk36_0) = sz00
& aElementOf0(sz00,slsdtgt0(xa))
& aElement0(esk37_0)
& sdtasdt0(xa,esk37_0) = xa
& aElementOf0(xa,slsdtgt0(xa))
& aElement0(esk38_0)
& sdtasdt0(xb,esk38_0) = sz00
& aElementOf0(sz00,slsdtgt0(xb))
& aElement0(esk39_0)
& sdtasdt0(xb,esk39_0) = xb
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(skolemize,[status(esa)],[347]) ).
cnf(349,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[348]) ).
cnf(358,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[348]) ).
fof(404,negated_conjecture,
( ! [X1,X2] :
( ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElementOf0(X2,slsdtgt0(xb))
| sdtpldt0(X1,X2) != xb )
& ~ aElementOf0(xb,xI) ),
inference(fof_nnf,[status(thm)],[56]) ).
fof(405,negated_conjecture,
( ! [X3,X4] :
( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X4,slsdtgt0(xb))
| sdtpldt0(X3,X4) != xb )
& ~ aElementOf0(xb,xI) ),
inference(variable_rename,[status(thm)],[404]) ).
fof(406,negated_conjecture,
! [X3,X4] :
( ( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X4,slsdtgt0(xb))
| sdtpldt0(X3,X4) != xb )
& ~ aElementOf0(xb,xI) ),
inference(shift_quantors,[status(thm)],[405]) ).
cnf(408,negated_conjecture,
( sdtpldt0(X1,X2) != xb
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[406]) ).
cnf(494,negated_conjecture,
( X1 != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[408,342,theory(equality)]) ).
cnf(500,negated_conjecture,
( X1 != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| $false
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[494,358,theory(equality)]) ).
cnf(501,negated_conjecture,
( X1 != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[500,theory(equality)]) ).
cnf(2647,plain,
~ aElement0(xb),
inference(spm,[status(thm)],[501,349,theory(equality)]) ).
cnf(2661,plain,
$false,
inference(rw,[status(thm)],[2647,329,theory(equality)]) ).
cnf(2662,plain,
$false,
inference(cn,[status(thm)],[2661,theory(equality)]) ).
cnf(2663,plain,
$false,
2662,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG121+4.p
% --creating new selector for []
% -running prover on /tmp/tmpm31slv/sel_RNG121+4.p_1 with time limit 29
% -prover status Theorem
% Problem RNG121+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG121+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG121+4.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
%
%------------------------------------------------------------------------------