TSTP Solution File: NUM630+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM630+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n122.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:22:03 EST 2018
% Result : Theorem 1.42s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 80 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 84 ( 30 ~; 28 |; 24 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
( aFunction0(xC)
& equal(szDzozmdt0(xC),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aFunction0(sdtlpdtrp0(xC,X1))
& equal(szDzozmdt0(sdtlpdtrp0(xC,X1)),slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
& ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) )
=> equal(sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2),sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1))))) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1',m__4151) ).
fof(19,conjecture,
equal(sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))),sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP)),
file('/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1',m__) ).
fof(85,axiom,
( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& equal(sdtlpdtrp0(xe,xn),xp) ),
file('/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1',m__5309) ).
fof(93,axiom,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1',m__5599) ).
fof(98,axiom,
equal(xD,sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn)))),
file('/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1',m__5585) ).
fof(102,axiom,
( aSet0(xP)
& equal(xP,sdtmndt0(xQ,szmzizndt0(xQ))) ),
file('/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1',m__5164) ).
fof(117,negated_conjecture,
~ equal(sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))),sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP)),
inference(assume_negation,[status(cth)],[19]) ).
fof(119,negated_conjecture,
~ equal(sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))),sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP)),
inference(fof_simplification,[status(thm)],[117,theory(equality)]) ).
fof(130,plain,
( aFunction0(xC)
& equal(szDzozmdt0(xC),szNzAzT0)
& ! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aFunction0(sdtlpdtrp0(xC,X1))
& equal(szDzozmdt0(sdtlpdtrp0(xC,X1)),slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
& ! [X2] :
( ~ aSet0(X2)
| ~ aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
| equal(sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2),sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1))))) ) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(131,plain,
( aFunction0(xC)
& equal(szDzozmdt0(xC),szNzAzT0)
& ! [X3] :
( ~ aElementOf0(X3,szNzAzT0)
| ( aFunction0(sdtlpdtrp0(xC,X3))
& equal(szDzozmdt0(sdtlpdtrp0(xC,X3)),slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))
& ! [X4] :
( ~ aSet0(X4)
| ~ aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))
| equal(sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4),sdtlpdtrp0(xc,sdtpldt0(X4,szmzizndt0(sdtlpdtrp0(xN,X3))))) ) ) ) ),
inference(variable_rename,[status(thm)],[130]) ).
fof(132,plain,
! [X3,X4] :
( ( ( ( ~ aSet0(X4)
| ~ aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))
| equal(sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4),sdtlpdtrp0(xc,sdtpldt0(X4,szmzizndt0(sdtlpdtrp0(xN,X3))))) )
& aFunction0(sdtlpdtrp0(xC,X3))
& equal(szDzozmdt0(sdtlpdtrp0(xC,X3)),slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk)) )
| ~ aElementOf0(X3,szNzAzT0) )
& aFunction0(xC)
& equal(szDzozmdt0(xC),szNzAzT0) ),
inference(shift_quantors,[status(thm)],[131]) ).
fof(133,plain,
! [X3,X4] :
( ( ~ aSet0(X4)
| ~ aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))
| equal(sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4),sdtlpdtrp0(xc,sdtpldt0(X4,szmzizndt0(sdtlpdtrp0(xN,X3)))))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aFunction0(sdtlpdtrp0(xC,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( equal(szDzozmdt0(sdtlpdtrp0(xC,X3)),slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))
| ~ aElementOf0(X3,szNzAzT0) )
& aFunction0(xC)
& equal(szDzozmdt0(xC),szNzAzT0) ),
inference(distribute,[status(thm)],[132]) ).
cnf(138,plain,
( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1))))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[133]) ).
cnf(215,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(split_conjunct,[status(thm)],[119]) ).
cnf(493,plain,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[85]) ).
cnf(516,plain,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(split_conjunct,[status(thm)],[93]) ).
cnf(527,plain,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
inference(split_conjunct,[status(thm)],[98]) ).
cnf(539,plain,
aSet0(xP),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(1776,plain,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xD,xk))
| ~ aElementOf0(xn,szNzAzT0) ),
inference(spm,[status(thm)],[138,527,theory(equality)]) ).
cnf(1788,plain,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xD,xk))
| $false ),
inference(rw,[status(thm)],[1776,493,theory(equality)]) ).
cnf(1789,plain,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xD,xk)) ),
inference(cn,[status(thm)],[1788,theory(equality)]) ).
cnf(34125,plain,
( ~ aSet0(xP)
| ~ aElementOf0(xP,slbdtsldtrb0(xD,xk)) ),
inference(spm,[status(thm)],[215,1789,theory(equality)]) ).
cnf(34132,plain,
( $false
| ~ aElementOf0(xP,slbdtsldtrb0(xD,xk)) ),
inference(rw,[status(thm)],[34125,539,theory(equality)]) ).
cnf(34133,plain,
( $false
| $false ),
inference(rw,[status(thm)],[34132,516,theory(equality)]) ).
cnf(34134,plain,
$false,
inference(cn,[status(thm)],[34133,theory(equality)]) ).
cnf(34135,plain,
$false,
34134,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM630+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n122.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 11:06:14 CST 2018
% 0.03/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 1.42/1.84 -running prover on /export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1 with time limit 29
% 1.42/1.84 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpc50pzM/sel_theBenchmark.p_1']
% 1.42/1.84 -prover status Theorem
% 1.42/1.84 Problem theBenchmark.p solved in phase 0.
% 1.42/1.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.42/1.84 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.42/1.84 Solved 1 out of 1.
% 1.42/1.84 # Problem is unsatisfiable (or provable), constructing proof object
% 1.42/1.84 # SZS status Theorem
% 1.42/1.84 # SZS output start CNFRefutation.
% See solution above
% 1.42/1.85 # SZS output end CNFRefutation
%------------------------------------------------------------------------------