TSTP Solution File: NUM549+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM549+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n072.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:45 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 11 unt; 0 def)
% Number of atoms : 146 ( 17 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 156 ( 59 ~; 57 |; 34 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 29 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1',mEOfElem) ).
fof(5,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1',m__2270) ).
fof(10,axiom,
( aSet0(xS)
& aSet0(xT)
& ~ equal(xk,sz00) ),
file('/export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1',m__2202_02) ).
fof(32,axiom,
! [X1] :
( equal(X1,slcrc0)
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1',mDefEmp) ).
fof(43,conjecture,
? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1',m__) ).
fof(50,axiom,
! [X1] :
( aSet0(X1)
=> ( equal(sbrdtbr0(X1),sz00)
<=> equal(X1,slcrc0) ) ),
file('/export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1',mCardEmpty) ).
fof(68,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
inference(assume_negation,[status(cth)],[43]) ).
fof(81,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| aElement0(X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(82,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4) ) ),
inference(variable_rename,[status(thm)],[81]) ).
fof(83,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[82]) ).
cnf(84,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[83]) ).
fof(85,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(86,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSet0(xQ)
& aSubsetOf0(xQ,xS)
& equal(sbrdtbr0(xQ),xk)
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(shift_quantors,[status(thm)],[86]) ).
cnf(89,plain,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[87]) ).
cnf(91,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[87]) ).
cnf(92,plain,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[87]) ).
cnf(119,plain,
xk != sz00,
inference(split_conjunct,[status(thm)],[10]) ).
cnf(121,plain,
aSet0(xS),
inference(split_conjunct,[status(thm)],[10]) ).
fof(213,plain,
! [X1] :
( ( ~ equal(X1,slcrc0)
| ( aSet0(X1)
& ! [X2] : ~ aElementOf0(X2,X1) ) )
& ( ~ aSet0(X1)
| ? [X2] : aElementOf0(X2,X1)
| equal(X1,slcrc0) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(214,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| ? [X5] : aElementOf0(X5,X3)
| equal(X3,slcrc0) ) ),
inference(variable_rename,[status(thm)],[213]) ).
fof(215,plain,
! [X3] :
( ( ~ equal(X3,slcrc0)
| ( aSet0(X3)
& ! [X4] : ~ aElementOf0(X4,X3) ) )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(skolemize,[status(esa)],[214]) ).
fof(216,plain,
! [X3,X4] :
( ( ( ~ aElementOf0(X4,X3)
& aSet0(X3) )
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(shift_quantors,[status(thm)],[215]) ).
fof(217,plain,
! [X3,X4] :
( ( ~ aElementOf0(X4,X3)
| ~ equal(X3,slcrc0) )
& ( aSet0(X3)
| ~ equal(X3,slcrc0) )
& ( ~ aSet0(X3)
| aElementOf0(esk6_1(X3),X3)
| equal(X3,slcrc0) ) ),
inference(distribute,[status(thm)],[216]) ).
cnf(218,plain,
( X1 = slcrc0
| aElementOf0(esk6_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[217]) ).
cnf(219,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[217]) ).
fof(270,negated_conjecture,
! [X1] :
( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(271,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aElementOf0(X2,xQ) ),
inference(variable_rename,[status(thm)],[270]) ).
cnf(272,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[271]) ).
fof(300,plain,
! [X1] :
( ~ aSet0(X1)
| ( ( ~ equal(sbrdtbr0(X1),sz00)
| equal(X1,slcrc0) )
& ( ~ equal(X1,slcrc0)
| equal(sbrdtbr0(X1),sz00) ) ) ),
inference(fof_nnf,[status(thm)],[50]) ).
fof(301,plain,
! [X2] :
( ~ aSet0(X2)
| ( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00) ) ) ),
inference(variable_rename,[status(thm)],[300]) ).
fof(302,plain,
! [X2] :
( ( ~ equal(sbrdtbr0(X2),sz00)
| equal(X2,slcrc0)
| ~ aSet0(X2) )
& ( ~ equal(X2,slcrc0)
| equal(sbrdtbr0(X2),sz00)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[301]) ).
cnf(303,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[302]) ).
cnf(403,plain,
( sbrdtbr0(X1) = sz00
| slcrc0 != X1 ),
inference(csr,[status(thm)],[303,219]) ).
cnf(404,plain,
( sz00 = xk
| slcrc0 != xQ ),
inference(spm,[status(thm)],[89,403,theory(equality)]) ).
cnf(405,plain,
xQ != slcrc0,
inference(sr,[status(thm)],[404,119,theory(equality)]) ).
cnf(472,plain,
( aElementOf0(esk6_1(xQ),xS)
| slcrc0 = xQ
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[92,218,theory(equality)]) ).
cnf(479,plain,
( aElementOf0(esk6_1(xQ),xS)
| slcrc0 = xQ
| $false ),
inference(rw,[status(thm)],[472,91,theory(equality)]) ).
cnf(480,plain,
( aElementOf0(esk6_1(xQ),xS)
| slcrc0 = xQ ),
inference(cn,[status(thm)],[479,theory(equality)]) ).
cnf(1233,plain,
aElementOf0(esk6_1(xQ),xS),
inference(sr,[status(thm)],[480,405,theory(equality)]) ).
cnf(1235,plain,
( aElement0(esk6_1(xQ))
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[84,1233,theory(equality)]) ).
cnf(1240,plain,
( aElement0(esk6_1(xQ))
| $false ),
inference(rw,[status(thm)],[1235,121,theory(equality)]) ).
cnf(1241,plain,
aElement0(esk6_1(xQ)),
inference(cn,[status(thm)],[1240,theory(equality)]) ).
cnf(1242,plain,
~ aElementOf0(esk6_1(xQ),xQ),
inference(spm,[status(thm)],[272,1241,theory(equality)]) ).
cnf(1245,plain,
( slcrc0 = xQ
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[1242,218,theory(equality)]) ).
cnf(1246,plain,
( slcrc0 = xQ
| $false ),
inference(rw,[status(thm)],[1245,91,theory(equality)]) ).
cnf(1247,plain,
slcrc0 = xQ,
inference(cn,[status(thm)],[1246,theory(equality)]) ).
cnf(1248,plain,
$false,
inference(sr,[status(thm)],[1247,405,theory(equality)]) ).
cnf(1249,plain,
$false,
1248,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM549+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.22 % Computer : n072.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Jan 5 09:56:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.38 -running prover on /export/starexec/sandbox/tmp/tmpRtqam3/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.38 -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/tmpRtqam3/sel_theBenchmark.p_1']
% 0.06/0.38 -prover status Theorem
% 0.06/0.38 Problem theBenchmark.p solved in phase 0.
% 0.06/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38 Solved 1 out of 1.
% 0.06/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.38 # SZS status Theorem
% 0.06/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------