TSTP Solution File: COM016+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM016+4 : 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 : Sat Dec 25 05:47:50 EST 2010
% Result : Theorem 0.38s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 138 ( 7 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 168 ( 58 ~; 56 |; 54 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& ( X1 = xb
| aReductOfIn0(xb,X1,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,X1,xR)
& sdtmndtplgtdt0(X2,xR,xb) )
| sdtmndtplgtdt0(X1,xR,xb)
| sdtmndtasgtdt0(X1,xR,xb) ) ),
file('/tmp/tmpfGEujh/sel_COM016+4.p_1',m__) ).
fof(2,axiom,
( ( aReductOfIn0(xb,xa,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtplgtdt0(X1,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtplgtdt0(X1,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/tmp/tmpfGEujh/sel_COM016+4.p_1',m__731_02) ).
fof(8,axiom,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/tmp/tmpfGEujh/sel_COM016+4.p_1',m__731) ).
fof(21,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& ( X1 = xb
| aReductOfIn0(xb,X1,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,X1,xR)
& sdtmndtplgtdt0(X2,xR,xb) )
| sdtmndtplgtdt0(X1,xR,xb)
| sdtmndtasgtdt0(X1,xR,xb) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(22,negated_conjecture,
! [X1] :
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,xa,xR)
| ( X1 != xb
& ~ aReductOfIn0(xb,X1,xR)
& ! [X2] :
( ~ aElement0(X2)
| ~ aReductOfIn0(X2,X1,xR)
| ~ sdtmndtplgtdt0(X2,xR,xb) )
& ~ sdtmndtplgtdt0(X1,xR,xb)
& ~ sdtmndtasgtdt0(X1,xR,xb) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(23,negated_conjecture,
! [X3] :
( ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR)
| ( X3 != xb
& ~ aReductOfIn0(xb,X3,xR)
& ! [X4] :
( ~ aElement0(X4)
| ~ aReductOfIn0(X4,X3,xR)
| ~ sdtmndtplgtdt0(X4,xR,xb) )
& ~ sdtmndtplgtdt0(X3,xR,xb)
& ~ sdtmndtasgtdt0(X3,xR,xb) ) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
! [X3,X4] :
( ( ( ~ aElement0(X4)
| ~ aReductOfIn0(X4,X3,xR)
| ~ sdtmndtplgtdt0(X4,xR,xb) )
& X3 != xb
& ~ aReductOfIn0(xb,X3,xR)
& ~ sdtmndtplgtdt0(X3,xR,xb)
& ~ sdtmndtasgtdt0(X3,xR,xb) )
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR) ),
inference(shift_quantors,[status(thm)],[23]) ).
fof(25,negated_conjecture,
! [X3,X4] :
( ( ~ aElement0(X4)
| ~ aReductOfIn0(X4,X3,xR)
| ~ sdtmndtplgtdt0(X4,xR,xb)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR) )
& ( X3 != xb
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR) )
& ( ~ aReductOfIn0(xb,X3,xR)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR) )
& ( ~ sdtmndtplgtdt0(X3,xR,xb)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR) )
& ( ~ sdtmndtasgtdt0(X3,xR,xb)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,xa,xR) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(27,negated_conjecture,
( ~ aReductOfIn0(X1,xa,xR)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,xR,xb) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(29,negated_conjecture,
( ~ aReductOfIn0(X1,xa,xR)
| ~ aElement0(X1)
| X1 != xb ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(31,plain,
( ( aReductOfIn0(xb,xa,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xa,xR)
& sdtmndtplgtdt0(X2,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,xa,xR)
& sdtmndtplgtdt0(X3,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
inference(variable_rename,[status(thm)],[2]) ).
fof(32,plain,
( ( aReductOfIn0(xb,xa,xR)
| ( aElement0(esk1_0)
& aReductOfIn0(esk1_0,xa,xR)
& sdtmndtplgtdt0(esk1_0,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ( aElement0(esk2_0)
& aReductOfIn0(esk2_0,xa,xR)
& sdtmndtplgtdt0(esk2_0,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,plain,
( ( aElement0(esk1_0)
| aReductOfIn0(xb,xa,xR) )
& ( aReductOfIn0(esk1_0,xa,xR)
| aReductOfIn0(xb,xa,xR) )
& ( sdtmndtplgtdt0(esk1_0,xR,xb)
| aReductOfIn0(xb,xa,xR) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aElement0(esk2_0)
| aReductOfIn0(xc,xa,xR) )
& ( aReductOfIn0(esk2_0,xa,xR)
| aReductOfIn0(xc,xa,xR) )
& ( sdtmndtplgtdt0(esk2_0,xR,xc)
| aReductOfIn0(xc,xa,xR) )
& sdtmndtplgtdt0(xa,xR,xc) ),
inference(distribute,[status(thm)],[32]) ).
cnf(39,plain,
( aReductOfIn0(xb,xa,xR)
| sdtmndtplgtdt0(esk1_0,xR,xb) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(40,plain,
( aReductOfIn0(xb,xa,xR)
| aReductOfIn0(esk1_0,xa,xR) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(41,plain,
( aReductOfIn0(xb,xa,xR)
| aElement0(esk1_0) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(359,plain,
aElement0(xb),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(437,negated_conjecture,
( ~ aReductOfIn0(xb,xa,xR)
| ~ aElement0(xb) ),
inference(er,[status(thm)],[29,theory(equality)]) ).
cnf(438,negated_conjecture,
( ~ aReductOfIn0(xb,xa,xR)
| $false ),
inference(rw,[status(thm)],[437,359,theory(equality)]) ).
cnf(439,negated_conjecture,
~ aReductOfIn0(xb,xa,xR),
inference(cn,[status(thm)],[438,theory(equality)]) ).
cnf(1725,plain,
aElement0(esk1_0),
inference(sr,[status(thm)],[41,439,theory(equality)]) ).
cnf(1726,plain,
aReductOfIn0(esk1_0,xa,xR),
inference(sr,[status(thm)],[40,439,theory(equality)]) ).
cnf(1727,plain,
sdtmndtplgtdt0(esk1_0,xR,xb),
inference(sr,[status(thm)],[39,439,theory(equality)]) ).
cnf(1881,plain,
( ~ aReductOfIn0(esk1_0,xa,xR)
| ~ aElement0(esk1_0) ),
inference(spm,[status(thm)],[27,1727,theory(equality)]) ).
cnf(1891,plain,
( $false
| ~ aElement0(esk1_0) ),
inference(rw,[status(thm)],[1881,1726,theory(equality)]) ).
cnf(1892,plain,
( $false
| $false ),
inference(rw,[status(thm)],[1891,1725,theory(equality)]) ).
cnf(1893,plain,
$false,
inference(cn,[status(thm)],[1892,theory(equality)]) ).
cnf(1894,plain,
$false,
1893,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM016+4.p
% --creating new selector for []
% -running prover on /tmp/tmpfGEujh/sel_COM016+4.p_1 with time limit 29
% -prover status Theorem
% Problem COM016+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM016+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM016+4.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
%
%------------------------------------------------------------------------------