TSTP Solution File: RNG077+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG077+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:07:08 EST 2010
% Result : Theorem 0.70s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 95 ( 33 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 105 ( 45 ~; 40 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 1 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
( aScalar0(xE)
& xE = sdtasasdt0(xp,xq) ),
file('/tmp/tmpyjbBJE/sel_RNG077+1.p_1',m__1820) ).
fof(15,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ) ),
file('/tmp/tmpyjbBJE/sel_RNG077+1.p_1',mArith) ).
fof(17,axiom,
( aScalar0(xH)
& xH = sdtasdt0(xA,xB) ),
file('/tmp/tmpyjbBJE/sel_RNG077+1.p_1',m__1873) ).
fof(22,axiom,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/tmp/tmpyjbBJE/sel_RNG077+1.p_1',m__1911) ).
fof(41,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/tmp/tmpyjbBJE/sel_RNG077+1.p_1',mMulSc) ).
fof(42,conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) = sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
file('/tmp/tmpyjbBJE/sel_RNG077+1.p_1',m__) ).
fof(60,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(assume_negation,[status(cth)],[42]) ).
fof(61,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(fof_simplification,[status(thm)],[60,theory(equality)]) ).
cnf(85,plain,
aScalar0(xE),
inference(split_conjunct,[status(thm)],[7]) ).
fof(107,plain,
! [X1,X2,X3] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(108,plain,
! [X4,X5,X6] :
( ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6)
| ( sdtpldt0(sdtpldt0(X4,X5),X6) = sdtpldt0(X4,sdtpldt0(X5,X6))
& sdtpldt0(X4,X5) = sdtpldt0(X5,X4)
& sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6))
& sdtasdt0(X4,X5) = sdtasdt0(X5,X4) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,plain,
! [X4,X5,X6] :
( ( sdtpldt0(sdtpldt0(X4,X5),X6) = sdtpldt0(X4,sdtpldt0(X5,X6))
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) )
& ( sdtpldt0(X4,X5) = sdtpldt0(X5,X4)
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) )
& ( sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6))
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) )
& ( sdtasdt0(X4,X5) = sdtasdt0(X5,X4)
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) ) ),
inference(distribute,[status(thm)],[108]) ).
cnf(110,plain,
( sdtasdt0(X3,X2) = sdtasdt0(X2,X3)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(113,plain,
( sdtpldt0(sdtpldt0(X3,X2),X1) = sdtpldt0(X3,sdtpldt0(X2,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(118,plain,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(131,plain,
xP = sdtasdt0(xE,xH),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(132,plain,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[22]) ).
fof(196,plain,
! [X1,X2] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(197,plain,
! [X3,X4] :
( ~ aScalar0(X3)
| ~ aScalar0(X4)
| aScalar0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[196]) ).
cnf(198,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[197]) ).
cnf(199,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(393,negated_conjecture,
sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
inference(rw,[status(thm)],[199,131,theory(equality)]) ).
cnf(490,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[110,85,theory(equality)]) ).
cnf(13243,plain,
( sdtasdt0(xH,xE) = xP
| ~ aScalar0(xH)
| ~ aScalar0(xE) ),
inference(spm,[status(thm)],[131,490,theory(equality)]) ).
cnf(13433,plain,
( sdtasdt0(xH,xE) = xP
| $false
| ~ aScalar0(xE) ),
inference(rw,[status(thm)],[13243,118,theory(equality)]) ).
cnf(13434,plain,
( sdtasdt0(xH,xE) = xP
| $false
| $false ),
inference(rw,[status(thm)],[13433,85,theory(equality)]) ).
cnf(13435,plain,
sdtasdt0(xH,xE) = xP,
inference(cn,[status(thm)],[13434,theory(equality)]) ).
cnf(13831,negated_conjecture,
sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
inference(rw,[status(thm)],[393,13435,theory(equality)]) ).
cnf(13975,negated_conjecture,
( ~ aScalar0(xP)
| ~ aScalar0(sdtasdt0(xH,xH)) ),
inference(spm,[status(thm)],[13831,113,theory(equality)]) ).
cnf(13982,negated_conjecture,
( $false
| ~ aScalar0(sdtasdt0(xH,xH)) ),
inference(rw,[status(thm)],[13975,132,theory(equality)]) ).
cnf(13983,negated_conjecture,
~ aScalar0(sdtasdt0(xH,xH)),
inference(cn,[status(thm)],[13982,theory(equality)]) ).
cnf(14012,negated_conjecture,
~ aScalar0(xH),
inference(spm,[status(thm)],[13983,198,theory(equality)]) ).
cnf(14016,negated_conjecture,
$false,
inference(rw,[status(thm)],[14012,118,theory(equality)]) ).
cnf(14017,negated_conjecture,
$false,
inference(cn,[status(thm)],[14016,theory(equality)]) ).
cnf(14018,negated_conjecture,
$false,
14017,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG077+1.p
% --creating new selector for []
% -running prover on /tmp/tmpyjbBJE/sel_RNG077+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG077+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG077+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG077+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
%
%------------------------------------------------------------------------------