TSTP Solution File: NUM613+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM613+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n083.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 8.23s
% Output : CNFRefutation 8.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 73 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 23 ~; 22 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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-2 aty)
% Number of variables : 15 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
equal(sbrdtbr0(xP),xk),
file('/export/starexec/sandbox2/tmp/tmpvpgQVj/sel_theBenchmark.p_1',m__) ).
fof(20,axiom,
( aElementOf0(xk,szNzAzT0)
& equal(szszuzczcdt0(xk),xK) ),
file('/export/starexec/sandbox2/tmp/tmpvpgQVj/sel_theBenchmark.p_1',m__3533) ).
fof(61,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( equal(szszuzczcdt0(X1),szszuzczcdt0(X2))
=> equal(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpvpgQVj/sel_theBenchmark.p_1',mSuccEquSucc) ).
fof(100,axiom,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/tmp/tmpvpgQVj/sel_theBenchmark.p_1',m__5078) ).
fof(102,axiom,
( equal(sbrdtbr0(xQ),szszuzczcdt0(xk))
& equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xQ))
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpvpgQVj/sel_theBenchmark.p_1',m__5255) ).
fof(111,negated_conjecture,
~ equal(sbrdtbr0(xP),xk),
inference(assume_negation,[status(cth)],[19]) ).
fof(113,negated_conjecture,
~ equal(sbrdtbr0(xP),xk),
inference(fof_simplification,[status(thm)],[111,theory(equality)]) ).
cnf(238,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[113]) ).
cnf(239,plain,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(240,plain,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[20]) ).
fof(473,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ equal(szszuzczcdt0(X1),szszuzczcdt0(X2))
| equal(X1,X2) ),
inference(fof_nnf,[status(thm)],[61]) ).
fof(474,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ equal(szszuzczcdt0(X3),szszuzczcdt0(X4))
| equal(X3,X4) ),
inference(variable_rename,[status(thm)],[473]) ).
cnf(475,plain,
( X1 = X2
| szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[474]) ).
fof(4649,plain,
( aSet0(xQ)
& ! [X1] :
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(fof_nnf,[status(thm)],[100]) ).
fof(4650,plain,
( aSet0(xQ)
& ! [X2] :
( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(variable_rename,[status(thm)],[4649]) ).
fof(4651,plain,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSet0(xQ)
& aSubsetOf0(xQ,xO)
& equal(sbrdtbr0(xQ),xK)
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(shift_quantors,[status(thm)],[4650]) ).
cnf(4653,plain,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[4651]) ).
cnf(4665,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(4666,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(5373,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[4666,4653,theory(equality)]) ).
cnf(5872,plain,
( xk = X1
| xK != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(xk,szNzAzT0) ),
inference(spm,[status(thm)],[475,239,theory(equality)]) ).
cnf(5876,plain,
( xk = X1
| xK != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| $false ),
inference(rw,[status(thm)],[5872,240,theory(equality)]) ).
cnf(5877,plain,
( xk = X1
| xK != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[5876,theory(equality)]) ).
cnf(98438,plain,
( xk = sbrdtbr0(xP)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(spm,[status(thm)],[5877,5373,theory(equality)]) ).
cnf(98460,plain,
( xk = sbrdtbr0(xP)
| $false ),
inference(rw,[status(thm)],[98438,4665,theory(equality)]) ).
cnf(98461,plain,
xk = sbrdtbr0(xP),
inference(cn,[status(thm)],[98460,theory(equality)]) ).
cnf(98462,plain,
$false,
inference(sr,[status(thm)],[98461,238,theory(equality)]) ).
cnf(98463,plain,
$false,
98462,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM613+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.22 % Computer : n083.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 10:42:14 CST 2018
% 0.02/0.22 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 8.23/8.52 -running prover on /export/starexec/sandbox2/tmp/tmpvpgQVj/sel_theBenchmark.p_1 with time limit 29
% 8.23/8.52 -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/tmpvpgQVj/sel_theBenchmark.p_1']
% 8.23/8.52 -prover status Theorem
% 8.23/8.52 Problem theBenchmark.p solved in phase 0.
% 8.23/8.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.23/8.52 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.23/8.52 Solved 1 out of 1.
% 8.23/8.52 # Problem is unsatisfiable (or provable), constructing proof object
% 8.23/8.52 # SZS status Theorem
% 8.23/8.52 # SZS output start CNFRefutation.
% See solution above
% 8.23/8.52 # SZS output end CNFRefutation
%------------------------------------------------------------------------------