%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV042+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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 : Fri Sep 25 03:16:17 PM UTC 2026
% Result : Theorem 2.65s 1.21s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 98 ( 29 unt; 2 def)
% Number of atoms : 434 ( 158 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 511 ( 175 ~; 197 |; 117 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 58 !; 19 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n1)
=> ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X3] :
( ( leq(X3,minus(plus(n1,n2),n1))
& leq(n0,X3) )
=> a_select2(s_center7_init,X3) = init )
& ! [X2] :
( ( leq(X2,n3)
& leq(n0,X2) )
=> a_select2(s_values7_init,X2) = init )
& ! [X0] :
( ( leq(X0,n2)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,n3)
& leq(n0,X1) )
=> a_select3(simplex7_init,X1,X0) = init ) ) )
=> ( ( gt(loopcounter,n1)
=> ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X7] :
( ( leq(X7,n2)
& leq(n0,X7) )
=> a_select2(s_center7_init,X7) = init )
& ! [X6] :
( ( leq(X6,n3)
& leq(n0,X6) )
=> a_select2(s_values7_init,X6) = init )
& ! [X4] :
( ( leq(X4,n2)
& leq(n0,X4) )
=> ! [X5] :
( ( leq(X5,n3)
& leq(n0,X5) )
=> a_select3(simplex7_init,X5,X4) = init ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0081) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X3] :
( ( leq(X3,minus(plus(n1,n2),n1))
& leq(n0,X3) )
=> a_select2(s_center7_init,X3) = init )
& ! [X2] :
( ( leq(X2,n3)
& leq(n0,X2) )
=> a_select2(s_values7_init,X2) = init )
& ! [X0] :
( ( leq(X0,n2)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,n3)
& leq(n0,X1) )
=> a_select3(simplex7_init,X1,X0) = init ) ) )
=> ( ( gt(loopcounter,n1)
=> ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X7] :
( ( leq(X7,n2)
& leq(n0,X7) )
=> a_select2(s_center7_init,X7) = init )
& ! [X6] :
( ( leq(X6,n3)
& leq(n0,X6) )
=> a_select2(s_values7_init,X6) = init )
& ! [X4] :
( ( leq(X4,n2)
& leq(n0,X4) )
=> ! [X5] :
( ( leq(X5,n3)
& leq(n0,X5) )
=> a_select3(simplex7_init,X5,X4) = init ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f85,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
fof(f86,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_3) ).
fof(f87,plain,
( ( ~ gt(loopcounter,n1)
| ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X3] :
( ~ leq(X3,minus(plus(n1,n2),n1))
| ~ leq(n0,X3)
| a_select2(s_center7_init,X3) = init )
& ! [X2] :
( ~ leq(X2,n3)
| ~ leq(n0,X2)
| a_select2(s_values7_init,X2) = init )
& ! [X0] :
( ~ leq(X0,n2)
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n3)
| ~ leq(n0,X1)
| a_select3(simplex7_init,X1,X0) = init ) )
& ( ( gt(loopcounter,n1)
& ( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init ) )
| ? [X7] :
( leq(X7,n2)
& leq(n0,X7)
& init != a_select2(s_center7_init,X7) )
| ? [X6] :
( leq(X6,n3)
& leq(n0,X6)
& init != a_select2(s_values7_init,X6) )
| ? [X4] :
( leq(X4,n2)
& leq(n0,X4)
& ? [X5] :
( leq(X5,n3)
& leq(n0,X5)
& init != a_select3(simplex7_init,X5,X4) ) ) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ( ~ gt(loopcounter,n1)
| ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X3] :
( ~ leq(X3,minus(plus(n1,n2),n1))
| ~ leq(n0,X3)
| a_select2(s_center7_init,X3) = init )
& ! [X2] :
( ~ leq(X2,n3)
| ~ leq(n0,X2)
| a_select2(s_values7_init,X2) = init )
& ! [X0] :
( ~ leq(X0,n2)
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n3)
| ~ leq(n0,X1)
| a_select3(simplex7_init,X1,X0) = init ) )
& ( ( gt(loopcounter,n1)
& ( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init ) )
| ? [X7] :
( leq(X7,n2)
& leq(n0,X7)
& init != a_select2(s_center7_init,X7) )
| ? [X6] :
( leq(X6,n3)
& leq(n0,X6)
& init != a_select2(s_values7_init,X6) )
| ? [X4] :
( leq(X4,n2)
& leq(n0,X4)
& ? [X5] :
( leq(X5,n3)
& leq(n0,X5)
& init != a_select3(simplex7_init,X5,X4) ) ) ) ),
inference(flattening,[],[f87]) ).
fof(f114,plain,
( ~ sP1
| ? [X7] :
( leq(X7,n2)
& leq(n0,X7)
& init != a_select2(s_center7_init,X7) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f115,plain,
( ~ sP1
| ? [X0] :
( leq(X0,n2)
& leq(n0,X0)
& init != a_select2(s_center7_init,X0) ) ),
inference(rectify,[],[f114]) ).
fof(f116,plain,
( ~ sP1
| ( leq(sK2,n2)
& leq(n0,sK2)
& init != a_select2(s_center7_init,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f115]) ).
fof(f120,plain,
( ( ~ gt(loopcounter,n1)
| ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X4] :
( ~ leq(X4,minus(plus(n1,n2),n1))
| ~ leq(n0,X4)
| init = a_select2(s_center7_init,X4) )
& ! [X3] :
( ~ leq(X3,n3)
| ~ leq(n0,X3)
| init = a_select2(s_values7_init,X3) )
& ! [X1] :
( ~ leq(X1,n2)
| ~ leq(n0,X1)
| ! [X2] :
( ~ leq(X2,n3)
| ~ leq(n0,X2)
| init = a_select3(simplex7_init,X2,X1) ) )
& ( ( gt(loopcounter,n1)
& ( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init ) )
| sP1
| ? [X0] :
( leq(X0,n3)
& leq(n0,X0)
& init != a_select2(s_values7_init,X0) )
| sP0 ) ),
inference(rectify,[],[f113]) ).
fof(f121,plain,
( ( ~ gt(loopcounter,n1)
| ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X4] :
( ~ leq(X4,minus(plus(n1,n2),n1))
| ~ leq(n0,X4)
| init = a_select2(s_center7_init,X4) )
& ! [X3] :
( ~ leq(X3,n3)
| ~ leq(n0,X3)
| init = a_select2(s_values7_init,X3) )
& ! [X1] :
( ~ leq(X1,n2)
| ~ leq(n0,X1)
| ! [X2] :
( ~ leq(X2,n3)
| ~ leq(n0,X2)
| init = a_select3(simplex7_init,X2,X1) ) )
& ( ( gt(loopcounter,n1)
& ( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init ) )
| sP1
| ( leq(sK5,n3)
& leq(n0,sK5)
& init != a_select2(s_values7_init,sK5) )
| sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f120]) ).
fof(f125,plain,
( ~ sP1
| leq(sK2,n2) ),
inference(cnf_transformation,[],[f116]) ).
fof(f126,plain,
( ~ sP1
| leq(n0,sK2) ),
inference(cnf_transformation,[],[f116]) ).
fof(f127,plain,
( ~ sP1
| init != a_select2(s_center7_init,sK2) ),
inference(cnf_transformation,[],[f116]) ).
fof(f133,plain,
( ~ gt(loopcounter,n1)
| init = pvar1402_init ),
inference(cnf_transformation,[],[f121]) ).
fof(f134,plain,
( ~ gt(loopcounter,n1)
| init = pvar1401_init ),
inference(cnf_transformation,[],[f121]) ).
fof(f135,plain,
( ~ gt(loopcounter,n1)
| init = pvar1400_init ),
inference(cnf_transformation,[],[f121]) ).
fof(f136,plain,
! [X4] :
( ~ leq(X4,minus(plus(n1,n2),n1))
| ~ leq(n0,X4)
| init = a_select2(s_center7_init,X4) ),
inference(cnf_transformation,[],[f121]) ).
fof(f137,plain,
! [X3] :
( ~ leq(X3,n3)
| ~ leq(n0,X3)
| init = a_select2(s_values7_init,X3) ),
inference(cnf_transformation,[],[f121]) ).
fof(f138,plain,
! [X2,X1] :
( ~ leq(X1,n2)
| ~ leq(n0,X1)
| ~ leq(X2,n3)
| ~ leq(n0,X2)
| init = a_select3(simplex7_init,X2,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f139,plain,
( gt(loopcounter,n1)
| sP1
| leq(sK5,n3)
| sP0 ),
inference(cnf_transformation,[],[f121]) ).
fof(f140,plain,
( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init
| sP1
| leq(sK5,n3)
| sP0 ),
inference(cnf_transformation,[],[f121]) ).
fof(f141,plain,
( gt(loopcounter,n1)
| sP1
| leq(n0,sK5)
| sP0 ),
inference(cnf_transformation,[],[f121]) ).
fof(f142,plain,
( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init
| sP1
| leq(n0,sK5)
| sP0 ),
inference(cnf_transformation,[],[f121]) ).
fof(f143,plain,
( gt(loopcounter,n1)
| sP1
| init != a_select2(s_values7_init,sK5)
| sP0 ),
inference(cnf_transformation,[],[f121]) ).
fof(f144,plain,
( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init
| sP1
| init != a_select2(s_values7_init,sK5)
| sP0 ),
inference(cnf_transformation,[],[f121]) ).
fof(f160,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f169,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f179,plain,
n2 = succ(succ(n0)),
inference(cnf_transformation,[],[f85]) ).
fof(f185,plain,
n3 = succ(succ(succ(n0))),
inference(cnf_transformation,[],[f86]) ).
fof(f191,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f205,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f215,plain,
n1 = plus(n1,n0),
inference(definition_unfolding,[],[f160,f169]) ).
fof(f225,plain,
n2 = plus(n1,plus(n1,n0)),
inference(definition_unfolding,[],[f179,f169,f169]) ).
fof(f226,plain,
n3 = plus(n1,plus(n1,plus(n1,n0))),
inference(definition_unfolding,[],[f185,f169,f169,f169]) ).
fof(f231,plain,
! [X0] : minus(plus(n1,X0),n1) = X0,
inference(definition_unfolding,[],[f205,f191,f169]) ).
tcf(c_49,plain,
( ~ sP1
| ( a_select2(s_center7_init,sK2) != init ) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_50,plain,
( leq(n0,sK2)
| ~ sP1 ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_51,plain,
( leq(sK2,n2)
| ~ sP1 ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_57,negated_conjecture,
( sP0
| sP1
| ( init != pvar1402_init )
| ( init != pvar1401_init )
| ( init != pvar1400_init )
| ( a_select2(s_values7_init,sK5) != init ) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_58,negated_conjecture,
( sP0
| sP1
| gt(loopcounter,n1)
| ( a_select2(s_values7_init,sK5) != init ) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_59,negated_conjecture,
( sP0
| sP1
| leq(n0,sK5)
| ( init != pvar1402_init )
| ( init != pvar1401_init )
| ( init != pvar1400_init ) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_60,negated_conjecture,
( sP0
| sP1
| gt(loopcounter,n1)
| leq(n0,sK5) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_61,negated_conjecture,
( sP0
| sP1
| leq(sK5,n3)
| ( init != pvar1402_init )
| ( init != pvar1401_init )
| ( init != pvar1400_init ) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_62,negated_conjecture,
( sP0
| sP1
| gt(loopcounter,n1)
| leq(sK5,n3) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_63,negated_conjecture,
! [X0: $i,X1: $i] :
( ( a_select3(simplex7_init,X0,X1) = init )
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| ~ leq(X1,n2)
| ~ leq(X0,n3) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_64,negated_conjecture,
! [X0: $i] :
( ( a_select2(s_values7_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n3) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] :
( ( a_select2(s_center7_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,minus(plus(n1,n2),n1)) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_66,negated_conjecture,
( ( init = pvar1400_init )
| ~ gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_67,negated_conjecture,
( ( init = pvar1401_init )
| ~ gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_68,negated_conjecture,
( ( init = pvar1402_init )
| ~ gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_84,plain,
plus(n1,n0) = n1,
inference(cnf_transformation,[],[f215]) ).
tcf(c_102,plain,
plus(n1,plus(n1,n0)) = n2,
inference(cnf_transformation,[],[f225]) ).
tcf(c_108,plain,
plus(n1,plus(n1,plus(n1,n0))) = n3,
inference(cnf_transformation,[],[f226]) ).
tcf(c_127,plain,
! [X0: $i] : minus(plus(n1,X0),n1) = X0,
inference(cnf_transformation,[],[f231]) ).
tcf(c_159,negated_conjecture,
( sP0
| sP1
| leq(sK5,n3) ),
inference(global_subsumption_just,[status(thm)],[c_62,c_68,c_67,c_66,c_62,c_61]) ).
tcf(c_161,negated_conjecture,
( sP0
| sP1
| leq(n0,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_60,c_68,c_67,c_66,c_60,c_59]) ).
tcf(c_163,negated_conjecture,
( sP0
| sP1
| ( a_select2(s_values7_init,sK5) != init ) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_68,c_67,c_66,c_58,c_57]) ).
tcf(c_167,negated_conjecture,
( sP0
| sP1
| leq(n0,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_59,c_161]) ).
tcf(c_686,plain,
plus(n1,n1) = n2,
inference(light_normalisation,[status(thm)],[c_102,c_84]) ).
tcf(c_737,plain,
plus(n1,n2) = n3,
inference(light_normalisation,[status(thm)],[c_108,c_84,c_686]) ).
tcf(c_802,plain,
! [X0: $i] :
( ( a_select2(s_center7_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,minus(n3,n1)) ),
inference(light_normalisation,[status(thm)],[c_65,c_737]) ).
tcf(c_3346,plain,
( sP0
| sP1
| ( a_select2(s_values7_init,sK5) = init )
| ~ leq(sK5,n3) ),
inference(superposition,[status(thm)],[c_167,c_64]) ).
tcf(c_3382,plain,
( sP0
| sP1 ),
inference(global_subsumption_just,[status(thm)],[c_3346,c_159,c_163,c_3346]) ).
tcf(c_3662,plain,
minus(n3,n1) = n2,
inference(superposition,[status(thm)],[c_737,c_127]) ).
tcf(c_3671,plain,
! [X0: $i] :
( ( a_select2(s_center7_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n2) ),
inference(demodulation,[status(thm)],[c_802,c_3662]) ).
fof(f111,definition,
( ~ sP0
| ? [X4] :
( leq(X4,n2)
& leq(n0,X4)
& ? [X5] :
( leq(X5,n3)
& leq(n0,X5)
& init != a_select3(simplex7_init,X5,X4) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f112,definition,
( ~ sP1
| ? [X7] :
( leq(X7,n2)
& leq(n0,X7)
& init != a_select2(s_center7_init,X7) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f113,plain,
( ( ~ gt(loopcounter,n1)
| ( pvar1402_init = init
& pvar1401_init = init
& pvar1400_init = init ) )
& ! [X3] :
( ~ leq(X3,minus(plus(n1,n2),n1))
| ~ leq(n0,X3)
| a_select2(s_center7_init,X3) = init )
& ! [X2] :
( ~ leq(X2,n3)
| ~ leq(n0,X2)
| a_select2(s_values7_init,X2) = init )
& ! [X0] :
( ~ leq(X0,n2)
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n3)
| ~ leq(n0,X1)
| a_select3(simplex7_init,X1,X0) = init ) )
& ( ( gt(loopcounter,n1)
& ( init != pvar1402_init
| init != pvar1401_init
| init != pvar1400_init ) )
| sP1
| ? [X6] :
( leq(X6,n3)
& leq(n0,X6)
& init != a_select2(s_values7_init,X6) )
| sP0 ) ),
inference(definition_folding,[],[f88,f112,f111]) ).
fof(f117,plain,
( ~ sP0
| ? [X4] :
( leq(X4,n2)
& leq(n0,X4)
& ? [X5] :
( leq(X5,n3)
& leq(n0,X5)
& init != a_select3(simplex7_init,X5,X4) ) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f118,plain,
( ~ sP0
| ? [X0] :
( leq(X0,n2)
& leq(n0,X0)
& ? [X1] :
( leq(X1,n3)
& leq(n0,X1)
& a_select3(simplex7_init,X1,X0) != init ) ) ),
inference(rectify,[],[f117]) ).
fof(f119,plain,
( ~ sP0
| ( leq(sK3,n2)
& leq(n0,sK3)
& leq(sK4,n3)
& leq(n0,sK4)
& init != a_select3(simplex7_init,sK4,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f118]) ).
fof(f128,plain,
( ~ sP0
| leq(sK3,n2) ),
inference(cnf_transformation,[],[f119]) ).
fof(f129,plain,
( ~ sP0
| leq(n0,sK3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f130,plain,
( ~ sP0
| leq(sK4,n3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f131,plain,
( ~ sP0
| leq(n0,sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f132,plain,
( ~ sP0
| init != a_select3(simplex7_init,sK4,sK3) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_52,plain,
( ~ sP0
| ( a_select3(simplex7_init,sK4,sK3) != init ) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_53,plain,
( leq(n0,sK4)
| ~ sP0 ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_54,plain,
( leq(sK4,n3)
| ~ sP0 ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_55,plain,
( leq(n0,sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_56,plain,
( leq(sK3,n2)
| ~ sP0 ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_3456,plain,
! [X0: $i] :
( ( a_select3(simplex7_init,sK4,X0) = init )
| ~ sP0
| ~ leq(sK4,n3)
| ~ leq(n0,X0)
| ~ leq(X0,n2) ),
inference(superposition,[status(thm)],[c_53,c_63]) ).
tcf(c_3480,plain,
! [X0: $i] :
( ( a_select3(simplex7_init,sK3,X0) = init )
| ~ sP0
| ~ leq(sK3,n3)
| ~ leq(n0,X0)
| ~ leq(X0,n2) ),
inference(superposition,[status(thm)],[c_55,c_63]) ).
tcf(c_3548,plain,
! [X0: $i] :
( ( a_select3(simplex7_init,sK4,X0) = init )
| ~ sP0
| ~ leq(X0,n2)
| ~ leq(n0,X0) ),
inference(global_subsumption_just,[status(thm)],[c_3456,c_54,c_3456]) ).
tcf(c_3549,plain,
! [X0: $i] :
( ( a_select3(simplex7_init,sK4,X0) = init )
| ~ sP0
| ~ leq(n0,X0)
| ~ leq(X0,n2) ),
inference(renaming,[status(thm)],[c_3548]) ).
tcf(c_3561,plain,
( ( a_select3(simplex7_init,sK4,sK3) = init )
| ~ sP0
| ~ leq(sK3,n2) ),
inference(superposition,[status(thm)],[c_55,c_3549]) ).
tcf(c_3576,plain,
~ sP0,
inference(global_subsumption_just,[status(thm)],[c_3480,c_56,c_52,c_3561]) ).
tcf(c_3578,plain,
sP1,
inference(backward_subsumption_resolution,[status(thm)],[c_3382,c_3576]) ).
tcf(c_3581,plain,
leq(sK2,n2),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_3578]) ).
tcf(c_3582,plain,
leq(n0,sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_3578]) ).
tcf(c_3679,plain,
a_select2(s_center7_init,sK2) != init,
inference(global_subsumption_just,[status(thm)],[c_49,c_56,c_49,c_52,c_3382,c_3561]) ).
tcf(c_3697,plain,
( ( a_select2(s_center7_init,sK2) = init )
| ~ leq(sK2,n2) ),
inference(superposition,[status(thm)],[c_3582,c_3671]) ).
tcf(c_3703,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3697,c_3679,c_3581]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV042+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 18:22:53 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 2.65/1.21 % SZS status Started for theBenchmark.p
% 2.65/1.21 % SZS status Theorem for theBenchmark.p
% 2.65/1.21
% 2.65/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.65/1.21
% 2.65/1.21 % ------ iProver source info
% 2.65/1.21
% 2.65/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 2.65/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.65/1.21 % git: non_committed_changes: false
% 2.65/1.21
% 2.65/1.21 % ------ Parsing...
% 2.65/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.65/1.21
% 2.65/1.21 % ------ Preprocessing... sup_sim: 11 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.65/1.21
% 2.65/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.65/1.21
% 2.65/1.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.65/1.21 % ------ Proving...
% 2.65/1.21 % ------ Problem Properties
% 2.65/1.21
% 2.65/1.21 %
% 2.65/1.21 % clauses 78
% 2.65/1.21 % conjectures 8
% 2.65/1.21 % EPR 45
% 2.65/1.21 % Horn 68
% 2.65/1.21 % unary 41
% 2.65/1.21 % binary 21
% 2.65/1.21 % lits 148
% 2.65/1.21 % lits eq 49
% 2.65/1.21 % fd_pure 0
% 2.65/1.21 % fd_pseudo 0
% 2.65/1.21 % fd_cond 6
% 2.65/1.21 % fd_pseudo_cond 2
% 2.65/1.21 % AC symbols 0
% 2.65/1.21
% 2.65/1.21 % ------ Schedule dynamic 5 is on
% 2.65/1.21
% 2.65/1.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.65/1.21
% 2.65/1.21
% 2.65/1.21 % ------
% 2.65/1.21 % Current options:
% 2.65/1.21 % ------
% 2.65/1.21
% 2.65/1.21
% 2.65/1.21 %
% 2.65/1.21
% 2.65/1.21 % ------ Proving...
% 2.65/1.21 %
% 2.65/1.21
% 2.65/1.21 % SZS status Theorem for theBenchmark.p
% 2.65/1.21
% 2.65/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.65/1.21
%------------------------------------------------------------------------------