TSTP Solution File: NUM557+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM557+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n037.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:47 EST 2018
% Result : Theorem 0.40s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 165 ( 5 equ)
% Maximal formula atoms : 39 ( 6 avg)
% Number of connectives : 230 ( 91 ~; 100 |; 36 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 24 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
( aSet0(xS)
& aSet0(xT)
& ~ equal(xk,sz00) ),
file('/export/starexec/sandbox2/tmp/tmp68h4OU/sel_theBenchmark.p_1',m__2202_02) ).
fof(46,axiom,
( aSubsetOf0(xP,xS)
& equal(sbrdtbr0(xP),xk) ),
file('/export/starexec/sandbox2/tmp/tmp68h4OU/sel_theBenchmark.p_1',m__2431) ).
fof(48,conjecture,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/tmp/tmp68h4OU/sel_theBenchmark.p_1',m__) ).
fof(54,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/tmp68h4OU/sel_theBenchmark.p_1',mDefSel) ).
fof(60,axiom,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp68h4OU/sel_theBenchmark.p_1',m__2202) ).
fof(74,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(assume_negation,[status(cth)],[48]) ).
fof(81,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(fof_simplification,[status(thm)],[74,theory(equality)]) ).
cnf(124,plain,
aSet0(xS),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(277,plain,
sbrdtbr0(xP) = xk,
inference(split_conjunct,[status(thm)],[46]) ).
cnf(278,plain,
aSubsetOf0(xP,xS),
inference(split_conjunct,[status(thm)],[46]) ).
cnf(281,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[81]) ).
fof(297,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)],[54]) ).
fof(298,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)],[297]) ).
fof(299,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)],[298]) ).
fof(300,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)],[299]) ).
fof(301,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)],[300]) ).
cnf(306,plain,
( aElementOf0(X4,X3)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X2) ),
inference(split_conjunct,[status(thm)],[301]) ).
cnf(323,plain,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[60]) ).
cnf(710,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,X3))
| sbrdtbr0(X1) != X3
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[306,theory(equality)]) ).
cnf(9532,negated_conjecture,
( sbrdtbr0(xP) != xk
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSubsetOf0(xP,xS)
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[281,710,theory(equality)]) ).
cnf(9554,negated_conjecture,
( $false
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSubsetOf0(xP,xS)
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[9532,277,theory(equality)]) ).
cnf(9555,negated_conjecture,
( $false
| $false
| ~ aSubsetOf0(xP,xS)
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[9554,323,theory(equality)]) ).
cnf(9556,negated_conjecture,
( $false
| $false
| $false
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[9555,278,theory(equality)]) ).
cnf(9557,negated_conjecture,
( $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[9556,124,theory(equality)]) ).
cnf(9558,negated_conjecture,
$false,
inference(cn,[status(thm)],[9557,theory(equality)]) ).
cnf(9559,negated_conjecture,
$false,
9558,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM557+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.22 % Computer : n037.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 08:48:30 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.40/0.69 -running prover on /export/starexec/sandbox2/tmp/tmp68h4OU/sel_theBenchmark.p_1 with time limit 29
% 0.40/0.69 -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/tmp68h4OU/sel_theBenchmark.p_1']
% 0.40/0.69 -prover status Theorem
% 0.40/0.69 Problem theBenchmark.p solved in phase 0.
% 0.40/0.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.69 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.69 Solved 1 out of 1.
% 0.40/0.69 # Problem is unsatisfiable (or provable), constructing proof object
% 0.40/0.69 # SZS status Theorem
% 0.40/0.69 # SZS output start CNFRefutation.
% See solution above
% 0.50/0.70 # SZS output end CNFRefutation
%------------------------------------------------------------------------------