TSTP Solution File: RNG103+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG103+2 : 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:23:04 EST 2010
% Result : Theorem 0.61s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 17 unt; 0 def)
% Number of atoms : 123 ( 33 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 128 ( 55 ~; 60 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',mAddComm) ).
fof(6,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',mAMDistr) ).
fof(13,axiom,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',m__1979) ).
fof(26,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',mSortsB_02) ).
fof(36,axiom,
aElement0(xc),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',m__1905) ).
fof(41,conjecture,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',m__) ).
fof(42,axiom,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/tmp/tmp3AnfBc/sel_RNG103+2.p_1',m__1956) ).
fof(43,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(assume_negation,[status(cth)],[41]) ).
fof(44,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(fof_simplification,[status(thm)],[43,theory(equality)]) ).
fof(57,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(58,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(71,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(72,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6)
| ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
& sdtasdt0(sdtpldt0(X5,X6),X4) = sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)) ) ),
inference(variable_rename,[status(thm)],[71]) ).
fof(73,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6) )
& ( sdtasdt0(sdtpldt0(X5,X6),X4) = sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
| ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[72]) ).
cnf(75,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(110,plain,
sdtasdt0(xc,xv) = xy,
inference(split_conjunct,[status(thm)],[13]) ).
cnf(111,plain,
aElement0(xv),
inference(split_conjunct,[status(thm)],[13]) ).
fof(184,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| aElement0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(185,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[184]) ).
cnf(186,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[185]) ).
cnf(227,plain,
aElement0(xc),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(253,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(254,plain,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[42]) ).
cnf(255,plain,
aElement0(xu),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(326,negated_conjecture,
( sdtasdt0(xc,sdtpldt0(xv,xu)) != sdtpldt0(xx,xy)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(spm,[status(thm)],[253,59,theory(equality)]) ).
cnf(334,negated_conjecture,
( sdtasdt0(xc,sdtpldt0(xv,xu)) != sdtpldt0(xx,xy)
| $false
| ~ aElement0(xu) ),
inference(rw,[status(thm)],[326,111,theory(equality)]) ).
cnf(335,negated_conjecture,
( sdtasdt0(xc,sdtpldt0(xv,xu)) != sdtpldt0(xx,xy)
| $false
| $false ),
inference(rw,[status(thm)],[334,255,theory(equality)]) ).
cnf(336,negated_conjecture,
sdtasdt0(xc,sdtpldt0(xv,xu)) != sdtpldt0(xx,xy),
inference(cn,[status(thm)],[335,theory(equality)]) ).
cnf(348,plain,
( aElement0(xy)
| ~ aElement0(xv)
| ~ aElement0(xc) ),
inference(spm,[status(thm)],[186,110,theory(equality)]) ).
cnf(349,plain,
( aElement0(xx)
| ~ aElement0(xu)
| ~ aElement0(xc) ),
inference(spm,[status(thm)],[186,254,theory(equality)]) ).
cnf(360,plain,
( aElement0(xy)
| $false
| ~ aElement0(xc) ),
inference(rw,[status(thm)],[348,111,theory(equality)]) ).
cnf(361,plain,
( aElement0(xy)
| $false
| $false ),
inference(rw,[status(thm)],[360,227,theory(equality)]) ).
cnf(362,plain,
aElement0(xy),
inference(cn,[status(thm)],[361,theory(equality)]) ).
cnf(363,plain,
( aElement0(xx)
| $false
| ~ aElement0(xc) ),
inference(rw,[status(thm)],[349,255,theory(equality)]) ).
cnf(364,plain,
( aElement0(xx)
| $false
| $false ),
inference(rw,[status(thm)],[363,227,theory(equality)]) ).
cnf(365,plain,
aElement0(xx),
inference(cn,[status(thm)],[364,theory(equality)]) ).
cnf(619,plain,
( sdtpldt0(xy,sdtasdt0(xc,X1)) = sdtasdt0(xc,sdtpldt0(xv,X1))
| ~ aElement0(xc)
| ~ aElement0(xv)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[75,110,theory(equality)]) ).
cnf(654,plain,
( sdtpldt0(xy,sdtasdt0(xc,X1)) = sdtasdt0(xc,sdtpldt0(xv,X1))
| $false
| ~ aElement0(xv)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[619,227,theory(equality)]) ).
cnf(655,plain,
( sdtpldt0(xy,sdtasdt0(xc,X1)) = sdtasdt0(xc,sdtpldt0(xv,X1))
| $false
| $false
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[654,111,theory(equality)]) ).
cnf(656,plain,
( sdtpldt0(xy,sdtasdt0(xc,X1)) = sdtasdt0(xc,sdtpldt0(xv,X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[655,theory(equality)]) ).
cnf(6990,plain,
( sdtpldt0(xy,xx) = sdtasdt0(xc,sdtpldt0(xv,xu))
| ~ aElement0(xu) ),
inference(spm,[status(thm)],[656,254,theory(equality)]) ).
cnf(7025,plain,
( sdtpldt0(xy,xx) = sdtasdt0(xc,sdtpldt0(xv,xu))
| $false ),
inference(rw,[status(thm)],[6990,255,theory(equality)]) ).
cnf(7026,plain,
sdtpldt0(xy,xx) = sdtasdt0(xc,sdtpldt0(xv,xu)),
inference(cn,[status(thm)],[7025,theory(equality)]) ).
cnf(7189,negated_conjecture,
sdtpldt0(xy,xx) != sdtpldt0(xx,xy),
inference(rw,[status(thm)],[336,7026,theory(equality)]) ).
cnf(7263,negated_conjecture,
( ~ aElement0(xy)
| ~ aElement0(xx) ),
inference(spm,[status(thm)],[7189,59,theory(equality)]) ).
cnf(7265,negated_conjecture,
( $false
| ~ aElement0(xx) ),
inference(rw,[status(thm)],[7263,362,theory(equality)]) ).
cnf(7266,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[7265,365,theory(equality)]) ).
cnf(7267,negated_conjecture,
$false,
inference(cn,[status(thm)],[7266,theory(equality)]) ).
cnf(7268,negated_conjecture,
$false,
7267,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG103+2.p
% --creating new selector for []
% -running prover on /tmp/tmp3AnfBc/sel_RNG103+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG103+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG103+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG103+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
%
%------------------------------------------------------------------------------