TSTP Solution File: NUM613+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM613+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n033.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 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 45 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 17 ~; 15 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
equal(sbrdtbr0(xP),xk),
file('/export/starexec/sandbox2/tmp/tmp3YG5AB/sel_theBenchmark.p_1',m__) ).
fof(20,axiom,
( aElementOf0(xk,szNzAzT0)
& equal(szszuzczcdt0(xk),xK) ),
file('/export/starexec/sandbox2/tmp/tmp3YG5AB/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/tmp3YG5AB/sel_theBenchmark.p_1',mSuccEquSucc) ).
fof(102,axiom,
( equal(sbrdtbr0(xQ),szszuzczcdt0(xk))
& equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xQ))
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp3YG5AB/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(209,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[113]) ).
cnf(210,plain,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(211,plain,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[20]) ).
fof(402,plain,
! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ equal(szszuzczcdt0(X1),szszuzczcdt0(X2))
| equal(X1,X2) ),
inference(fof_nnf,[status(thm)],[61]) ).
fof(403,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ equal(szszuzczcdt0(X3),szszuzczcdt0(X4))
| equal(X3,X4) ),
inference(variable_rename,[status(thm)],[402]) ).
cnf(404,plain,
( X1 = X2
| szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[403]) ).
cnf(551,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(552,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(553,plain,
sbrdtbr0(xQ) = szszuzczcdt0(xk),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(586,plain,
sbrdtbr0(xQ) = xK,
inference(rw,[status(thm)],[553,210,theory(equality)]) ).
cnf(587,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[552,586,theory(equality)]) ).
cnf(885,plain,
( X1 = xk
| szszuzczcdt0(X1) != szszuzczcdt0(xk)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[404,211,theory(equality)]) ).
cnf(895,plain,
( X1 = xk
| szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[885,210,theory(equality)]) ).
cnf(2739,plain,
( sbrdtbr0(xP) = xk
| szszuzczcdt0(sbrdtbr0(xP)) != xK ),
inference(spm,[status(thm)],[895,551,theory(equality)]) ).
cnf(2754,plain,
( sbrdtbr0(xP) = xk
| $false ),
inference(rw,[status(thm)],[2739,587,theory(equality)]) ).
cnf(2755,plain,
sbrdtbr0(xP) = xk,
inference(cn,[status(thm)],[2754,theory(equality)]) ).
cnf(2756,plain,
$false,
inference(sr,[status(thm)],[2755,209,theory(equality)]) ).
cnf(2757,plain,
$false,
2756,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM613+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.24 % Computer : n033.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 10:40:00 CST 2018
% 0.03/0.24 % 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.43 -running prover on /export/starexec/sandbox2/tmp/tmp3YG5AB/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.43 -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/tmp3YG5AB/sel_theBenchmark.p_1']
% 0.07/0.43 -prover status Theorem
% 0.07/0.43 Problem theBenchmark.p solved in phase 0.
% 0.07/0.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.43 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.43 Solved 1 out of 1.
% 0.07/0.43 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.43 # SZS status Theorem
% 0.07/0.43 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.43 # SZS output end CNFRefutation
%------------------------------------------------------------------------------