TSTP Solution File: RNG091+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG091+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:15:02 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 116 ( 25 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 156 ( 74 ~; 59 |; 21 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/tmp/tmpAfVfpa/sel_RNG091+2.p_1',m__1061) ).
fof(3,axiom,
sdtasdt0(xz,xx) = sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),
file('/tmp/tmpAfVfpa/sel_RNG091+2.p_1',m__1098) ).
fof(6,axiom,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/tmp/tmpAfVfpa/sel_RNG091+2.p_1',m__994) ).
fof(11,conjecture,
( ( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)) )
& ( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ) ),
file('/tmp/tmpAfVfpa/sel_RNG091+2.p_1',m__) ).
fof(32,axiom,
( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
file('/tmp/tmpAfVfpa/sel_RNG091+2.p_1',m__1021) ).
fof(34,negated_conjecture,
~ ( ( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)) )
& ( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ) ),
inference(assume_negation,[status(cth)],[11]) ).
cnf(35,plain,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(split_conjunct,[status(thm)],[1]) ).
cnf(40,plain,
sdtasdt0(xz,xx) = sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(49,plain,
aElementOf0(sdtpldt0(xl,xn),xJ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(50,plain,
aElementOf0(sdtpldt0(xk,xm),xI),
inference(split_conjunct,[status(thm)],[6]) ).
fof(70,negated_conjecture,
( ( ! [X1,X2] :
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtpldt0(X1,X2) != sdtpldt0(xx,xy) )
& ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)) )
| ( ! [X1,X2] :
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtpldt0(X1,X2) != sdtasdt0(xz,xx) )
& ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(71,negated_conjecture,
( ( ! [X3,X4] :
( ~ aElementOf0(X3,xI)
| ~ aElementOf0(X4,xJ)
| sdtpldt0(X3,X4) != sdtpldt0(xx,xy) )
& ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)) )
| ( ! [X5,X6] :
( ~ aElementOf0(X5,xI)
| ~ aElementOf0(X6,xJ)
| sdtpldt0(X5,X6) != sdtasdt0(xz,xx) )
& ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,negated_conjecture,
! [X3,X4,X5,X6] :
( ( ( ~ aElementOf0(X5,xI)
| ~ aElementOf0(X6,xJ)
| sdtpldt0(X5,X6) != sdtasdt0(xz,xx) )
& ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) )
| ( ( ~ aElementOf0(X3,xI)
| ~ aElementOf0(X4,xJ)
| sdtpldt0(X3,X4) != sdtpldt0(xx,xy) )
& ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)) ) ),
inference(shift_quantors,[status(thm)],[71]) ).
fof(73,negated_conjecture,
! [X3,X4,X5,X6] :
( ( ~ aElementOf0(X3,xI)
| ~ aElementOf0(X4,xJ)
| sdtpldt0(X3,X4) != sdtpldt0(xx,xy)
| ~ aElementOf0(X5,xI)
| ~ aElementOf0(X6,xJ)
| sdtpldt0(X5,X6) != sdtasdt0(xz,xx) )
& ( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
| ~ aElementOf0(X5,xI)
| ~ aElementOf0(X6,xJ)
| sdtpldt0(X5,X6) != sdtasdt0(xz,xx) )
& ( ~ aElementOf0(X3,xI)
| ~ aElementOf0(X4,xJ)
| sdtpldt0(X3,X4) != sdtpldt0(xx,xy)
| ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) )
& ( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
| ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ) ),
inference(distribute,[status(thm)],[72]) ).
cnf(77,negated_conjecture,
( sdtpldt0(X1,X2) != sdtasdt0(xz,xx)
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI)
| sdtpldt0(X3,X4) != sdtpldt0(xx,xy)
| ~ aElementOf0(X4,xJ)
| ~ aElementOf0(X3,xI) ),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(179,plain,
aElementOf0(sdtasdt0(xz,xl),xJ),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(180,plain,
aElementOf0(sdtasdt0(xz,xk),xI),
inference(split_conjunct,[status(thm)],[32]) ).
fof(641,plain,
( ~ epred1_0
<=> ! [X4,X3] :
( ~ aElementOf0(X3,xI)
| ~ aElementOf0(X4,xJ)
| sdtpldt0(xx,xy) != sdtpldt0(X3,X4) ) ),
introduced(definition),
[split] ).
cnf(642,plain,
( epred1_0
| ~ aElementOf0(X3,xI)
| ~ aElementOf0(X4,xJ)
| sdtpldt0(xx,xy) != sdtpldt0(X3,X4) ),
inference(split_equiv,[status(thm)],[641]) ).
fof(643,plain,
( ~ epred2_0
<=> ! [X2,X1] :
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtasdt0(xz,xx) != sdtpldt0(X1,X2) ) ),
introduced(definition),
[split] ).
cnf(644,plain,
( epred2_0
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtasdt0(xz,xx) != sdtpldt0(X1,X2) ),
inference(split_equiv,[status(thm)],[643]) ).
cnf(645,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[77,641,theory(equality)]),643,theory(equality)]),
[split] ).
cnf(672,plain,
( epred1_0
| ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(spm,[status(thm)],[642,35,theory(equality)]) ).
cnf(699,plain,
( epred1_0
| $false
| ~ aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(rw,[status(thm)],[672,50,theory(equality)]) ).
cnf(700,plain,
( epred1_0
| $false
| $false ),
inference(rw,[status(thm)],[699,49,theory(equality)]) ).
cnf(701,plain,
epred1_0,
inference(cn,[status(thm)],[700,theory(equality)]) ).
cnf(703,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[645,701,theory(equality)]) ).
cnf(704,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[703,theory(equality)]) ).
cnf(705,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtasdt0(xz,xx) != sdtpldt0(X1,X2) ),
inference(sr,[status(thm)],[644,704,theory(equality)]) ).
cnf(706,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(spm,[status(thm)],[705,40,theory(equality)]) ).
cnf(721,plain,
( $false
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(rw,[status(thm)],[706,180,theory(equality)]) ).
cnf(722,plain,
( $false
| $false ),
inference(rw,[status(thm)],[721,179,theory(equality)]) ).
cnf(723,plain,
$false,
inference(cn,[status(thm)],[722,theory(equality)]) ).
cnf(724,plain,
$false,
723,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG091+2.p
% --creating new selector for []
% -running prover on /tmp/tmpAfVfpa/sel_RNG091+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG091+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG091+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG091+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
%
%------------------------------------------------------------------------------