TSTP Solution File: NUM617+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM617+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n124.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:00 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 18 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 128 ( 52 ~; 54 |; 19 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',mDefSub) ).
fof(11,axiom,
( aSet0(xO)
& equal(xO,sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))) ),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',m__4891) ).
fof(19,conjecture,
aElementOf0(xx,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',m__) ).
fof(22,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',m__3435) ).
fof(49,axiom,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',m__4998) ).
fof(91,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',mNATSet) ).
fof(92,axiom,
aElementOf0(xx,xP),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',m__5348) ).
fof(111,axiom,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1',m__5208) ).
fof(115,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(assume_negation,[status(cth)],[19]) ).
fof(117,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(fof_simplification,[status(thm)],[115,theory(equality)]) ).
fof(155,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ( ~ aSubsetOf0(X2,X1)
| ( aSet0(X2)
& ! [X3] :
( ~ aElementOf0(X3,X2)
| aElementOf0(X3,X1) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( aElementOf0(X3,X2)
& ~ aElementOf0(X3,X1) )
| aSubsetOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(156,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( aElementOf0(X7,X5)
& ~ aElementOf0(X7,X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[155]) ).
fof(157,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[156]) ).
fof(158,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[157]) ).
fof(159,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk2_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk2_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[158]) ).
cnf(162,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(163,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(181,plain,
aSet0(xO),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(213,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(split_conjunct,[status(thm)],[117]) ).
cnf(224,plain,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(335,plain,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(512,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(513,plain,
aElementOf0(xx,xP),
inference(split_conjunct,[status(thm)],[92]) ).
cnf(574,plain,
aSubsetOf0(xP,xO),
inference(split_conjunct,[status(thm)],[111]) ).
cnf(759,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[162,224,theory(equality)]) ).
cnf(769,plain,
( aSet0(xS)
| $false ),
inference(rw,[status(thm)],[759,512,theory(equality)]) ).
cnf(770,plain,
aSet0(xS),
inference(cn,[status(thm)],[769,theory(equality)]) ).
cnf(834,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aSet0(szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(spm,[status(thm)],[163,224,theory(equality)]) ).
cnf(835,plain,
( aElementOf0(X1,xS)
| ~ aSet0(xS)
| ~ aElementOf0(X1,xO) ),
inference(spm,[status(thm)],[163,335,theory(equality)]) ).
cnf(837,plain,
( aElementOf0(X1,xO)
| ~ aSet0(xO)
| ~ aElementOf0(X1,xP) ),
inference(spm,[status(thm)],[163,574,theory(equality)]) ).
cnf(845,plain,
( aElementOf0(X1,szNzAzT0)
| $false
| ~ aElementOf0(X1,xS) ),
inference(rw,[status(thm)],[834,512,theory(equality)]) ).
cnf(846,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[845,theory(equality)]) ).
cnf(849,plain,
( aElementOf0(X1,xO)
| $false
| ~ aElementOf0(X1,xP) ),
inference(rw,[status(thm)],[837,181,theory(equality)]) ).
cnf(850,plain,
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[849,theory(equality)]) ).
cnf(2393,plain,
aElementOf0(xx,xO),
inference(spm,[status(thm)],[850,513,theory(equality)]) ).
cnf(2644,plain,
( aElementOf0(X1,xS)
| $false
| ~ aElementOf0(X1,xO) ),
inference(rw,[status(thm)],[835,770,theory(equality)]) ).
cnf(2645,plain,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xO) ),
inference(cn,[status(thm)],[2644,theory(equality)]) ).
cnf(2655,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xO) ),
inference(spm,[status(thm)],[846,2645,theory(equality)]) ).
cnf(2672,plain,
aElementOf0(xx,szNzAzT0),
inference(spm,[status(thm)],[2655,2393,theory(equality)]) ).
cnf(2685,plain,
$false,
inference(sr,[status(thm)],[2672,213,theory(equality)]) ).
cnf(2686,plain,
$false,
2685,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM617+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n124.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 : Mon Jan 8 08:48:57 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.42 -running prover on /export/starexec/sandbox2/tmp/tmpTziBkO/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.42 -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/tmpTziBkO/sel_theBenchmark.p_1']
% 0.06/0.42 -prover status Theorem
% 0.06/0.42 Problem theBenchmark.p solved in phase 0.
% 0.06/0.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.42 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.42 Solved 1 out of 1.
% 0.06/0.42 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.42 # SZS status Theorem
% 0.06/0.42 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------