TSTP Solution File: RNG046+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG046+1 : 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 01:46:53 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 105 ( 51 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 115 ( 43 ~; 35 |; 34 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( aScalar0(X1)
=> aScalar0(smndt0(X1)) ),
file('/tmp/tmp0CNULp/sel_RNG046+1.p_1',mNegSc) ).
fof(9,axiom,
( aScalar0(xx)
& aScalar0(xy) ),
file('/tmp/tmp0CNULp/sel_RNG046+1.p_1',m__799) ).
fof(10,axiom,
! [X1] :
( aScalar0(X1)
=> ( sdtpldt0(X1,sz0z00) = X1
& sdtpldt0(sz0z00,X1) = X1
& sdtasdt0(X1,sz0z00) = sz0z00
& sdtasdt0(sz0z00,X1) = sz0z00
& sdtpldt0(X1,smndt0(X1)) = sz0z00
& sdtpldt0(smndt0(X1),X1) = sz0z00
& smndt0(smndt0(X1)) = X1
& smndt0(sz0z00) = sz0z00 ) ),
file('/tmp/tmp0CNULp/sel_RNG046+1.p_1',mScZero) ).
fof(11,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> ( sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2))
& sdtasdt0(smndt0(X1),X2) = smndt0(sdtasdt0(X1,X2)) ) ),
file('/tmp/tmp0CNULp/sel_RNG046+1.p_1',mMNeg) ).
fof(14,conjecture,
sdtasdt0(smndt0(xx),smndt0(xy)) = sdtasdt0(xx,xy),
file('/tmp/tmp0CNULp/sel_RNG046+1.p_1',m__) ).
fof(20,negated_conjecture,
sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
inference(assume_negation,[status(cth)],[14]) ).
fof(21,negated_conjecture,
sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
fof(42,plain,
! [X1] :
( ~ aScalar0(X1)
| aScalar0(smndt0(X1)) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(43,plain,
! [X2] :
( ~ aScalar0(X2)
| aScalar0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[42]) ).
cnf(44,plain,
( aScalar0(smndt0(X1))
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(49,plain,
aScalar0(xy),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(50,plain,
aScalar0(xx),
inference(split_conjunct,[status(thm)],[9]) ).
fof(51,plain,
! [X1] :
( ~ aScalar0(X1)
| ( sdtpldt0(X1,sz0z00) = X1
& sdtpldt0(sz0z00,X1) = X1
& sdtasdt0(X1,sz0z00) = sz0z00
& sdtasdt0(sz0z00,X1) = sz0z00
& sdtpldt0(X1,smndt0(X1)) = sz0z00
& sdtpldt0(smndt0(X1),X1) = sz0z00
& smndt0(smndt0(X1)) = X1
& smndt0(sz0z00) = sz0z00 ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(52,plain,
! [X2] :
( ~ aScalar0(X2)
| ( sdtpldt0(X2,sz0z00) = X2
& sdtpldt0(sz0z00,X2) = X2
& sdtasdt0(X2,sz0z00) = sz0z00
& sdtasdt0(sz0z00,X2) = sz0z00
& sdtpldt0(X2,smndt0(X2)) = sz0z00
& sdtpldt0(smndt0(X2),X2) = sz0z00
& smndt0(smndt0(X2)) = X2
& smndt0(sz0z00) = sz0z00 ) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
! [X2] :
( ( sdtpldt0(X2,sz0z00) = X2
| ~ aScalar0(X2) )
& ( sdtpldt0(sz0z00,X2) = X2
| ~ aScalar0(X2) )
& ( sdtasdt0(X2,sz0z00) = sz0z00
| ~ aScalar0(X2) )
& ( sdtasdt0(sz0z00,X2) = sz0z00
| ~ aScalar0(X2) )
& ( sdtpldt0(X2,smndt0(X2)) = sz0z00
| ~ aScalar0(X2) )
& ( sdtpldt0(smndt0(X2),X2) = sz0z00
| ~ aScalar0(X2) )
& ( smndt0(smndt0(X2)) = X2
| ~ aScalar0(X2) )
& ( smndt0(sz0z00) = sz0z00
| ~ aScalar0(X2) ) ),
inference(distribute,[status(thm)],[52]) ).
cnf(55,plain,
( smndt0(smndt0(X1)) = X1
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(62,plain,
! [X1,X2] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ( sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2))
& sdtasdt0(smndt0(X1),X2) = smndt0(sdtasdt0(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(63,plain,
! [X3,X4] :
( ~ aScalar0(X3)
| ~ aScalar0(X4)
| ( sdtasdt0(X3,smndt0(X4)) = smndt0(sdtasdt0(X3,X4))
& sdtasdt0(smndt0(X3),X4) = smndt0(sdtasdt0(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,plain,
! [X3,X4] :
( ( sdtasdt0(X3,smndt0(X4)) = smndt0(sdtasdt0(X3,X4))
| ~ aScalar0(X3)
| ~ aScalar0(X4) )
& ( sdtasdt0(smndt0(X3),X4) = smndt0(sdtasdt0(X3,X4))
| ~ aScalar0(X3)
| ~ aScalar0(X4) ) ),
inference(distribute,[status(thm)],[63]) ).
cnf(65,plain,
( sdtasdt0(smndt0(X2),X1) = smndt0(sdtasdt0(X2,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(66,plain,
( sdtasdt0(X2,smndt0(X1)) = smndt0(sdtasdt0(X2,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(75,negated_conjecture,
sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(134,plain,
( sdtasdt0(smndt0(X1),X2) = sdtasdt0(X1,smndt0(X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(spm,[status(thm)],[66,65,theory(equality)]) ).
cnf(492,negated_conjecture,
( sdtasdt0(xx,smndt0(smndt0(xy))) != sdtasdt0(xx,xy)
| ~ aScalar0(xx)
| ~ aScalar0(smndt0(xy)) ),
inference(spm,[status(thm)],[75,134,theory(equality)]) ).
cnf(512,negated_conjecture,
( sdtasdt0(xx,smndt0(smndt0(xy))) != sdtasdt0(xx,xy)
| $false
| ~ aScalar0(smndt0(xy)) ),
inference(rw,[status(thm)],[492,50,theory(equality)]) ).
cnf(513,negated_conjecture,
( sdtasdt0(xx,smndt0(smndt0(xy))) != sdtasdt0(xx,xy)
| ~ aScalar0(smndt0(xy)) ),
inference(cn,[status(thm)],[512,theory(equality)]) ).
cnf(520,negated_conjecture,
( ~ aScalar0(smndt0(xy))
| ~ aScalar0(xy) ),
inference(spm,[status(thm)],[513,55,theory(equality)]) ).
cnf(521,negated_conjecture,
( ~ aScalar0(smndt0(xy))
| $false ),
inference(rw,[status(thm)],[520,49,theory(equality)]) ).
cnf(522,negated_conjecture,
~ aScalar0(smndt0(xy)),
inference(cn,[status(thm)],[521,theory(equality)]) ).
cnf(523,negated_conjecture,
~ aScalar0(xy),
inference(spm,[status(thm)],[522,44,theory(equality)]) ).
cnf(524,negated_conjecture,
$false,
inference(rw,[status(thm)],[523,49,theory(equality)]) ).
cnf(525,negated_conjecture,
$false,
inference(cn,[status(thm)],[524,theory(equality)]) ).
cnf(526,negated_conjecture,
$false,
525,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG046+1.p
% --creating new selector for []
% -running prover on /tmp/tmp0CNULp/sel_RNG046+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG046+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG046+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG046+1.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
%
%------------------------------------------------------------------------------