TSTP Solution File: NUM565+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM565+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n087.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:21:49 EST 2018
% Result : Theorem 2.09s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 93 ( 11 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 100 ( 31 ~; 20 |; 41 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(27,axiom,
equal(xK,sz00),
file('/export/starexec/sandbox2/tmp/tmpMgpMyh/sel_theBenchmark.p_1',m__3462) ).
fof(61,axiom,
! [X1] :
( aSet0(X1)
=> ( equal(sbrdtbr0(X1),sz00)
<=> equal(X1,slcrc0) ) ),
file('/export/starexec/sandbox2/tmp/tmpMgpMyh/sel_theBenchmark.p_1',mCardEmpty) ).
fof(76,conjecture,
! [X1] :
( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& equal(sbrdtbr0(X1),sz00)
& aElementOf0(X1,slbdtsldtrb0(xS,sz00)) )
=> ( ( aSet0(slcrc0)
& ~ ? [X2] : aElementOf0(X2,slcrc0) )
=> equal(sdtlpdtrp0(xc,X1),sdtlpdtrp0(xc,slcrc0)) ) ),
file('/export/starexec/sandbox2/tmp/tmpMgpMyh/sel_theBenchmark.p_1',m__) ).
fof(81,negated_conjecture,
~ ! [X1] :
( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& equal(sbrdtbr0(X1),sz00)
& aElementOf0(X1,slbdtsldtrb0(xS,sz00)) )
=> ( ( aSet0(slcrc0)
& ~ ? [X2] : aElementOf0(X2,slcrc0) )
=> equal(sdtlpdtrp0(xc,X1),sdtlpdtrp0(xc,slcrc0)) ) ),
inference(assume_negation,[status(cth)],[76]) ).
cnf(227,plain,
xK = sz00,
inference(split_conjunct,[status(thm)],[27]) ).
fof(4357,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ equal(sbrdtbr0(X1),sz00)
| equal(X1,slcrc0) )
& ( ~ equal(X1,slcrc0)
| equal(sbrdtbr0(X1),sz00) ) ) ),
inference(fof_nnf,[status(thm)],[61]) ).
fof(4358,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00) ) ) ),
inference(variable_rename,[status(thm)],[4357]) ).
fof(4359,plain,
! [X2] :
( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0)
| ~ aSet0(X2) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[4358]) ).
cnf(4361,plain,
( X1 = slcrc0
| ~ aSet0(X1)
| sbrdtbr0(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[4359]) ).
fof(4426,negated_conjecture,
? [X1] :
( aSet0(X1)
& ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& equal(sbrdtbr0(X1),sz00)
& aElementOf0(X1,slbdtsldtrb0(xS,sz00))
& aSet0(slcrc0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& ~ equal(sdtlpdtrp0(xc,X1),sdtlpdtrp0(xc,slcrc0)) ),
inference(fof_nnf,[status(thm)],[81]) ).
fof(4427,negated_conjecture,
? [X3] :
( aSet0(X3)
& ! [X4] :
( ~ aElementOf0(X4,X3)
| aElementOf0(X4,xS) )
& aSubsetOf0(X3,xS)
& equal(sbrdtbr0(X3),sz00)
& aElementOf0(X3,slbdtsldtrb0(xS,sz00))
& aSet0(slcrc0)
& ! [X5] : ~ aElementOf0(X5,slcrc0)
& ~ equal(sdtlpdtrp0(xc,X3),sdtlpdtrp0(xc,slcrc0)) ),
inference(variable_rename,[status(thm)],[4426]) ).
fof(4428,negated_conjecture,
( aSet0(esk29_0)
& ! [X4] :
( ~ aElementOf0(X4,esk29_0)
| aElementOf0(X4,xS) )
& aSubsetOf0(esk29_0,xS)
& equal(sbrdtbr0(esk29_0),sz00)
& aElementOf0(esk29_0,slbdtsldtrb0(xS,sz00))
& aSet0(slcrc0)
& ! [X5] : ~ aElementOf0(X5,slcrc0)
& ~ equal(sdtlpdtrp0(xc,esk29_0),sdtlpdtrp0(xc,slcrc0)) ),
inference(skolemize,[status(esa)],[4427]) ).
fof(4429,negated_conjecture,
! [X4,X5] :
( ~ aElementOf0(X5,slcrc0)
& aSet0(slcrc0)
& ~ equal(sdtlpdtrp0(xc,esk29_0),sdtlpdtrp0(xc,slcrc0))
& ( ~ aElementOf0(X4,esk29_0)
| aElementOf0(X4,xS) )
& aSet0(esk29_0)
& aSubsetOf0(esk29_0,xS)
& equal(sbrdtbr0(esk29_0),sz00)
& aElementOf0(esk29_0,slbdtsldtrb0(xS,sz00)) ),
inference(shift_quantors,[status(thm)],[4428]) ).
cnf(4431,negated_conjecture,
sbrdtbr0(esk29_0) = sz00,
inference(split_conjunct,[status(thm)],[4429]) ).
cnf(4433,negated_conjecture,
aSet0(esk29_0),
inference(split_conjunct,[status(thm)],[4429]) ).
cnf(4435,negated_conjecture,
sdtlpdtrp0(xc,esk29_0) != sdtlpdtrp0(xc,slcrc0),
inference(split_conjunct,[status(thm)],[4429]) ).
cnf(4461,negated_conjecture,
sbrdtbr0(esk29_0) = xK,
inference(rw,[status(thm)],[4431,227,theory(equality)]) ).
cnf(4489,plain,
( slcrc0 = X1
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[4361,227,theory(equality)]) ).
cnf(4490,negated_conjecture,
( slcrc0 = esk29_0
| ~ aSet0(esk29_0) ),
inference(spm,[status(thm)],[4489,4461,theory(equality)]) ).
cnf(4491,negated_conjecture,
( slcrc0 = esk29_0
| $false ),
inference(rw,[status(thm)],[4490,4433,theory(equality)]) ).
cnf(4492,negated_conjecture,
slcrc0 = esk29_0,
inference(cn,[status(thm)],[4491,theory(equality)]) ).
cnf(12786,negated_conjecture,
$false,
inference(rw,[status(thm)],[4435,4492,theory(equality)]) ).
cnf(12787,negated_conjecture,
$false,
inference(cn,[status(thm)],[12786,theory(equality)]) ).
cnf(12788,negated_conjecture,
$false,
12787,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM565+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n087.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 09:04:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 2.09/2.39 -running prover on /export/starexec/sandbox2/tmp/tmpMgpMyh/sel_theBenchmark.p_1 with time limit 29
% 2.09/2.39 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpMgpMyh/sel_theBenchmark.p_1']
% 2.09/2.39 -prover status Theorem
% 2.09/2.39 Problem theBenchmark.p solved in phase 0.
% 2.09/2.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.09/2.39 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.09/2.39 Solved 1 out of 1.
% 2.09/2.39 # Problem is unsatisfiable (or provable), constructing proof object
% 2.09/2.39 # SZS status Theorem
% 2.09/2.39 # SZS output start CNFRefutation.
% See solution above
% 2.09/2.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------