TSTP Solution File: RNG105+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG105+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:23:37 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 142 ( 33 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 167 ( 71 ~; 55 |; 37 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',m__2043) ).
fof(10,axiom,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xx )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',m__1933) ).
fof(12,axiom,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',m__2010) ).
fof(15,axiom,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',m__1979) ).
fof(28,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',mSortsB_02) ).
fof(30,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',mSortsB) ).
fof(43,conjecture,
( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',m__) ).
fof(44,axiom,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/tmp/tmpm0Aptr/sel_RNG105+2.p_1',m__1956) ).
fof(45,negated_conjecture,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(assume_negation,[status(cth)],[43]) ).
cnf(72,plain,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[6]) ).
fof(94,plain,
( ? [X2] :
( aElement0(X2)
& sdtasdt0(xc,X2) = xx )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X3] :
( aElement0(X3)
& sdtasdt0(xc,X3) = xy )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(95,plain,
( aElement0(esk6_0)
& sdtasdt0(xc,esk6_0) = xx
& aElementOf0(xx,slsdtgt0(xc))
& aElement0(esk7_0)
& sdtasdt0(xc,esk7_0) = xy
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[94]) ).
cnf(96,plain,
aElement0(xz),
inference(split_conjunct,[status(thm)],[95]) ).
cnf(106,plain,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(114,plain,
aElement0(xv),
inference(split_conjunct,[status(thm)],[15]) ).
fof(187,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| aElement0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(188,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[187]) ).
cnf(189,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[188]) ).
fof(191,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| aElement0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(192,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[191]) ).
cnf(193,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[192]) ).
fof(256,negated_conjecture,
( ( ! [X1] :
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != sdtpldt0(xx,xy) )
& ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
| ( ! [X1] :
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != sdtasdt0(xz,xx) )
& ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(257,negated_conjecture,
( ( ! [X2] :
( ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy) )
& ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
| ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(xc,X3) != sdtasdt0(xz,xx) )
& ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(variable_rename,[status(thm)],[256]) ).
fof(258,negated_conjecture,
! [X2,X3] :
( ( ( ~ aElement0(X3)
| sdtasdt0(xc,X3) != sdtasdt0(xz,xx) )
& ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) )
| ( ( ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy) )
& ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) ) ),
inference(shift_quantors,[status(thm)],[257]) ).
fof(259,negated_conjecture,
! [X2,X3] :
( ( ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy)
| ~ aElement0(X3)
| sdtasdt0(xc,X3) != sdtasdt0(xz,xx) )
& ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
| ~ aElement0(X3)
| sdtasdt0(xc,X3) != sdtasdt0(xz,xx) )
& ( ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy)
| ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) )
& ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
| ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(distribute,[status(thm)],[258]) ).
cnf(263,negated_conjecture,
( sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(X1)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[259]) ).
cnf(265,plain,
aElement0(xu),
inference(split_conjunct,[status(thm)],[44]) ).
fof(879,plain,
( ~ epred1_0
<=> ! [X1] :
( ~ aElement0(X1)
| sdtasdt0(xz,xx) != sdtasdt0(xc,X1) ) ),
introduced(definition),
[split] ).
cnf(880,plain,
( epred1_0
| ~ aElement0(X1)
| sdtasdt0(xz,xx) != sdtasdt0(xc,X1) ),
inference(split_equiv,[status(thm)],[879]) ).
fof(881,plain,
( ~ epred2_0
<=> ! [X2] :
( ~ aElement0(X2)
| sdtpldt0(xx,xy) != sdtasdt0(xc,X2) ) ),
introduced(definition),
[split] ).
cnf(882,plain,
( epred2_0
| ~ aElement0(X2)
| sdtpldt0(xx,xy) != sdtasdt0(xc,X2) ),
inference(split_equiv,[status(thm)],[881]) ).
cnf(883,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[263,879,theory(equality)]),881,theory(equality)]),
[split] ).
cnf(921,plain,
( epred1_0
| ~ aElement0(sdtasdt0(xu,xz)) ),
inference(spm,[status(thm)],[880,72,theory(equality)]) ).
cnf(946,plain,
( epred1_0
| ~ aElement0(xz)
| ~ aElement0(xu) ),
inference(spm,[status(thm)],[921,189,theory(equality)]) ).
cnf(949,plain,
( epred1_0
| $false
| ~ aElement0(xu) ),
inference(rw,[status(thm)],[946,96,theory(equality)]) ).
cnf(950,plain,
( epred1_0
| $false
| $false ),
inference(rw,[status(thm)],[949,265,theory(equality)]) ).
cnf(951,plain,
epred1_0,
inference(cn,[status(thm)],[950,theory(equality)]) ).
cnf(960,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[883,951,theory(equality)]) ).
cnf(961,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[960,theory(equality)]) ).
cnf(1000,negated_conjecture,
( ~ aElement0(X2)
| sdtpldt0(xx,xy) != sdtasdt0(xc,X2) ),
inference(sr,[status(thm)],[882,961,theory(equality)]) ).
cnf(1002,plain,
~ aElement0(sdtpldt0(xu,xv)),
inference(spm,[status(thm)],[1000,106,theory(equality)]) ).
cnf(1018,plain,
( ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(spm,[status(thm)],[1002,193,theory(equality)]) ).
cnf(1019,plain,
( $false
| ~ aElement0(xu) ),
inference(rw,[status(thm)],[1018,114,theory(equality)]) ).
cnf(1020,plain,
( $false
| $false ),
inference(rw,[status(thm)],[1019,265,theory(equality)]) ).
cnf(1021,plain,
$false,
inference(cn,[status(thm)],[1020,theory(equality)]) ).
cnf(1022,plain,
$false,
1021,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG105+2.p
% --creating new selector for []
% -running prover on /tmp/tmpm0Aptr/sel_RNG105+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG105+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG105+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG105+2.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
%
%------------------------------------------------------------------------------