TSTP Solution File: NUM606+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM606+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n135.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:58 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 158 ( 66 ~; 65 |; 22 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 27 !; 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/tmpj11OAj/sel_theBenchmark.p_1',mDefSub) ).
fof(14,axiom,
( aSubsetOf0(xQ,xO)
& ~ equal(xQ,slcrc0) ),
file('/export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1',m__5093) ).
fof(19,conjecture,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1',m__) ).
fof(22,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1',m__3435) ).
fof(47,axiom,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1',m__4998) ).
fof(82,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1',mNATSet) ).
fof(96,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1',mSubTrans) ).
fof(102,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(assume_negation,[status(cth)],[19]) ).
fof(104,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(fof_simplification,[status(thm)],[102,theory(equality)]) ).
fof(142,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(143,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)],[142]) ).
fof(144,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)],[143]) ).
fof(145,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)],[144]) ).
fof(146,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)],[145]) ).
cnf(149,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[146]) ).
cnf(185,plain,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(200,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(211,plain,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(320,plain,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(488,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[82]) ).
fof(537,plain,
! [X1,X2,X3] :
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| aSubsetOf0(X1,X3) ),
inference(fof_nnf,[status(thm)],[96]) ).
fof(538,plain,
! [X4,X5,X6] :
( ~ aSet0(X4)
| ~ aSet0(X5)
| ~ aSet0(X6)
| ~ aSubsetOf0(X4,X5)
| ~ aSubsetOf0(X5,X6)
| aSubsetOf0(X4,X6) ),
inference(variable_rename,[status(thm)],[537]) ).
cnf(539,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[538]) ).
cnf(860,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[539,149]) ).
cnf(861,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[860,149]) ).
cnf(863,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[861,211,theory(equality)]) ).
cnf(873,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS)
| $false ),
inference(rw,[status(thm)],[863,488,theory(equality)]) ).
cnf(874,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[873,theory(equality)]) ).
cnf(1823,plain,
aSubsetOf0(xO,szNzAzT0),
inference(spm,[status(thm)],[874,320,theory(equality)]) ).
cnf(1838,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xO)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[861,1823,theory(equality)]) ).
cnf(1848,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xO)
| $false ),
inference(rw,[status(thm)],[1838,488,theory(equality)]) ).
cnf(1849,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xO) ),
inference(cn,[status(thm)],[1848,theory(equality)]) ).
cnf(1860,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(spm,[status(thm)],[1849,185,theory(equality)]) ).
cnf(1864,plain,
$false,
inference(sr,[status(thm)],[1860,200,theory(equality)]) ).
cnf(1865,plain,
$false,
1864,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM606+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.05 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n135.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 11:18:44 CST 2018
% 0.03/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.07/0.40 -running prover on /export/starexec/sandbox2/tmp/tmpj11OAj/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.40 -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/tmpj11OAj/sel_theBenchmark.p_1']
% 0.07/0.40 -prover status Theorem
% 0.07/0.40 Problem theBenchmark.p solved in phase 0.
% 0.07/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.40 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.40 Solved 1 out of 1.
% 0.07/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.40 # SZS status Theorem
% 0.07/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------