%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ARI575_1 : TPTP v9.3.1. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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 12:58:25 PM UTC 2026
% Result : Theorem 3.30s 1.79s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 26
% Syntax : Number of formulae : 102 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 229 ( 105 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 170 ( 43 ~; 91 |; 33 &)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 556 ( 123 atm; 150 fun; 181 num; 102 var)
% Number of types : 2 ( 0 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 3 usr; 11 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn 93 !; 9 ?; 102 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
tff(func_def_11,type,
sK0: $int ).
tff(func_def_12,type,
sK1: $int ).
tff(func_def_13,type,
sK2: $int ).
tff(f1,conjecture,
! [X0: $int,X1: $int,X2: $int] :
( ( $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
& $less(X1,X2)
& $less(X0,X1)
& $less(3,X0) )
<=> ( ( X2 = 6 )
& ( X1 = 5 )
& ( X0 = 4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ineq_sys_has_1_int_sol) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int,X2: $int] :
( ( $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
& $less(X1,X2)
& $less(X0,X1)
& $less(3,X0) )
<=> ( ( X2 = 6 )
& ( X1 = 5 )
& ( X0 = 4 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f4,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f5,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f6,plain,
! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f7,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f8,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f10,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f11,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f13,plain,
! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f14,plain,
! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f15,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$product(X1,X2)) = $product($product(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f16,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f17,plain,
! [X0: $int] : ( 0 = $product(X0,0) ),
introduced(definition,[],[tha_times_zero]) ).
tff(f18,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
introduced(definition,[],[tha_distributivity]) ).
tff(f19,plain,
! [X2: $int,X3: $int,X0: $int,X1: $int] :
( ( X2 = X3 )
| ( $product(X0,X3) != X1 )
| ( $product(X0,X2) != X1 )
| ( 0 = X0 ) ),
introduced(definition,[],[tha_divisibility]) ).
tff(f20,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_extra_integer_ordering]) ).
tff(f21,plain,
? [X0: $int,X1: $int,X2: $int] :
( ( $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
& $less(X1,X2)
& $less(X0,X1)
& $less(3,X0) )
<~> ( ( X2 = 6 )
& ( X1 = 5 )
& ( X0 = 4 ) ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f22,plain,
? [X0: $int,X1: $int,X2: $int] :
( ( ( $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
& $less(X1,X2)
& $less(X0,X1)
& $less(3,X0) )
| ( ( X2 = 6 )
& ( X1 = 5 )
& ( X0 = 4 ) ) )
& ( ~ $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
| ~ $less(X1,X2)
| ~ $less(X0,X1)
| ~ $less(3,X0)
| ( 6 != X2 )
| ( 5 != X1 )
| ( 4 != X0 ) ) ),
inference(nnf_transformation,[],[f21]) ).
tff(f23,plain,
? [X0: $int,X1: $int,X2: $int] :
( ( ( $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
& $less(X1,X2)
& $less(X0,X1)
& $less(3,X0) )
| ( ( X2 = 6 )
& ( X1 = 5 )
& ( X0 = 4 ) ) )
& ( ~ $less($sum($sum(X0,$product(2,X1)),$product(3,X2)),35)
| ~ $less(X1,X2)
| ~ $less(X0,X1)
| ~ $less(3,X0)
| ( 6 != X2 )
| ( 5 != X1 )
| ( 4 != X0 ) ) ),
inference(flattening,[],[f22]) ).
tff(f24,plain,
( ( ( $less($sum($sum(sK0,$product(2,sK1)),$product(3,sK2)),35)
& $less(sK1,sK2)
& $less(sK0,sK1)
& $less(3,sK0) )
| ( ( 6 = sK2 )
& ( 5 = sK1 )
& ( 4 = sK0 ) ) )
& ( ~ $less($sum($sum(sK0,$product(2,sK1)),$product(3,sK2)),35)
| ~ $less(sK1,sK2)
| ~ $less(sK0,sK1)
| ~ $less(3,sK0)
| ( 6 != sK2 )
| ( 5 != sK1 )
| ( 4 != sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f23]) ).
tff(f25,plain,
( $less($sum($sum(sK0,$product(2,sK1)),$product(3,sK2)),35)
| ( 6 = sK2 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f26,plain,
( $less(sK1,sK2)
| ( 6 = sK2 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f27,plain,
( $less(sK0,sK1)
| ( 6 = sK2 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f28,plain,
( $less(3,sK0)
| ( 6 = sK2 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f29,plain,
( $less($sum($sum(sK0,$product(2,sK1)),$product(3,sK2)),35)
| ( 5 = sK1 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f30,plain,
( $less(sK1,sK2)
| ( 5 = sK1 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f31,plain,
( $less(sK0,sK1)
| ( 5 = sK1 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f32,plain,
( $less(3,sK0)
| ( 5 = sK1 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f34,plain,
( $less(sK1,sK2)
| ( 4 = sK0 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f35,plain,
( $less(sK0,sK1)
| ( 4 = sK0 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f36,plain,
( $less(3,sK0)
| ( 4 = sK0 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f38,plain,
! [X2: $int,X3: $int,X0: $int] :
( ( X2 = X3 )
| ( $product(X0,X2) != $product(X0,X3) )
| ( 0 = X0 ) ),
inference(equality_resolution,[],[f19]) ).
tcf(c_49,negated_conjecture,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X1_int,X0_int)
| ~ $less(X0_int,$sum(X1_int,1)) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_50,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ( X1_int = X2_int )
| ( X0_int = 0 )
| ( $product(X0_int,X1_int) != $product(X0_int,X2_int) ) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_51,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] : $sum($product(X0_int,X1_int),$product(X0_int,X2_int)) = $product(X0_int,$sum(X1_int,X2_int)),
inference(cnf_transformation,[],[f18]) ).
tcf(c_52,negated_conjecture,
! [X0_int: $int] : $product(X0_int,0) = 0,
inference(cnf_transformation,[],[f17]) ).
tcf(c_53,negated_conjecture,
! [X0_int: $int] : $product(X0_int,1) = X0_int,
inference(cnf_transformation,[],[f16]) ).
tcf(c_54,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] : $product($product(X0_int,X1_int),X2_int) = $product(X0_int,$product(X1_int,X2_int)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $product(X0_int,X1_int) = $product(X1_int,X0_int),
inference(cnf_transformation,[],[f14]) ).
tcf(c_56,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f13]) ).
tcf(c_57,negated_conjecture,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_58,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( $less($sum(X0_int,X2_int),$sum(X1_int,X2_int))
| ~ $less(X0_int,X1_int) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_59,negated_conjecture,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,X1_int)
| ( X0_int = X1_int ) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_60,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( $less(X0_int,X2_int)
| ~ $less(X1_int,X2_int)
| ~ $less(X0_int,X1_int) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_61,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f8]) ).
tcf(c_62,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
inference(cnf_transformation,[],[f7]) ).
tcf(c_63,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum($uminus(X0_int),$uminus(X1_int)) = $uminus($sum(X1_int,X0_int)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,0) = X0_int,
inference(cnf_transformation,[],[f5]) ).
tcf(c_65,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] : $sum($sum(X0_int,X1_int),X2_int) = $sum(X0_int,$sum(X1_int,X2_int)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_66,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
inference(cnf_transformation,[],[f3]) ).
tcf(c_68,negated_conjecture,
( $less(3,sK0)
| ( sK0 = 4 ) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_69,negated_conjecture,
( $less(sK0,sK1)
| ( sK0 = 4 ) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_70,negated_conjecture,
( $less(sK1,sK2)
| ( sK0 = 4 ) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_72,negated_conjecture,
( $less(3,sK0)
| ( sK1 = 5 ) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_73,negated_conjecture,
( $less(sK0,sK1)
| ( sK1 = 5 ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_74,negated_conjecture,
( $less(sK1,sK2)
| ( sK1 = 5 ) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_75,negated_conjecture,
( $less($sum($sum(sK0,$product(2,sK1)),$product(3,sK2)),35)
| ( sK1 = 5 ) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_76,negated_conjecture,
( $less(3,sK0)
| ( sK2 = 6 ) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_77,negated_conjecture,
( $less(sK0,sK1)
| ( sK2 = 6 ) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_78,negated_conjecture,
( $less(sK1,sK2)
| ( sK2 = 6 ) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_79,negated_conjecture,
( $less($sum($sum(sK0,$product(2,sK1)),$product(3,sK2)),35)
| ( sK2 = 6 ) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_80,plain,
$less(0,1),
theory(arith) ).
tcf(c_81,plain,
$less(1,2),
theory(arith) ).
tcf(c_82,plain,
$less(2,3),
theory(arith) ).
tcf(c_83,plain,
$less(3,4),
theory(arith) ).
tcf(c_84,plain,
$less(4,5),
theory(arith) ).
tcf(c_85,plain,
$less(5,6),
theory(arith) ).
tcf(c_86,plain,
$less(6,35),
theory(arith) ).
tcf(c_104,negated_conjecture,
( $less($sum(sK0,$sum($product(sK1,2),$product(sK2,3))),35)
| ( sK1 = 5 ) ),
inference(theory_normalisation,[status(thm)],[c_75,c_54,c_55,c_65,c_66]) ).
tcf(c_105,negated_conjecture,
( $less($sum(sK0,$sum($product(sK1,2),$product(sK2,3))),35)
| ( sK2 = 6 ) ),
inference(theory_normalisation,[status(thm)],[c_79,c_54,c_55,c_65,c_66]) ).
tcf(c_106,plain,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X0_int,$sum(X1_int,1))
| ~ $less(X1_int,X0_int) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
tcf(c_107,plain,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X1_int,X0_int)
| ~ $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_106]) ).
tcf(c_108,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X0_int,$sum(X1_int,1))
| $less(X1_int,X0_int) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_109,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_108]) ).
tcf(c_110,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( $less($sum(X0_int,X2_int),$sum(X1_int,X2_int))
| ~ $less(X0_int,X1_int) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_112,plain,
( ( sK0 = 4 )
| $less(3,sK0) ),
inference(prop_impl_just,[status(thm)],[c_68]) ).
tcf(c_113,plain,
( $less(3,sK0)
| ( sK0 = 4 ) ),
inference(renaming,[status(thm)],[c_112]) ).
tcf(c_114,plain,
( ( sK1 = 5 )
| $less(3,sK0) ),
inference(prop_impl_just,[status(thm)],[c_72]) ).
tcf(c_115,plain,
( $less(3,sK0)
| ( sK1 = 5 ) ),
inference(renaming,[status(thm)],[c_114]) ).
tcf(c_116,plain,
( ( sK2 = 6 )
| $less(3,sK0) ),
inference(prop_impl_just,[status(thm)],[c_76]) ).
tcf(c_117,plain,
( $less(3,sK0)
| ( sK2 = 6 ) ),
inference(renaming,[status(thm)],[c_116]) ).
tcf(c_118,plain,
( ( sK0 = 4 )
| $less(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_69]) ).
tcf(c_119,plain,
( $less(sK0,sK1)
| ( sK0 = 4 ) ),
inference(renaming,[status(thm)],[c_118]) ).
tcf(c_120,plain,
( ( sK1 = 5 )
| $less(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_73]) ).
tcf(c_121,plain,
( $less(sK0,sK1)
| ( sK1 = 5 ) ),
inference(renaming,[status(thm)],[c_120]) ).
tcf(c_122,plain,
( ( sK2 = 6 )
| $less(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_77]) ).
tcf(c_123,plain,
( $less(sK0,sK1)
| ( sK2 = 6 ) ),
inference(renaming,[status(thm)],[c_122]) ).
tcf(c_124,plain,
( ( sK0 = 4 )
| $less(sK1,sK2) ),
inference(prop_impl_just,[status(thm)],[c_70]) ).
tcf(c_125,plain,
( $less(sK1,sK2)
| ( sK0 = 4 ) ),
inference(renaming,[status(thm)],[c_124]) ).
tcf(c_126,plain,
( ( sK1 = 5 )
| $less(sK1,sK2) ),
inference(prop_impl_just,[status(thm)],[c_74]) ).
tcf(c_127,plain,
( $less(sK1,sK2)
| ( sK1 = 5 ) ),
inference(renaming,[status(thm)],[c_126]) ).
tcf(c_128,plain,
( ( sK2 = 6 )
| $less(sK1,sK2) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
tcf(c_129,plain,
( $less(sK1,sK2)
| ( sK2 = 6 ) ),
inference(renaming,[status(thm)],[c_128]) ).
tcf(c_144,plain,
( $less($sum(sK0,$sum($product(sK1,2),$product(sK2,3))),35)
| ( sK1 = 5 ) ),
inference(prop_impl_just,[status(thm)],[c_104]) ).
tcf(c_152,plain,
( $less($sum(sK0,$sum($product(sK1,2),$product(sK2,3))),35)
| ( sK2 = 6 ) ),
inference(prop_impl_just,[status(thm)],[c_105]) ).
tcf(c_352,plain,
$less(sK1,sK2),
inference(global_subsumption_just,[status(thm)],[c_125]) ).
tcf(c_373,plain,
$less($sum(sK0,$sum($product(sK1,2),$product(sK2,3))),35),
inference(global_subsumption_just,[status(thm)],[c_144]) ).
tcf(c_385,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_373,c_352,c_152,c_86,c_85,c_84,c_83,c_82,c_81,c_80,c_129,c_123,c_117,c_127,c_121,c_115,c_119,c_113,c_66,c_65,c_64,c_63,c_62,c_61,c_60,c_59,c_110,c_109,c_56,c_55,c_54,c_53,c_52,c_51,c_50,c_107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI575_1 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 06:16:03 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running TFA theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 3.30/1.79 % SZS status Started for theBenchmark.p
% 3.30/1.79 ERROR - "ProverProcess:heur/schedule_none:304.99997901916504" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 3.30/1.79 Fatal error: exception Failure("undefined enum value")
% 3.30/1.79 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --schedule none --sub_typing false --suppress_sat_res true --tptp_safe_out true --stats_out none --out_options none --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 101.67 --show_fool true" --time_out_real 305.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/tw7rjkwo 2>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/tw7rjkwo_error
% 3.30/1.79 ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 3.30/1.79 Fatal error: exception Failure("undefined enum value")
% 3.30/1.79 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 0 --comb_sup_mult 6 --conj_cone_tolerance 1.8969679945890683 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 512 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 3.67 --show_fool true" --time_out_real 11.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/rzyrt7fj 2>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/rzyrt7fj_error
% 3.30/1.79 ERROR - "ProverProcess:heur/vip_65097:3.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 3.30/1.79 Fatal error: exception Failure("undefined enum value")
% 3.30/1.79 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 3 --comb_sup_deep_mult 0 --comb_sup_mult 0 --conj_cone_tolerance 4.0357851670394345 --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 2048 --inst_lit_activity_flag true --inst_lit_sel "[+split;-sign;-depth]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type queue --inst_passive_queues "[[+age;+num_lits;-age];[-age;-min_def_symb;+bc_imp_inh]]" --inst_passive_queues_freq "[2;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 1.0 --inst_solver_per_active 1024 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+split;-ground;-depth]" --inst_start_prop_sim_after_learn 3 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --prep_sup_sim_all true --prep_sup_sim_sup false --preprocessed_out false --preprocessing_flag true --prolific_symb_bound 256 --proof_out true --prop_solver_per_cl 16384 --resolution_flag true --schedule none --share_sel_clauses false --stats_out none --subs_bck_mult 8 --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 3.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/1dwmgdv8 2>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/1dwmgdv8_error
% 3.30/1.79 ERROR - "ProverProcess:heur/vip_65080:40.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 3.30/1.79 Fatal error: exception Failure("undefined enum value")
% 3.30/1.79 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 4 --comb_sup_mult 6 --conj_cone_tolerance 1.895766803319499 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_pos_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 128 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_iter_deepening 2 --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 13.33 --show_fool true" --time_out_real 40.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/6nl9jmx0 2>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/6nl9jmx0_error
% 3.30/1.79 ERROR - "ProverProcess:heur/vip_66020:200.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 3.30/1.79 Fatal error: exception Failure("undefined enum value")
% 3.30/1.79 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 16 --comb_mode time_based --comb_res_mult 3 --comb_sup_deep_mult 1 --comb_sup_mult 0 --conj_cone_tolerance 2.250068292082666 --demod_completeness_check fastold --demod_use_ground true --extra_neg_conj none --inst_activity_threshold 16 --inst_dismatching false --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 3 --inst_learning_loop_flag true --inst_learning_start 32 --inst_lit_activity_flag false --inst_lit_sel "[+ground;+num_var]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type queue --inst_passive_queues "[[-num_lits;-has_eq]]" --inst_passive_queues_freq "[512]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 0.13028534399813618 --inst_solver_per_active 4096 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[+non_prol_conj_symb;-depth;-non_prol_conj_symb;+non_prol_conj_symb;+eq]" --inst_start_prop_sim_after_learn 7 --inst_subs_given false --inst_subs_new true --inst_to_smt_solver false --instantiation_flag true --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 128 --proof_out true --prop_solver_per_cl 512 --res_to_smt_solver true --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 8 --sup_bw_gjoin_interval 10000 --sup_cache_sim none --sup_full_bw "[]" --sup_full_fixpoint true --sup_full_fw "[Subsumption;SubsumptionRes;FullSubsAndRes;ACJoinability;Connectedness]" --sup_fun_splitting false --sup_immed_bw_immed "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;Demod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[SubsumptionRes;UnitSubsAndRes;Demod;ACDemod;GroundJoinability;Connectedness]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint true --sup_iter_deepening 2 --sup_main_fixpoint true --sup_ordering kbo --sup_passive_queue_type queue --sup_passive_queues "[[-min_def_symb;+reachable_state;-age];[-epr];[+horn;-reachable_state;-num_var]]" --sup_passive_queues_freq "[2;5;15]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 12 --sup_score sim --sup_share_max_num_cl 80 --sup_share_score_frac 0.1 --sup_smt_interval 16384 --sup_symb_ordering random --sup_term_weight default --sup_to_prop_solver none --sup_unprocessed_bound 1000 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 66.67 --show_fool true" --time_out_real 200.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/5mxh8dkf 2>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/5mxh8dkf_error
% 3.30/1.79 ERROR - "ProverProcess:heur/vip_65511:44.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 3.30/1.79 Fatal error: exception Failure("undefined enum value")
% 3.30/1.79 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 2 --comb_mode clause_based --comb_sup_deep_mult 3 --comb_sup_mult 0 --conj_cone_tolerance 3.378762210374529 --demod_completeness_check full --demod_use_ground false --extra_neg_conj all_pos --inst_activity_threshold 4 --inst_dismatching false --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 6 --inst_learning_loop_flag true --inst_learning_start 8192 --inst_lit_activity_flag true --inst_lit_sel "[-conj_symb;-conj_symb;+conj_symb;+num_var;-non_prol_conj_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type queue --inst_passive_queues "[[-has_eq;-conj_dist];[+ground;-min_def_symb]]" --inst_passive_queues_freq "[5;3]" --inst_prop_sim_given true --inst_prop_sim_new true --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.60162165485836 --inst_solver_per_active 1024 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[-conj_symb;-num_symb;+num_var;-eq;+num_var]" --inst_start_prop_sim_after_learn 9 --inst_subs_given false --inst_subs_new true --inst_to_smt_solver false --instantiation_flag true --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 16384 --proof_out true --prop_solver_per_cl 128 --resolution_flag false --schedule none --share_sel_clauses false --stats_out none --subs_bck_mult 4 --sup_bw_gjoin_interval 1000 --sup_cache_sim none --sup_full_bw "[]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;Demod;ACJoinability;Connectedness]" --sup_immed_fw_main "[]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;Subsumption;FwDemod;BwDemod;LightNorm;FwACDemod;BwACDemod;SMTIncr;SMTSet;BwGjoin]" --sup_input_fixpoint true --sup_iter_deepening 8 --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type queue --sup_passive_queues "[[+next_state;-horn;-epr];[+max_atom_input_occur];[-num_lits;-num_lits]]" --sup_passive_queues_freq "[2;1;5]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 16 --sup_smt_interval 8192 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver none --sup_unprocessed_bound 10000 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 14.67 --show_fool true" --time_out_real 44.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/x9_5e4lp 2>> /export/starexec/sandbox/tmp/iprover_out_hnpgs10p/x9_5e4lp_error
% 3.30/1.79 % SZS status Theorem for theBenchmark.p
% 3.30/1.79
% 3.30/1.79 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.30/1.79
% 3.30/1.79 % ------ iProver source info
% 3.30/1.79
% 3.30/1.79 % git: date: 2026-07-19 20:42:38 +0200
% 3.30/1.79 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.30/1.79 % git: non_committed_changes: false
% 3.30/1.79
% 3.30/1.79 % ------ Parsing...
% 3.30/1.79 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.30/1.79
% 3.30/1.79 % ------ Preprocessing...%
% 3.30/1.79
% 3.30/1.79 % SZS status Theorem for theBenchmark.p
% 3.30/1.79
% 3.30/1.79 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/1.79
% 3.30/1.79
%------------------------------------------------------------------------------