TSTP Solution File: PUZ133+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ133+3 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:20:23 EDT 2023
% Result : Timeout 287.25s 38.77s
% Output : None
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( queens_p
=> ! [X0,X1] :
( ( le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
=> ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_p) ).
fof(f2,axiom,
! [X0] : perm(X0) = minus(s(n),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation) ).
fof(f3,axiom,
( ! [X0,X1] :
( ( le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
=> ( minus(q(X0),X0) != minus(q(X1),X1)
& plus(q(X0),X0) != plus(q(X1),X1)
& q(X0) != q(X1) ) )
=> queens_q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_q) ).
fof(f4,conjecture,
( ( ! [X0] : q(X0) = p(perm(X0))
& queens_p )
=> queens_q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_sym) ).
fof(f5,negated_conjecture,
~ ( ( ! [X0] : q(X0) = p(perm(X0))
& queens_p )
=> queens_q ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,axiom,
! [X0] :
( ( le(X0,n)
& le(s(n0),X0) )
=> ( le(perm(X0),n)
& le(s(n0),perm(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation_range) ).
fof(f7,axiom,
! [X0,X1] :
( lt(X0,X1)
<=> lt(perm(X1),perm(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation_anti_monotone) ).
fof(f8,axiom,
! [X1,X0] : minus(X0,X1) = minus(perm(X1),perm(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation_another_one) ).
fof(f9,axiom,
! [X2,X3,X4] :
( ( le(X3,X4)
& le(X2,X3) )
=> le(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',le_trans) ).
fof(f10,axiom,
! [X2] : le(X2,s(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_le) ).
fof(f11,axiom,
! [X0,X1,X5,X6] :
( plus(X0,X1) = plus(X5,X6)
<=> minus(X0,X5) = minus(X6,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1) ).
fof(f12,axiom,
! [X0,X1,X5,X6] :
( minus(X0,X1) = minus(X5,X6)
<=> minus(X0,X5) = minus(X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minus1) ).
fof(f13,plain,
! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1)),
inference(rectify,[],[f8]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( le(X1,X2)
& le(X0,X1) )
=> le(X0,X2) ),
inference(rectify,[],[f9]) ).
fof(f15,plain,
! [X0] : le(X0,s(X0)),
inference(rectify,[],[f10]) ).
fof(f16,plain,
! [X0,X1,X2,X3] :
( plus(X0,X1) = plus(X2,X3)
<=> minus(X0,X2) = minus(X3,X1) ),
inference(rectify,[],[f11]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( minus(X0,X1) = minus(X2,X3)
<=> minus(X0,X2) = minus(X1,X3) ),
inference(rectify,[],[f12]) ).
fof(f18,plain,
( ! [X0,X1] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0) )
| ~ queens_p ),
inference(ennf_transformation,[],[f1]) ).
fof(f19,plain,
( ! [X0,X1] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0) )
| ~ queens_p ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
( queens_q
| ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f21,plain,
( queens_q
| ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
( ~ queens_q
& ! [X0] : q(X0) = p(perm(X0))
& queens_p ),
inference(ennf_transformation,[],[f5]) ).
fof(f23,plain,
( ~ queens_q
& ! [X0] : q(X0) = p(perm(X0))
& queens_p ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0] :
( ( le(perm(X0),n)
& le(s(n0),perm(X0)) )
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0] :
( ( le(perm(X0),n)
& le(s(n0),perm(X0)) )
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
! [X0,X1,X2] :
( le(X0,X2)
| ~ le(X1,X2)
| ~ le(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1,X2] :
( le(X0,X2)
| ~ le(X1,X2)
| ~ le(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
( ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
=> ( ( minus(q(sK0),sK0) = minus(q(sK1),sK1)
| plus(q(sK0),sK0) = plus(q(sK1),sK1)
| q(sK0) = q(sK1) )
& le(sK1,n)
& le(s(sK0),sK1)
& le(sK0,n)
& le(s(n0),sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( queens_q
| ( ( minus(q(sK0),sK0) = minus(q(sK1),sK1)
| plus(q(sK0),sK0) = plus(q(sK1),sK1)
| q(sK0) = q(sK1) )
& le(sK1,n)
& le(s(sK0),sK1)
& le(sK0,n)
& le(s(n0),sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f21,f28]) ).
fof(f30,plain,
! [X0,X1] :
( ( lt(X0,X1)
| ~ lt(perm(X1),perm(X0)) )
& ( lt(perm(X1),perm(X0))
| ~ lt(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( ( plus(X0,X1) = plus(X2,X3)
| minus(X0,X2) != minus(X3,X1) )
& ( minus(X0,X2) = minus(X3,X1)
| plus(X0,X1) != plus(X2,X3) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( ( minus(X0,X1) = minus(X2,X3)
| minus(X0,X2) != minus(X1,X3) )
& ( minus(X0,X2) = minus(X1,X3)
| minus(X0,X1) != minus(X2,X3) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f33,plain,
! [X0,X1] :
( p(X0) != p(X1)
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ queens_p ),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X0,X1] :
( plus(p(X0),X0) != plus(p(X1),X1)
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ queens_p ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
! [X0,X1] :
( minus(p(X0),X0) != minus(p(X1),X1)
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ queens_p ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X0] : perm(X0) = minus(s(n),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f37,plain,
( queens_q
| le(s(n0),sK0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f38,plain,
( queens_q
| le(sK0,n) ),
inference(cnf_transformation,[],[f29]) ).
fof(f39,plain,
( queens_q
| le(s(sK0),sK1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f40,plain,
( queens_q
| le(sK1,n) ),
inference(cnf_transformation,[],[f29]) ).
fof(f41,plain,
( queens_q
| minus(q(sK0),sK0) = minus(q(sK1),sK1)
| plus(q(sK0),sK0) = plus(q(sK1),sK1)
| q(sK0) = q(sK1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f42,plain,
queens_p,
inference(cnf_transformation,[],[f23]) ).
fof(f43,plain,
! [X0] : q(X0) = p(perm(X0)),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
~ queens_q,
inference(cnf_transformation,[],[f23]) ).
fof(f45,plain,
! [X0] :
( le(s(n0),perm(X0))
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0] :
( le(perm(X0),n)
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f47,plain,
! [X0,X1] :
( lt(perm(X1),perm(X0))
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f48,plain,
! [X0,X1] :
( lt(X0,X1)
| ~ lt(perm(X1),perm(X0)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,plain,
! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1)),
inference(cnf_transformation,[],[f13]) ).
fof(f50,plain,
! [X2,X0,X1] :
( le(X0,X2)
| ~ le(X1,X2)
| ~ le(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
! [X0] : le(X0,s(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f52,plain,
! [X2,X3,X0,X1] :
( minus(X0,X2) = minus(X3,X1)
| plus(X0,X1) != plus(X2,X3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( plus(X0,X1) = plus(X2,X3)
| minus(X0,X2) != minus(X3,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( minus(X0,X2) = minus(X1,X3)
| minus(X0,X1) != minus(X2,X3) ),
inference(cnf_transformation,[],[f32]) ).
fof(f56,plain,
! [X0] : q(X0) = p(minus(s(n),X0)),
inference(definition_unfolding,[],[f43,f36]) ).
fof(f57,plain,
( queens_q
| minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1)
| plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1)
| p(minus(s(n),sK0)) = p(minus(s(n),sK1)) ),
inference(definition_unfolding,[],[f41,f56,f56,f56,f56,f56,f56]) ).
fof(f58,plain,
! [X0] :
( le(minus(s(n),X0),n)
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(definition_unfolding,[],[f46,f36]) ).
fof(f59,plain,
! [X0] :
( le(s(n0),minus(s(n),X0))
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(definition_unfolding,[],[f45,f36]) ).
fof(f60,plain,
! [X0,X1] :
( lt(X0,X1)
| ~ lt(minus(s(n),X1),minus(s(n),X0)) ),
inference(definition_unfolding,[],[f48,f36,f36]) ).
fof(f61,plain,
! [X0,X1] :
( lt(minus(s(n),X1),minus(s(n),X0))
| ~ lt(X0,X1) ),
inference(definition_unfolding,[],[f47,f36,f36]) ).
fof(f62,plain,
! [X0,X1] : minus(X1,X0) = minus(minus(s(n),X0),minus(s(n),X1)),
inference(definition_unfolding,[],[f49,f36,f36]) ).
cnf(c_49,plain,
( minus(p(X0),X0) != minus(p(X1),X1)
| ~ le(s(X0),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(X1,n)
| ~ queens_p ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_50,plain,
( plus(p(X0),X0) != plus(p(X1),X1)
| ~ le(s(X0),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(X1,n)
| ~ queens_p ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_51,plain,
( p(X0) != p(X1)
| ~ le(s(X0),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(X1,n)
| ~ queens_p ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_52,negated_conjecture,
( minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1)
| plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1)
| p(minus(s(n),sK0)) = p(minus(s(n),sK1))
| queens_q ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_53,plain,
( le(sK1,n)
| queens_q ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_54,plain,
( le(s(sK0),sK1)
| queens_q ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_55,plain,
( le(sK0,n)
| queens_q ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_56,plain,
( le(s(n0),sK0)
| queens_q ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_57,negated_conjecture,
~ queens_q,
inference(cnf_transformation,[],[f44]) ).
cnf(c_58,negated_conjecture,
queens_p,
inference(cnf_transformation,[],[f42]) ).
cnf(c_59,plain,
( ~ le(s(n0),X0)
| ~ le(X0,n)
| le(minus(s(n),X0),n) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_60,plain,
( ~ le(s(n0),X0)
| ~ le(X0,n)
| le(s(n0),minus(s(n),X0)) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_61,plain,
( ~ lt(minus(s(n),X0),minus(s(n),X1))
| lt(X1,X0) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_62,plain,
( ~ lt(X0,X1)
| lt(minus(s(n),X1),minus(s(n),X0)) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_63,plain,
minus(minus(s(n),X0),minus(s(n),X1)) = minus(X1,X0),
inference(cnf_transformation,[],[f62]) ).
cnf(c_64,plain,
( ~ le(X0,X1)
| ~ le(X1,X2)
| le(X0,X2) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_65,plain,
le(X0,s(X0)),
inference(cnf_transformation,[],[f51]) ).
cnf(c_66,plain,
( minus(X0,X1) != minus(X2,X3)
| plus(X0,X3) = plus(X1,X2) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_67,plain,
( plus(X0,X1) != plus(X2,X3)
| minus(X0,X2) = minus(X3,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_69,plain,
( minus(X0,X1) != minus(X2,X3)
| minus(X0,X2) = minus(X1,X3) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_81,plain,
le(sK0,n),
inference(global_subsumption_just,[status(thm)],[c_55,c_57,c_55]) ).
cnf(c_83,plain,
le(sK1,n),
inference(global_subsumption_just,[status(thm)],[c_53,c_57,c_53]) ).
cnf(c_85,plain,
le(s(n0),sK0),
inference(global_subsumption_just,[status(thm)],[c_56,c_57,c_56]) ).
cnf(c_87,plain,
le(s(sK0),sK1),
inference(global_subsumption_just,[status(thm)],[c_54,c_57,c_54]) ).
cnf(c_89,plain,
( ~ le(X1,n)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ le(s(X0),X1)
| p(X0) != p(X1) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_58,c_51]) ).
cnf(c_90,plain,
( p(X0) != p(X1)
| ~ le(s(X0),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(X1,n) ),
inference(renaming,[status(thm)],[c_89]) ).
cnf(c_92,plain,
( ~ le(X1,n)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ le(s(X0),X1)
| plus(p(X0),X0) != plus(p(X1),X1) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_58,c_50]) ).
cnf(c_93,plain,
( plus(p(X0),X0) != plus(p(X1),X1)
| ~ le(s(X0),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(X1,n) ),
inference(renaming,[status(thm)],[c_92]) ).
cnf(c_95,plain,
( ~ le(X1,n)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ le(s(X0),X1)
| minus(p(X0),X0) != minus(p(X1),X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_58,c_49]) ).
cnf(c_96,plain,
( minus(p(X0),X0) != minus(p(X1),X1)
| ~ le(s(X0),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(X1,n) ),
inference(renaming,[status(thm)],[c_95]) ).
cnf(c_98,plain,
( p(minus(s(n),sK0)) = p(minus(s(n),sK1))
| plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1)
| minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_57,c_52]) ).
cnf(c_99,negated_conjecture,
( minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1)
| plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1)
| p(minus(s(n),sK0)) = p(minus(s(n),sK1)) ),
inference(renaming,[status(thm)],[c_98]) ).
cnf(c_198,plain,
( X0 != X1
| X2 != X3
| ~ lt(X1,X3)
| lt(X0,X2) ),
theory(equality) ).
cnf(c_285,negated_conjecture,
( minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1)
| plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1)
| p(minus(s(n),sK0)) = p(minus(s(n),sK1)) ),
inference(subtyping,[status(esa)],[c_99]) ).
cnf(c_286,plain,
( minus(p(X0_13),X0_13) != minus(p(X1_13),X1_13)
| ~ le(s(X0_13),X1_13)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n)
| ~ le(X1_13,n) ),
inference(subtyping,[status(esa)],[c_96]) ).
cnf(c_287,plain,
( plus(p(X0_13),X0_13) != plus(p(X1_13),X1_13)
| ~ le(s(X0_13),X1_13)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n)
| ~ le(X1_13,n) ),
inference(subtyping,[status(esa)],[c_93]) ).
cnf(c_288,plain,
( p(X0_13) != p(X1_13)
| ~ le(s(X0_13),X1_13)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n)
| ~ le(X1_13,n) ),
inference(subtyping,[status(esa)],[c_90]) ).
cnf(c_289,plain,
le(s(sK0),sK1),
inference(subtyping,[status(esa)],[c_87]) ).
cnf(c_290,plain,
le(s(n0),sK0),
inference(subtyping,[status(esa)],[c_85]) ).
cnf(c_291,plain,
le(sK1,n),
inference(subtyping,[status(esa)],[c_83]) ).
cnf(c_292,plain,
le(sK0,n),
inference(subtyping,[status(esa)],[c_81]) ).
cnf(c_293,plain,
( minus(X0_13,X1_13) != minus(X2_13,X3_13)
| minus(X0_13,X2_13) = minus(X1_13,X3_13) ),
inference(subtyping,[status(esa)],[c_69]) ).
cnf(c_294,plain,
( plus(X0_13,X1_13) != plus(X2_13,X3_13)
| minus(X0_13,X2_13) = minus(X3_13,X1_13) ),
inference(subtyping,[status(esa)],[c_67]) ).
cnf(c_295,plain,
( minus(X0_13,X1_13) != minus(X2_13,X3_13)
| plus(X0_13,X3_13) = plus(X1_13,X2_13) ),
inference(subtyping,[status(esa)],[c_66]) ).
cnf(c_296,plain,
le(X0_13,s(X0_13)),
inference(subtyping,[status(esa)],[c_65]) ).
cnf(c_297,plain,
( ~ le(X0_13,X1_13)
| ~ le(X1_13,X2_13)
| le(X0_13,X2_13) ),
inference(subtyping,[status(esa)],[c_64]) ).
cnf(c_298,plain,
minus(minus(s(n),X0_13),minus(s(n),X1_13)) = minus(X1_13,X0_13),
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_299,plain,
( ~ le(s(n0),X0_13)
| ~ le(X0_13,n)
| le(s(n0),minus(s(n),X0_13)) ),
inference(subtyping,[status(esa)],[c_60]) ).
cnf(c_300,plain,
( ~ le(s(n0),X0_13)
| ~ le(X0_13,n)
| le(minus(s(n),X0_13),n) ),
inference(subtyping,[status(esa)],[c_59]) ).
cnf(c_301,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_302,plain,
X0_13 = X0_13,
theory(equality) ).
cnf(c_306,plain,
( X0_13 != X1_13
| p(X0_13) = p(X1_13) ),
theory(equality) ).
cnf(c_596,plain,
( p(X0_13) != p(sK0)
| ~ le(s(X0_13),sK0)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n)
| ~ le(sK0,n) ),
inference(instantiation,[status(thm)],[c_288]) ).
cnf(c_745,plain,
sK0 = sK0,
inference(instantiation,[status(thm)],[c_302]) ).
cnf(c_3963,plain,
( p(sK0) != p(sK0)
| ~ le(s(n0),sK0)
| ~ le(s(sK0),sK0)
| ~ le(sK0,n) ),
inference(instantiation,[status(thm)],[c_596]) ).
cnf(c_7952,plain,
( sK0 != sK0
| p(sK0) = p(sK0) ),
inference(instantiation,[status(thm)],[c_306]) ).
cnf(c_170189,plain,
( ~ le(s(X0_13),X0_13)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n) ),
inference(resolution,[status(thm)],[c_288,c_302]) ).
cnf(c_301757,plain,
( ~ le(s(minus(s(n),X0_13)),minus(s(n),X0_13))
| ~ le(minus(s(n),X0_13),n)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n) ),
inference(resolution,[status(thm)],[c_170189,c_299]) ).
cnf(c_400079,plain,
( ~ le(s(X0_13),X0_13)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n) ),
inference(equality_resolution,[status(thm)],[c_288]) ).
cnf(c_422920,plain,
( ~ le(s(sK0),sK0)
| ~ le(sK0,n) ),
inference(superposition,[status(thm)],[c_290,c_400079]) ).
cnf(c_422921,plain,
( ~ le(s(s(s(n0))),s(s(n0)))
| ~ le(s(s(n0)),n) ),
inference(superposition,[status(thm)],[c_296,c_400079]) ).
cnf(c_422922,plain,
( ~ le(s(minus(s(n),X0_13)),minus(s(n),X0_13))
| ~ le(minus(s(n),X0_13),n)
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n) ),
inference(superposition,[status(thm)],[c_299,c_400079]) ).
cnf(c_460496,plain,
~ le(s(sK0),sK0),
inference(global_subsumption_just,[status(thm)],[c_422920,c_57,c_55,c_56,c_745,c_3963,c_7952]) ).
cnf(c_546333,plain,
( ~ le(s(minus(s(n),X0_13)),minus(s(n),X0_13))
| ~ le(s(n0),X0_13)
| ~ le(X0_13,n) ),
inference(global_subsumption_just,[status(thm)],[c_422922,c_300,c_301757]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ133+3 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.18/0.35 % Computer : n016.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Sat Aug 26 23:09:28 EDT 2023
% 0.18/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 38.49/6.18 % SZS status Started for theBenchmark.p
% 38.49/6.18 ERROR - "ProverProcess:heur/379306:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Z3.Error("Sort mismatch at argument #2 for function (declare-fun k!99 (|16777216| |16777216|) Bool) supplied sort is |16777229|")
% 38.49/6.18 Fatal error: exception Z3.Error("Sort mismatch at argument #2 for function (declare-fun k!99 (|16777216| |16777216|) Bool) supplied sort is |16777229|")
% 38.49/6.18 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground false --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;ACNormalisation]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;Demod;LightNorm;ACNormalisation]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[]" --sup_input_bw "[SubsumptionRes]" --sup_input_fw "[SMTSubs;]" --sup_input_triv "[]" --sup_iter_deepening 1 --sup_passive_queue_type priority_queues --sup_passive_queues "[[+min_def_symb;-score;+epr];[-next_state;-conj_dist;+conj_symb]]" --sup_passive_queues_freq "[3;512]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 320 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 2.00" --time_out_real 2.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_t0km89d2/ifxnx6yt 2>> /export/starexec/sandbox2/tmp/iprover_out_t0km89d2/ifxnx6yt_error
% 287.25/38.77 % SZS status CounterSatisfiable for theBenchmark.p
% 287.25/38.77
% 287.25/38.77 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 287.25/38.77
% 287.25/38.77 ------ iProver source info
% 287.25/38.77
% 287.25/38.77 git: date: 2023-05-31 18:12:56 +0000
% 287.25/38.77 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 287.25/38.77 git: non_committed_changes: false
% 287.25/38.77 git: last_make_outside_of_git: false
% 287.25/38.77
% 287.25/38.77 ------ Parsing...
% 287.25/38.77 ------ Clausification by vclausify_rel & Parsing by iProver...
% 287.25/38.77
% 287.25/38.77 ------ Preprocessing... sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 287.25/38.77
% 287.25/38.77 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 287.25/38.77
% 287.25/38.77 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 287.25/38.77 ------ Proving...
% 287.25/38.77 ------ Problem Properties
% 287.25/38.77
% 287.25/38.77
% 287.25/38.77 clauses 16
% 287.25/38.77 conjectures 1
% 287.25/38.77 EPR 3
% 287.25/38.77 Horn 15
% 287.25/38.77 unary 6
% 287.25/38.77 binary 3
% 287.25/38.77 lits 39
% 287.25/38.77 lits eq 13
% 287.25/38.77 fd_pure 0
% 287.25/38.77 fd_pseudo 0
% 287.25/38.77 fd_cond 0
% 287.25/38.77 fd_pseudo_cond 0
% 287.25/38.77 AC symbols 0
% 287.25/38.77
% 287.25/38.77 ------ Input Options Time Limit: Unbounded
% 287.25/38.77
% 287.25/38.77
% 287.25/38.77 ------
% 287.25/38.77 Current options:
% 287.25/38.77 ------
% 287.25/38.77
% 287.25/38.77
% 287.25/38.77
% 287.25/38.77
% 287.25/38.77 ------ Proving...
% 287.25/38.77
% 287.25/38.77
% 287.25/38.77 % SZS status CounterSatisfiable for theBenchmark.p
% 287.25/38.77
% 287.25/38.77 % SZS output start Saturation for theBenchmark.p
% See solution above
% 287.25/38.77
% 287.25/38.79
%------------------------------------------------------------------------------