%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV117+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:08:10 PM UTC 2026
% Result : Theorem 0.84s 0.98s
% Output : Refutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 90 ( 14 unt; 3 def)
% Number of atoms : 583 ( 81 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 753 ( 260 ~; 285 |; 186 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 18 con; 0-3 aty)
% Number of variables : 127 ( 89 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f41,axiom,
! [X0] : succ(pred(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_pred) ).
fof(f53,conjecture,
( ( leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,minus(n6,n1))
& leq(X1,minus(n6,n1)) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(n0,X3)
& leq(X2,minus(n3,n1))
& leq(X3,minus(n3,n1)) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,minus(n6,n1))
& leq(X5,minus(n6,n1)) )
=> a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,minus(plus(n1,minus(n6,n1)),n1)) )
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,minus(n6,n1)) )
=> a_select3(id_ds1_filter,X6,X7) = a_select3(id_ds1_filter,X7,X6) ) ) )
=> ( leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X8,X9] :
( ( leq(n0,X8)
& leq(n0,X9)
& leq(X8,minus(n6,n1))
& leq(X9,minus(n6,n1)) )
=> a_select3(q_ds1_filter,X8,X9) = a_select3(q_ds1_filter,X9,X8) )
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(n3,n1))
& leq(X11,minus(n3,n1)) )
=> a_select3(r_ds1_filter,X10,X11) = a_select3(r_ds1_filter,X11,X10) )
& ! [X12,X13] :
( ( leq(n0,X12)
& leq(n0,X13)
& leq(X12,minus(n6,n1))
& leq(X13,minus(n6,n1)) )
=> a_select3(pminus_ds1_filter,X12,X13) = a_select3(pminus_ds1_filter,X13,X12) )
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,minus(n6,n1)) )
=> ! [X15] :
( ( leq(n0,X15)
& leq(X15,minus(n6,n1)) )
=> a_select3(id_ds1_filter,X14,X15) = a_select3(id_ds1_filter,X15,X14) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0010) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,minus(n6,n1))
& leq(X1,minus(n6,n1)) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(n0,X3)
& leq(X2,minus(n3,n1))
& leq(X3,minus(n3,n1)) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,minus(n6,n1))
& leq(X5,minus(n6,n1)) )
=> a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,minus(plus(n1,minus(n6,n1)),n1)) )
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,minus(n6,n1)) )
=> a_select3(id_ds1_filter,X6,X7) = a_select3(id_ds1_filter,X7,X6) ) ) )
=> ( leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X8,X9] :
( ( leq(n0,X8)
& leq(n0,X9)
& leq(X8,minus(n6,n1))
& leq(X9,minus(n6,n1)) )
=> a_select3(q_ds1_filter,X8,X9) = a_select3(q_ds1_filter,X9,X8) )
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(n3,n1))
& leq(X11,minus(n3,n1)) )
=> a_select3(r_ds1_filter,X10,X11) = a_select3(r_ds1_filter,X11,X10) )
& ! [X12,X13] :
( ( leq(n0,X12)
& leq(n0,X13)
& leq(X12,minus(n6,n1))
& leq(X13,minus(n6,n1)) )
=> a_select3(pminus_ds1_filter,X12,X13) = a_select3(pminus_ds1_filter,X13,X12) )
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,minus(n6,n1)) )
=> ! [X15] :
( ( leq(n0,X15)
& leq(X15,minus(n6,n1)) )
=> a_select3(id_ds1_filter,X14,X15) = a_select3(id_ds1_filter,X15,X14) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f104,plain,
( ( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| ? [X8,X9] :
( a_select3(q_ds1_filter,X8,X9) != a_select3(q_ds1_filter,X9,X8)
& leq(n0,X8)
& leq(n0,X9)
& leq(X8,minus(n6,n1))
& leq(X9,minus(n6,n1)) )
| ? [X10,X11] :
( a_select3(r_ds1_filter,X10,X11) != a_select3(r_ds1_filter,X11,X10)
& leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(n3,n1))
& leq(X11,minus(n3,n1)) )
| ? [X12,X13] :
( a_select3(pminus_ds1_filter,X12,X13) != a_select3(pminus_ds1_filter,X13,X12)
& leq(n0,X12)
& leq(n0,X13)
& leq(X12,minus(n6,n1))
& leq(X13,minus(n6,n1)) )
| ? [X14] :
( ? [X15] :
( a_select3(id_ds1_filter,X14,X15) != a_select3(id_ds1_filter,X15,X14)
& leq(n0,X15)
& leq(X15,minus(n6,n1)) )
& leq(n0,X14)
& leq(X14,minus(n6,n1)) ) )
& leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,minus(n6,n1))
| ~ leq(X1,minus(n6,n1)) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,minus(n3,n1))
| ~ leq(X3,minus(n3,n1)) )
& ! [X4,X5] :
( a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,minus(n6,n1))
| ~ leq(X5,minus(n6,n1)) )
& ! [X6] :
( ! [X7] :
( a_select3(id_ds1_filter,X6,X7) = a_select3(id_ds1_filter,X7,X6)
| ~ leq(n0,X7)
| ~ leq(X7,minus(n6,n1)) )
| ~ leq(n0,X6)
| ~ leq(X6,minus(plus(n1,minus(n6,n1)),n1)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f105,plain,
( ( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| ? [X8,X9] :
( a_select3(q_ds1_filter,X8,X9) != a_select3(q_ds1_filter,X9,X8)
& leq(n0,X8)
& leq(n0,X9)
& leq(X8,minus(n6,n1))
& leq(X9,minus(n6,n1)) )
| ? [X10,X11] :
( a_select3(r_ds1_filter,X10,X11) != a_select3(r_ds1_filter,X11,X10)
& leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(n3,n1))
& leq(X11,minus(n3,n1)) )
| ? [X12,X13] :
( a_select3(pminus_ds1_filter,X12,X13) != a_select3(pminus_ds1_filter,X13,X12)
& leq(n0,X12)
& leq(n0,X13)
& leq(X12,minus(n6,n1))
& leq(X13,minus(n6,n1)) )
| ? [X14] :
( ? [X15] :
( a_select3(id_ds1_filter,X14,X15) != a_select3(id_ds1_filter,X15,X14)
& leq(n0,X15)
& leq(X15,minus(n6,n1)) )
& leq(n0,X14)
& leq(X14,minus(n6,n1)) ) )
& leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,minus(n6,n1))
| ~ leq(X1,minus(n6,n1)) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,minus(n3,n1))
| ~ leq(X3,minus(n3,n1)) )
& ! [X4,X5] :
( a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,minus(n6,n1))
| ~ leq(X5,minus(n6,n1)) )
& ! [X6] :
( ! [X7] :
( a_select3(id_ds1_filter,X6,X7) = a_select3(id_ds1_filter,X7,X6)
| ~ leq(n0,X7)
| ~ leq(X7,minus(n6,n1)) )
| ~ leq(n0,X6)
| ~ leq(X6,minus(plus(n1,minus(n6,n1)),n1)) ) ),
inference(flattening,[],[f104]) ).
fof(f130,definition,
( ? [X14] :
( ? [X15] :
( a_select3(id_ds1_filter,X14,X15) != a_select3(id_ds1_filter,X15,X14)
& leq(n0,X15)
& leq(X15,minus(n6,n1)) )
& leq(n0,X14)
& leq(X14,minus(n6,n1)) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f131,definition,
( ? [X12,X13] :
( a_select3(pminus_ds1_filter,X12,X13) != a_select3(pminus_ds1_filter,X13,X12)
& leq(n0,X12)
& leq(n0,X13)
& leq(X12,minus(n6,n1))
& leq(X13,minus(n6,n1)) )
| ~ sP1 ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f132,definition,
( ? [X10,X11] :
( a_select3(r_ds1_filter,X10,X11) != a_select3(r_ds1_filter,X11,X10)
& leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(n3,n1))
& leq(X11,minus(n3,n1)) )
| ~ sP2 ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f133,plain,
( ( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| ? [X8,X9] :
( a_select3(q_ds1_filter,X8,X9) != a_select3(q_ds1_filter,X9,X8)
& leq(n0,X8)
& leq(n0,X9)
& leq(X8,minus(n6,n1))
& leq(X9,minus(n6,n1)) )
| sP2
| sP1
| sP0 )
& leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,minus(n6,n1))
| ~ leq(X1,minus(n6,n1)) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,minus(n3,n1))
| ~ leq(X3,minus(n3,n1)) )
& ! [X4,X5] :
( a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,minus(n6,n1))
| ~ leq(X5,minus(n6,n1)) )
& ! [X6] :
( ! [X7] :
( a_select3(id_ds1_filter,X6,X7) = a_select3(id_ds1_filter,X7,X6)
| ~ leq(n0,X7)
| ~ leq(X7,minus(n6,n1)) )
| ~ leq(n0,X6)
| ~ leq(X6,minus(plus(n1,minus(n6,n1)),n1)) ) ),
inference(definition_folding,[],[f105,f132,f131,f130]) ).
fof(f134,plain,
( ? [X10,X11] :
( a_select3(r_ds1_filter,X10,X11) != a_select3(r_ds1_filter,X11,X10)
& leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(n3,n1))
& leq(X11,minus(n3,n1)) )
| ~ sP2 ),
inference(nnf_transformation,[],[f132]) ).
fof(f135,plain,
( ? [X0,X1] :
( a_select3(r_ds1_filter,X0,X1) != a_select3(r_ds1_filter,X1,X0)
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,minus(n3,n1))
& leq(X1,minus(n3,n1)) )
| ~ sP2 ),
inference(rectify,[],[f134]) ).
fof(f136,plain,
( ( a_select3(r_ds1_filter,sK3,sK4) != a_select3(r_ds1_filter,sK4,sK3)
& leq(n0,sK3)
& leq(n0,sK4)
& leq(sK3,minus(n3,n1))
& leq(sK4,minus(n3,n1)) )
| ~ sP2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f135]) ).
fof(f137,plain,
( ? [X12,X13] :
( a_select3(pminus_ds1_filter,X12,X13) != a_select3(pminus_ds1_filter,X13,X12)
& leq(n0,X12)
& leq(n0,X13)
& leq(X12,minus(n6,n1))
& leq(X13,minus(n6,n1)) )
| ~ sP1 ),
inference(nnf_transformation,[],[f131]) ).
fof(f138,plain,
( ? [X0,X1] :
( a_select3(pminus_ds1_filter,X0,X1) != a_select3(pminus_ds1_filter,X1,X0)
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,minus(n6,n1))
& leq(X1,minus(n6,n1)) )
| ~ sP1 ),
inference(rectify,[],[f137]) ).
fof(f139,plain,
( ( a_select3(pminus_ds1_filter,sK5,sK6) != a_select3(pminus_ds1_filter,sK6,sK5)
& leq(n0,sK5)
& leq(n0,sK6)
& leq(sK5,minus(n6,n1))
& leq(sK6,minus(n6,n1)) )
| ~ sP1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f138]) ).
fof(f140,plain,
( ? [X14] :
( ? [X15] :
( a_select3(id_ds1_filter,X14,X15) != a_select3(id_ds1_filter,X15,X14)
& leq(n0,X15)
& leq(X15,minus(n6,n1)) )
& leq(n0,X14)
& leq(X14,minus(n6,n1)) )
| ~ sP0 ),
inference(nnf_transformation,[],[f130]) ).
fof(f141,plain,
( ? [X0] :
( ? [X1] :
( a_select3(id_ds1_filter,X0,X1) != a_select3(id_ds1_filter,X1,X0)
& leq(n0,X1)
& leq(X1,minus(n6,n1)) )
& leq(n0,X0)
& leq(X0,minus(n6,n1)) )
| ~ sP0 ),
inference(rectify,[],[f140]) ).
fof(f142,plain,
( ( a_select3(id_ds1_filter,sK7,sK8) != a_select3(id_ds1_filter,sK8,sK7)
& leq(n0,sK8)
& leq(sK8,minus(n6,n1))
& leq(n0,sK7)
& leq(sK7,minus(n6,n1)) )
| ~ sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f141]) ).
fof(f143,plain,
( ( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| ? [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) != a_select3(q_ds1_filter,X1,X0)
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,minus(n6,n1))
& leq(X1,minus(n6,n1)) )
| sP2
| sP1
| sP0 )
& leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,minus(n6,n1))
| ~ leq(X3,minus(n6,n1)) )
& ! [X4,X5] :
( a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,minus(n3,n1))
| ~ leq(X5,minus(n3,n1)) )
& ! [X6,X7] :
( a_select3(pminus_ds1_filter,X6,X7) = a_select3(pminus_ds1_filter,X7,X6)
| ~ leq(n0,X6)
| ~ leq(n0,X7)
| ~ leq(X6,minus(n6,n1))
| ~ leq(X7,minus(n6,n1)) )
& ! [X8] :
( ! [X9] :
( a_select3(id_ds1_filter,X8,X9) = a_select3(id_ds1_filter,X9,X8)
| ~ leq(n0,X9)
| ~ leq(X9,minus(n6,n1)) )
| ~ leq(n0,X8)
| ~ leq(X8,minus(plus(n1,minus(n6,n1)),n1)) ) ),
inference(rectify,[],[f133]) ).
fof(f144,plain,
( ( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| ( a_select3(q_ds1_filter,sK9,sK10) != a_select3(q_ds1_filter,sK10,sK9)
& leq(n0,sK9)
& leq(n0,sK10)
& leq(sK9,minus(n6,n1))
& leq(sK10,minus(n6,n1)) )
| sP2
| sP1
| sP0 )
& leq(n0,pv5)
& leq(pv5,minus(n999,n1))
& ! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,minus(n6,n1))
| ~ leq(X3,minus(n6,n1)) )
& ! [X4,X5] :
( a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,minus(n3,n1))
| ~ leq(X5,minus(n3,n1)) )
& ! [X6,X7] :
( a_select3(pminus_ds1_filter,X6,X7) = a_select3(pminus_ds1_filter,X7,X6)
| ~ leq(n0,X6)
| ~ leq(n0,X7)
| ~ leq(X6,minus(n6,n1))
| ~ leq(X7,minus(n6,n1)) )
& ! [X8] :
( ! [X9] :
( a_select3(id_ds1_filter,X8,X9) = a_select3(id_ds1_filter,X9,X8)
| ~ leq(n0,X9)
| ~ leq(X9,minus(n6,n1)) )
| ~ leq(n0,X8)
| ~ leq(X8,minus(plus(n1,minus(n6,n1)),n1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X0,sK9),skolemize(X1,sK10)],[f143]) ).
fof(f148,plain,
( leq(sK4,minus(n3,n1))
| ~ sP2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f149,plain,
( leq(sK3,minus(n3,n1))
| ~ sP2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f150,plain,
( leq(n0,sK4)
| ~ sP2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f151,plain,
( leq(n0,sK3)
| ~ sP2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f152,plain,
( a_select3(r_ds1_filter,sK3,sK4) != a_select3(r_ds1_filter,sK4,sK3)
| ~ sP2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f153,plain,
( leq(sK6,minus(n6,n1))
| ~ sP1 ),
inference(cnf_transformation,[],[f139]) ).
fof(f154,plain,
( leq(sK5,minus(n6,n1))
| ~ sP1 ),
inference(cnf_transformation,[],[f139]) ).
fof(f155,plain,
( leq(n0,sK6)
| ~ sP1 ),
inference(cnf_transformation,[],[f139]) ).
fof(f156,plain,
( leq(n0,sK5)
| ~ sP1 ),
inference(cnf_transformation,[],[f139]) ).
fof(f157,plain,
( a_select3(pminus_ds1_filter,sK5,sK6) != a_select3(pminus_ds1_filter,sK6,sK5)
| ~ sP1 ),
inference(cnf_transformation,[],[f139]) ).
fof(f158,plain,
( leq(sK7,minus(n6,n1))
| ~ sP0 ),
inference(cnf_transformation,[],[f142]) ).
fof(f159,plain,
( leq(n0,sK7)
| ~ sP0 ),
inference(cnf_transformation,[],[f142]) ).
fof(f160,plain,
( leq(sK8,minus(n6,n1))
| ~ sP0 ),
inference(cnf_transformation,[],[f142]) ).
fof(f161,plain,
( leq(n0,sK8)
| ~ sP0 ),
inference(cnf_transformation,[],[f142]) ).
fof(f162,plain,
( a_select3(id_ds1_filter,sK7,sK8) != a_select3(id_ds1_filter,sK8,sK7)
| ~ sP0 ),
inference(cnf_transformation,[],[f142]) ).
fof(f163,plain,
! [X8,X9] :
( ~ leq(X8,minus(plus(n1,minus(n6,n1)),n1))
| ~ leq(n0,X9)
| ~ leq(X9,minus(n6,n1))
| ~ leq(n0,X8)
| a_select3(id_ds1_filter,X8,X9) = a_select3(id_ds1_filter,X9,X8) ),
inference(cnf_transformation,[],[f144]) ).
fof(f164,plain,
! [X6,X7] :
( a_select3(pminus_ds1_filter,X6,X7) = a_select3(pminus_ds1_filter,X7,X6)
| ~ leq(n0,X6)
| ~ leq(n0,X7)
| ~ leq(X6,minus(n6,n1))
| ~ leq(X7,minus(n6,n1)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f165,plain,
! [X4,X5] :
( a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,minus(n3,n1))
| ~ leq(X5,minus(n3,n1)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f166,plain,
! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,minus(n6,n1))
| ~ leq(X3,minus(n6,n1)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f167,plain,
leq(pv5,minus(n999,n1)),
inference(cnf_transformation,[],[f144]) ).
fof(f168,plain,
leq(n0,pv5),
inference(cnf_transformation,[],[f144]) ).
fof(f169,plain,
( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| leq(sK10,minus(n6,n1))
| sP2
| sP1
| sP0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f170,plain,
( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| leq(sK9,minus(n6,n1))
| sP2
| sP1
| sP0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f171,plain,
( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| leq(n0,sK10)
| sP2
| sP1
| sP0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f172,plain,
( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| leq(n0,sK9)
| sP2
| sP1
| sP0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f173,plain,
( ~ leq(n0,pv5)
| ~ leq(pv5,minus(n999,n1))
| a_select3(q_ds1_filter,sK9,sK10) != a_select3(q_ds1_filter,sK10,sK9)
| sP2
| sP1
| sP0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f190,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f198,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f243,plain,
! [X0] : succ(pred(X0)) = X0,
inference(cnf_transformation,[],[f41]) ).
fof(f276,plain,
! [X0] : plus(n1,minus(X0,n1)) = X0,
inference(definition_unfolding,[],[f243,f190,f198]) ).
fof(f281,plain,
( ~ leq(pv5,minus(n999,n1))
| leq(n0,sK10)
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f171,f168]) ).
fof(f282,plain,
( leq(n0,sK10)
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f281,f167]) ).
fof(f283,plain,
( ~ leq(pv5,minus(n999,n1))
| leq(n0,sK9)
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f172,f168]) ).
fof(f284,plain,
( leq(n0,sK9)
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f283,f167]) ).
fof(f285,plain,
( ~ leq(pv5,minus(n999,n1))
| leq(sK10,minus(n6,n1))
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f169,f168]) ).
fof(f286,plain,
( leq(sK10,minus(n6,n1))
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f285,f167]) ).
fof(f287,plain,
( ~ leq(pv5,minus(n999,n1))
| leq(sK9,minus(n6,n1))
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f170,f168]) ).
fof(f288,plain,
( leq(sK9,minus(n6,n1))
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f287,f167]) ).
fof(f289,plain,
( ~ leq(pv5,minus(n999,n1))
| a_select3(q_ds1_filter,sK9,sK10) != a_select3(q_ds1_filter,sK10,sK9)
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f173,f168]) ).
fof(f290,plain,
( a_select3(q_ds1_filter,sK9,sK10) != a_select3(q_ds1_filter,sK10,sK9)
| sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f289,f167]) ).
fof(f292,plain,
( a_select3(q_ds1_filter,sK9,sK10) != a_select3(q_ds1_filter,sK9,sK10)
| sP2
| sP1
| sP0
| ~ leq(n0,sK9)
| ~ leq(n0,sK10)
| ~ leq(sK9,minus(n6,n1))
| ~ leq(sK10,minus(n6,n1)) ),
inference(superposition,[],[f290,f166]) ).
fof(f293,plain,
( sP2
| sP1
| sP0
| ~ leq(n0,sK9)
| ~ leq(n0,sK10)
| ~ leq(sK9,minus(n6,n1))
| ~ leq(sK10,minus(n6,n1)) ),
inference(trivial_inequality_removal,[],[f292]) ).
fof(f295,plain,
( sP2
| sP1
| sP0
| ~ leq(n0,sK10)
| ~ leq(sK9,minus(n6,n1))
| ~ leq(sK10,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f293,f284]) ).
fof(f297,plain,
( sP2
| sP1
| sP0
| ~ leq(sK9,minus(n6,n1))
| ~ leq(sK10,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f295,f282]) ).
fof(f299,plain,
( sP2
| sP1
| sP0
| ~ leq(sK10,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f297,f288]) ).
fof(f301,plain,
( sP2
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f299,f286]) ).
fof(f319,plain,
! [X0,X1] :
( a_select3(id_ds1_filter,X0,X1) = a_select3(id_ds1_filter,X1,X0)
| ~ leq(n0,X1)
| ~ leq(X1,minus(n6,n1))
| ~ leq(n0,X0)
| ~ leq(X0,minus(n6,n1)) ),
inference(superposition,[],[f163,f276]) ).
fof(f491,plain,
( a_select3(r_ds1_filter,sK3,sK4) != a_select3(r_ds1_filter,sK3,sK4)
| ~ sP2
| ~ leq(n0,sK4)
| ~ leq(n0,sK3)
| ~ leq(sK4,minus(n3,n1))
| ~ leq(sK3,minus(n3,n1)) ),
inference(superposition,[],[f152,f165]) ).
fof(f492,plain,
( ~ sP2
| ~ leq(n0,sK4)
| ~ leq(n0,sK3)
| ~ leq(sK4,minus(n3,n1))
| ~ leq(sK3,minus(n3,n1)) ),
inference(trivial_inequality_removal,[],[f491]) ).
fof(f494,plain,
( ~ sP2
| ~ leq(n0,sK3)
| ~ leq(sK4,minus(n3,n1))
| ~ leq(sK3,minus(n3,n1)) ),
inference(forward_subsumption_resolution,[],[f492,f150]) ).
fof(f496,plain,
( ~ sP2
| ~ leq(sK4,minus(n3,n1))
| ~ leq(sK3,minus(n3,n1)) ),
inference(forward_subsumption_resolution,[],[f494,f151]) ).
fof(f498,plain,
( ~ sP2
| ~ leq(sK3,minus(n3,n1)) ),
inference(forward_subsumption_resolution,[],[f496,f148]) ).
fof(f500,plain,
~ sP2,
inference(forward_subsumption_resolution,[],[f498,f149]) ).
fof(f502,plain,
( sP1
| sP0 ),
inference(resolution,[],[f500,f301]) ).
fof(f504,plain,
( a_select3(pminus_ds1_filter,sK5,sK6) != a_select3(pminus_ds1_filter,sK5,sK6)
| ~ sP1
| ~ leq(n0,sK6)
| ~ leq(n0,sK5)
| ~ leq(sK6,minus(n6,n1))
| ~ leq(sK5,minus(n6,n1)) ),
inference(superposition,[],[f157,f164]) ).
fof(f505,plain,
( ~ sP1
| ~ leq(n0,sK6)
| ~ leq(n0,sK5)
| ~ leq(sK6,minus(n6,n1))
| ~ leq(sK5,minus(n6,n1)) ),
inference(trivial_inequality_removal,[],[f504]) ).
fof(f507,plain,
( ~ sP1
| ~ leq(n0,sK5)
| ~ leq(sK6,minus(n6,n1))
| ~ leq(sK5,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f505,f155]) ).
fof(f509,plain,
( ~ sP1
| ~ leq(sK6,minus(n6,n1))
| ~ leq(sK5,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f507,f156]) ).
fof(f511,plain,
( ~ sP1
| ~ leq(sK5,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f509,f153]) ).
fof(f513,plain,
~ sP1,
inference(forward_subsumption_resolution,[],[f511,f154]) ).
fof(f520,plain,
( a_select3(id_ds1_filter,sK7,sK8) != a_select3(id_ds1_filter,sK7,sK8)
| ~ sP0
| ~ leq(n0,sK7)
| ~ leq(sK7,minus(n6,n1))
| ~ leq(n0,sK8)
| ~ leq(sK8,minus(n6,n1)) ),
inference(superposition,[],[f162,f319]) ).
fof(f521,plain,
( ~ sP0
| ~ leq(n0,sK7)
| ~ leq(sK7,minus(n6,n1))
| ~ leq(n0,sK8)
| ~ leq(sK8,minus(n6,n1)) ),
inference(trivial_inequality_removal,[],[f520]) ).
fof(f527,plain,
( ~ sP0
| ~ leq(sK7,minus(n6,n1))
| ~ leq(n0,sK8)
| ~ leq(sK8,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f521,f159]) ).
fof(f533,plain,
( ~ sP0
| ~ leq(n0,sK8)
| ~ leq(sK8,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f527,f158]) ).
fof(f539,plain,
( ~ sP0
| ~ leq(sK8,minus(n6,n1)) ),
inference(forward_subsumption_resolution,[],[f533,f161]) ).
fof(f545,plain,
~ sP0,
inference(forward_subsumption_resolution,[],[f539,f160]) ).
fof(f581,plain,
sP0,
inference(forward_subsumption_resolution,[],[f502,f513]) ).
fof(f582,plain,
$false,
inference(forward_subsumption_resolution,[],[f581,f545]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV117+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 09:56:52 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/0.98 % (1818830)Detected formulas, will run a generic FOF schedule.
% 0.84/0.98 % (1818839)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4093641897:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.84/0.98 % (1818839)First to succeed.
% 0.84/0.98 % (1818839)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1818830"
% 0.84/0.98 % (1818836)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1239946083:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.84/0.98 % (1818835)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4234724118:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.84/0.98 % (1818837)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=413989403:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.84/0.98 % (1818841)dis-21_1_sil=8000:lcm=predicate:random_seed=2532482541:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 0.84/0.98 % (1818838)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2517971923:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.84/0.98 % (1818840)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3955995087:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.84/0.98 % (1818838)Instruction limit reached!
% 0.84/0.98 % (1818838)------------------------------
% 0.84/0.98 % (1818838)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.84/0.98 % (1818838)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.98 % (1818838)CaDiCaL version: 2.1.3
% 0.84/0.98 % (1818838)Termination reason: Instruction limit
% 0.84/0.98 % (1818838)Termination phase: Saturation
% 0.84/0.98 % (1818838)Time elapsed: 0.050 s
% 0.84/0.98 % (1818838)Peak memory usage: 88 MB
% 0.84/0.98 % (1818838)Instructions burned: 112 (million)
% 0.84/0.98 % (1818841)Instruction limit reached!
% 0.84/0.98 % (1818841)------------------------------
% 0.84/0.98 % (1818841)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.84/0.98 % (1818841)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.98 % (1818841)CaDiCaL version: 2.1.3
% 0.84/0.98 % (1818841)Termination reason: Instruction limit
% 0.84/0.98 % (1818841)Termination phase: Saturation
% 0.84/0.98 % (1818841)Time elapsed: 0.071 s
% 0.84/0.98 % (1818841)Peak memory usage: 89 MB
% 0.84/0.98 % (1818841)Instructions burned: 129 (million)
% 0.84/0.98 % (1818840)Instruction limit reached!
% 0.84/0.98 % (1818840)------------------------------
% 0.84/0.98 % (1818840)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.84/0.98 % (1818840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.98 % (1818840)CaDiCaL version: 2.1.3
% 0.84/0.98 % (1818840)Termination reason: Instruction limit
% 0.84/0.98 % (1818840)Termination phase: Saturation
% 0.84/0.98 % (1818840)Time elapsed: 0.088 s
% 0.84/0.98 % (1818840)Peak memory usage: 89 MB
% 0.84/0.98 % (1818840)Instructions burned: 139 (million)
% 0.84/0.98 % (1818839)Refutation found. Thanks to Tanya!
% 0.84/0.98 % SZS status Theorem for theBenchmark
% 0.84/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 2.73/1.08 % (1818839)------------------------------
% 2.73/1.08 % (1818839)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.08 % (1818839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.08 % (1818839)CaDiCaL version: 2.1.3
% 2.73/1.08 % (1818839)Termination reason: Refutation
% 2.73/1.08 % (1818839)Time elapsed: 0.009 s
% 2.73/1.08 % (1818839)Peak memory usage: 88 MB
% 2.73/1.08 % (1818839)Instructions burned: 23 (million)
% 2.73/1.08 % (1818839)------------------------------
% 2.73/1.08 % (1818839)------------------------------
% 2.73/1.08 % (1818830)Success in time 0.311 s
% 2.73/1.08 % Vampire exiting
%------------------------------------------------------------------------------