TSTP Solution File: RNG072+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG072+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:04:56 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 15 unt; 0 def)
% Number of atoms : 90 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 105 ( 49 ~; 43 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',m__2610) ).
fof(10,axiom,
! [X1,X2,X3,X4] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3)
& aScalar0(X4) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(sz0z00,X3)
& sdtlseqdt0(X3,X4) )
=> sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4)) ) ),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',mLEMonM) ).
fof(24,axiom,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',m__1911) ).
fof(28,axiom,
( sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
& sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)) ),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',m__2628) ).
fof(38,axiom,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',m__1892) ).
fof(40,axiom,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',m__1930) ).
fof(47,conjecture,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',m__) ).
fof(59,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/tmp/tmpTuE_nR/sel_RNG072+2.p_1',mSumSc) ).
fof(64,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(assume_negation,[status(cth)],[47]) ).
fof(65,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(fof_simplification,[status(thm)],[64,theory(equality)]) ).
cnf(91,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[8]) ).
fof(95,plain,
! [X1,X2,X3,X4] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| ~ aScalar0(X4)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(sz0z00,X3)
| ~ sdtlseqdt0(X3,X4)
| sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4)) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(96,plain,
! [X5,X6,X7,X8] :
( ~ aScalar0(X5)
| ~ aScalar0(X6)
| ~ aScalar0(X7)
| ~ aScalar0(X8)
| ~ sdtlseqdt0(X5,X6)
| ~ sdtlseqdt0(sz0z00,X7)
| ~ sdtlseqdt0(X7,X8)
| sdtlseqdt0(sdtasdt0(X5,X7),sdtasdt0(X6,X8)) ),
inference(variable_rename,[status(thm)],[95]) ).
cnf(97,plain,
( sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X3,X4))
| ~ sdtlseqdt0(X2,X4)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X1,X3)
| ~ aScalar0(X4)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(139,plain,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(149,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(185,plain,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(190,plain,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(210,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(split_conjunct,[status(thm)],[65]) ).
fof(245,plain,
! [X1,X2] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| aScalar0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(246,plain,
! [X3,X4] :
( ~ aScalar0(X3)
| ~ aScalar0(X4)
| aScalar0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[245]) ).
cnf(247,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[246]) ).
cnf(945,negated_conjecture,
( ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(spm,[status(thm)],[210,97,theory(equality)]) ).
cnf(994,negated_conjecture,
( $false
| ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(rw,[status(thm)],[945,149,theory(equality)]) ).
cnf(995,negated_conjecture,
( $false
| $false
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(rw,[status(thm)],[994,91,theory(equality)]) ).
cnf(996,negated_conjecture,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(cn,[status(thm)],[995,theory(equality)]) ).
cnf(1253,negated_conjecture,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(xS)
| ~ aScalar0(xR) ),
inference(spm,[status(thm)],[996,247,theory(equality)]) ).
cnf(1254,negated_conjecture,
( ~ aScalar0(sdtpldt0(xP,xP))
| $false
| ~ aScalar0(xR) ),
inference(rw,[status(thm)],[1253,190,theory(equality)]) ).
cnf(1255,negated_conjecture,
( ~ aScalar0(sdtpldt0(xP,xP))
| $false
| $false ),
inference(rw,[status(thm)],[1254,185,theory(equality)]) ).
cnf(1256,negated_conjecture,
~ aScalar0(sdtpldt0(xP,xP)),
inference(cn,[status(thm)],[1255,theory(equality)]) ).
cnf(1286,negated_conjecture,
~ aScalar0(xP),
inference(spm,[status(thm)],[1256,247,theory(equality)]) ).
cnf(1287,negated_conjecture,
$false,
inference(rw,[status(thm)],[1286,139,theory(equality)]) ).
cnf(1288,negated_conjecture,
$false,
inference(cn,[status(thm)],[1287,theory(equality)]) ).
cnf(1289,negated_conjecture,
$false,
1288,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG072+2.p
% --creating new selector for []
% -running prover on /tmp/tmpTuE_nR/sel_RNG072+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG072+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG072+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG072+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
%
%------------------------------------------------------------------------------