TSTP Solution File: RNG115+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG115+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:29:51 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 144 ( 54 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 203 ( 81 ~; 57 |; 63 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 33 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/tmp/tmpovdt1q/sel_RNG115+4.p_1',m__2273) ).
fof(47,conjecture,
? [X1,X2] :
( ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 )
| aElementOf0(X2,slsdtgt0(xb)) )
& xu = sdtpldt0(X1,X2) ),
file('/tmp/tmpovdt1q/sel_RNG115+4.p_1',m__) ).
fof(48,negated_conjecture,
~ ? [X1,X2] :
( ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 )
| aElementOf0(X2,slsdtgt0(xb)) )
& xu = sdtpldt0(X1,X2) ),
inference(assume_negation,[status(cth)],[47]) ).
fof(49,plain,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(153,plain,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ! [X2,X3] :
( ~ aElementOf0(X2,slsdtgt0(xa))
| ~ aElementOf0(X3,slsdtgt0(xb))
| sdtpldt0(X2,X3) != X1 )
& ~ aElementOf0(X1,xI) )
| X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_nnf,[status(thm)],[49]) ).
fof(154,plain,
( ? [X4,X5] :
( aElementOf0(X4,slsdtgt0(xa))
& aElementOf0(X5,slsdtgt0(xb))
& sdtpldt0(X4,X5) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X6] :
( ( ! [X7,X8] :
( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6 )
& ~ aElementOf0(X6,xI) )
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,plain,
( aElementOf0(esk9_0,slsdtgt0(xa))
& aElementOf0(esk10_0,slsdtgt0(xb))
& sdtpldt0(esk9_0,esk10_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ! [X6] :
( ( ! [X7,X8] :
( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6 )
& ~ aElementOf0(X6,xI) )
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
inference(skolemize,[status(esa)],[154]) ).
fof(156,plain,
! [X6,X7,X8] :
( ( ( ( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6 )
& ~ aElementOf0(X6,xI) )
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& aElementOf0(esk9_0,slsdtgt0(xa))
& aElementOf0(esk10_0,slsdtgt0(xb))
& sdtpldt0(esk9_0,esk10_0) = xu
& aElementOf0(xu,xI)
& xu != sz00 ),
inference(shift_quantors,[status(thm)],[155]) ).
fof(157,plain,
! [X6,X7,X8] :
( ( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& aElementOf0(esk9_0,slsdtgt0(xa))
& aElementOf0(esk10_0,slsdtgt0(xb))
& sdtpldt0(esk9_0,esk10_0) = xu
& aElementOf0(xu,xI)
& xu != sz00 ),
inference(distribute,[status(thm)],[156]) ).
cnf(160,plain,
sdtpldt0(esk9_0,esk10_0) = xu,
inference(split_conjunct,[status(thm)],[157]) ).
cnf(161,plain,
aElementOf0(esk10_0,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(162,plain,
aElementOf0(esk9_0,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[157]) ).
fof(370,negated_conjecture,
! [X1,X2] :
( ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(xa,X3) != X1 )
& ~ aElementOf0(X1,slsdtgt0(xa)) )
| ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(xb,X3) != X2 )
& ~ aElementOf0(X2,slsdtgt0(xb)) )
| xu != sdtpldt0(X1,X2) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(371,negated_conjecture,
! [X4,X5] :
( ( ! [X6] :
( ~ aElement0(X6)
| sdtasdt0(xa,X6) != X4 )
& ~ aElementOf0(X4,slsdtgt0(xa)) )
| ( ! [X7] :
( ~ aElement0(X7)
| sdtasdt0(xb,X7) != X5 )
& ~ aElementOf0(X5,slsdtgt0(xb)) )
| xu != sdtpldt0(X4,X5) ),
inference(variable_rename,[status(thm)],[370]) ).
fof(372,negated_conjecture,
! [X4,X5,X6,X7] :
( ( ( ~ aElement0(X7)
| sdtasdt0(xb,X7) != X5 )
& ~ aElementOf0(X5,slsdtgt0(xb)) )
| ( ( ~ aElement0(X6)
| sdtasdt0(xa,X6) != X4 )
& ~ aElementOf0(X4,slsdtgt0(xa)) )
| xu != sdtpldt0(X4,X5) ),
inference(shift_quantors,[status(thm)],[371]) ).
fof(373,negated_conjecture,
! [X4,X5,X6,X7] :
( ( ~ aElement0(X6)
| sdtasdt0(xa,X6) != X4
| ~ aElement0(X7)
| sdtasdt0(xb,X7) != X5
| xu != sdtpldt0(X4,X5) )
& ( ~ aElementOf0(X4,slsdtgt0(xa))
| ~ aElement0(X7)
| sdtasdt0(xb,X7) != X5
| xu != sdtpldt0(X4,X5) )
& ( ~ aElement0(X6)
| sdtasdt0(xa,X6) != X4
| ~ aElementOf0(X5,slsdtgt0(xb))
| xu != sdtpldt0(X4,X5) )
& ( ~ aElementOf0(X4,slsdtgt0(xa))
| ~ aElementOf0(X5,slsdtgt0(xb))
| xu != sdtpldt0(X4,X5) ) ),
inference(distribute,[status(thm)],[372]) ).
cnf(374,negated_conjecture,
( xu != sdtpldt0(X1,X2)
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[373]) ).
cnf(388,plain,
( ~ aElementOf0(esk10_0,slsdtgt0(xb))
| ~ aElementOf0(esk9_0,slsdtgt0(xa)) ),
inference(spm,[status(thm)],[374,160,theory(equality)]) ).
cnf(390,plain,
( $false
| ~ aElementOf0(esk9_0,slsdtgt0(xa)) ),
inference(rw,[status(thm)],[388,161,theory(equality)]) ).
cnf(391,plain,
( $false
| $false ),
inference(rw,[status(thm)],[390,162,theory(equality)]) ).
cnf(392,plain,
$false,
inference(cn,[status(thm)],[391,theory(equality)]) ).
cnf(393,plain,
$false,
392,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG115+4.p
% --creating new selector for []
% -running prover on /tmp/tmpovdt1q/sel_RNG115+4.p_1 with time limit 29
% -prover status Theorem
% Problem RNG115+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG115+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG115+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
%
%------------------------------------------------------------------------------