TSTP Solution File: NUM548+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM548+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n100.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:44 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 265 ( 8 equ)
% Maximal formula atoms : 39 ( 5 avg)
% Number of connectives : 358 ( 142 ~; 154 |; 54 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 67 ( 0 sgn 46 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',m__2270) ).
fof(10,axiom,
( aSet0(xS)
& aSet0(xT)
& ~ equal(xk,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',m__2202_02) ).
fof(17,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',mDefSub) ).
fof(43,conjecture,
isFinite0(xQ),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',m__) ).
fof(48,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( equal(X3,slbdtsldtrb0(X1,X2))
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& equal(sbrdtbr0(X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',mDefSel) ).
fof(53,axiom,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',m__2202) ).
fof(65,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1',mCardNum) ).
fof(67,negated_conjecture,
~ isFinite0(xQ),
inference(assume_negation,[status(cth)],[43]) ).
fof(72,negated_conjecture,
~ isFinite0(xQ),
inference(fof_simplification,[status(thm)],[67,theory(equality)]) ).
cnf(85,plain,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(114,plain,
aSet0(xS),
inference(split_conjunct,[status(thm)],[10]) ).
fof(141,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)],[17]) ).
fof(142,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)],[141]) ).
fof(143,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk4_2(X4,X5),X5)
& ~ aElementOf0(esk4_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk4_2(X4,X5),X5)
& ~ aElementOf0(esk4_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[143]) ).
fof(145,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk4_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk4_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[144]) ).
cnf(148,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(263,negated_conjecture,
~ isFinite0(xQ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(276,plain,
! [X1,X2] :
( ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| ! [X3] :
( ( ~ equal(X3,slbdtsldtrb0(X1,X2))
| ( aSet0(X3)
& ! [X4] :
( ( ~ aElementOf0(X4,X3)
| ( aSubsetOf0(X4,X1)
& equal(sbrdtbr0(X4),X2) ) )
& ( ~ aSubsetOf0(X4,X1)
| ~ equal(sbrdtbr0(X4),X2)
| aElementOf0(X4,X3) ) ) ) )
& ( ~ aSet0(X3)
| ? [X4] :
( ( ~ aElementOf0(X4,X3)
| ~ aSubsetOf0(X4,X1)
| ~ equal(sbrdtbr0(X4),X2) )
& ( aElementOf0(X4,X3)
| ( aSubsetOf0(X4,X1)
& equal(sbrdtbr0(X4),X2) ) ) )
| equal(X3,slbdtsldtrb0(X1,X2)) ) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(277,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0)
| ! [X7] :
( ( ~ equal(X7,slbdtsldtrb0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aSubsetOf0(X8,X5)
& equal(sbrdtbr0(X8),X6) ) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ? [X9] :
( ( ~ aElementOf0(X9,X7)
| ~ aSubsetOf0(X9,X5)
| ~ equal(sbrdtbr0(X9),X6) )
& ( aElementOf0(X9,X7)
| ( aSubsetOf0(X9,X5)
& equal(sbrdtbr0(X9),X6) ) ) )
| equal(X7,slbdtsldtrb0(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[276]) ).
fof(278,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0)
| ! [X7] :
( ( ~ equal(X7,slbdtsldtrb0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aSubsetOf0(X8,X5)
& equal(sbrdtbr0(X8),X6) ) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk10_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk10_3(X5,X6,X7),X5)
| ~ equal(sbrdtbr0(esk10_3(X5,X6,X7)),X6) )
& ( aElementOf0(esk10_3(X5,X6,X7),X7)
| ( aSubsetOf0(esk10_3(X5,X6,X7),X5)
& equal(sbrdtbr0(esk10_3(X5,X6,X7)),X6) ) ) )
| equal(X7,slbdtsldtrb0(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[277]) ).
fof(279,plain,
! [X5,X6,X7,X8] :
( ( ( ( ( ~ aElementOf0(X8,X7)
| ( aSubsetOf0(X8,X5)
& equal(sbrdtbr0(X8),X6) ) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7) )
& aSet0(X7) )
| ~ equal(X7,slbdtsldtrb0(X5,X6)) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk10_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk10_3(X5,X6,X7),X5)
| ~ equal(sbrdtbr0(esk10_3(X5,X6,X7)),X6) )
& ( aElementOf0(esk10_3(X5,X6,X7),X7)
| ( aSubsetOf0(esk10_3(X5,X6,X7),X5)
& equal(sbrdtbr0(esk10_3(X5,X6,X7)),X6) ) ) )
| equal(X7,slbdtsldtrb0(X5,X6)) ) )
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) ),
inference(shift_quantors,[status(thm)],[278]) ).
fof(280,plain,
! [X5,X6,X7,X8] :
( ( aSubsetOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( equal(sbrdtbr0(X8),X6)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( ~ aSubsetOf0(X8,X5)
| ~ equal(sbrdtbr0(X8),X6)
| aElementOf0(X8,X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSet0(X7)
| ~ equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( ~ aElementOf0(esk10_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk10_3(X5,X6,X7),X5)
| ~ equal(sbrdtbr0(esk10_3(X5,X6,X7)),X6)
| ~ aSet0(X7)
| equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSubsetOf0(esk10_3(X5,X6,X7),X5)
| aElementOf0(esk10_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( equal(sbrdtbr0(esk10_3(X5,X6,X7)),X6)
| aElementOf0(esk10_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,slbdtsldtrb0(X5,X6))
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) ) ),
inference(distribute,[status(thm)],[279]) ).
cnf(286,plain,
( sbrdtbr0(X4) = X1
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[280]) ).
cnf(287,plain,
( aSubsetOf0(X4,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[280]) ).
cnf(301,plain,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[53]) ).
fof(347,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) )
& ( ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ) ) ),
inference(fof_nnf,[status(thm)],[65]) ).
fof(348,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0) ) ) ),
inference(variable_rename,[status(thm)],[347]) ).
fof(349,plain,
! [X2] :
( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2)
| ~ aSet0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[348]) ).
cnf(351,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[349]) ).
cnf(514,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aSet0(X3) ),
inference(er,[status(thm)],[286,theory(equality)]) ).
cnf(538,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aSet0(X2) ),
inference(er,[status(thm)],[287,theory(equality)]) ).
cnf(1878,plain,
( sbrdtbr0(xQ) = xk
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[514,85,theory(equality)]) ).
cnf(1887,plain,
( sbrdtbr0(xQ) = xk
| $false
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[1878,301,theory(equality)]) ).
cnf(1888,plain,
( sbrdtbr0(xQ) = xk
| $false
| $false ),
inference(rw,[status(thm)],[1887,114,theory(equality)]) ).
cnf(1889,plain,
sbrdtbr0(xQ) = xk,
inference(cn,[status(thm)],[1888,theory(equality)]) ).
cnf(1896,plain,
( isFinite0(xQ)
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[351,1889,theory(equality)]) ).
cnf(1908,plain,
( isFinite0(xQ)
| $false
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[1896,301,theory(equality)]) ).
cnf(1909,plain,
( isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(cn,[status(thm)],[1908,theory(equality)]) ).
cnf(1910,plain,
~ aSet0(xQ),
inference(sr,[status(thm)],[1909,263,theory(equality)]) ).
cnf(2641,plain,
( aSubsetOf0(xQ,xS)
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[538,85,theory(equality)]) ).
cnf(2650,plain,
( aSubsetOf0(xQ,xS)
| $false
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[2641,301,theory(equality)]) ).
cnf(2651,plain,
( aSubsetOf0(xQ,xS)
| $false
| $false ),
inference(rw,[status(thm)],[2650,114,theory(equality)]) ).
cnf(2652,plain,
aSubsetOf0(xQ,xS),
inference(cn,[status(thm)],[2651,theory(equality)]) ).
cnf(2657,plain,
( aSet0(xQ)
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[148,2652,theory(equality)]) ).
cnf(2669,plain,
( aSet0(xQ)
| $false ),
inference(rw,[status(thm)],[2657,114,theory(equality)]) ).
cnf(2670,plain,
aSet0(xQ),
inference(cn,[status(thm)],[2669,theory(equality)]) ).
cnf(2671,plain,
$false,
inference(sr,[status(thm)],[2670,1910,theory(equality)]) ).
cnf(2672,plain,
$false,
2671,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM548+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 : n100.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 09:57:00 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.07/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpt1fvzv/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.41 -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/tmpt1fvzv/sel_theBenchmark.p_1']
% 0.07/0.41 -prover status Theorem
% 0.07/0.41 Problem theBenchmark.p solved in phase 0.
% 0.07/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.41 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.41 Solved 1 out of 1.
% 0.07/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.41 # SZS status Theorem
% 0.07/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------