%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW652_2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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 03:30:07 PM UTC 2026
% Result : Theorem 0.38s 1.17s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 32
% Syntax : Number of formulae : 85 ( 59 unt; 0 typ; 0 def)
% Number of atoms : 174 ( 61 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 115 ( 39 ~; 25 |; 39 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number arithmetic : 272 ( 66 atm; 67 fun; 42 num; 97 var)
% Number of types : 4 ( 2 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 15 usr; 8 prp; 0-4 aty)
% Number of functors : 31 ( 26 usr; 10 con; 0-3 aty)
% Number of variables : 153 ( 0 sgn 129 !; 24 ?; 153 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
witness1: ty > uni ).
tff(pred_def_1,type,
sort1: ( uni * ty ) > $o ).
tff(func_def_2,type,
real: ty ).
tff(pred_def_3,type,
repr1: ( $int * ( $int * uf_pure1 ) ) > $o ).
tff(func_def_4,type,
true1: bool1 ).
tff(pred_def_5,type,
same1: ( $int * ( $int * uf_pure1 ) ) > $o ).
tff(pred_def_6,type,
same_reprs1: ( uf_pure1 * uf_pure1 ) > $o ).
tff(pred_def_7,type,
path1: ( $int * ( $int * graph1 ) ) > $o ).
tff(pred_def_8,type,
sP0: ( $int * ( $int * graph1 ) ) > $o ).
tff(pred_def_9,type,
sP1: ( $int * ( $int * graph1 ) ) > $o ).
tff(type_def_10,type,
uf1: $tType ).
tff(type_def_11,type,
graph1: $tType ).
tff(func_def_12,type,
ref: ty > ty ).
tff(func_def_13,type,
mk_ref: ( uni * ty ) > uni ).
tff(func_def_14,type,
contents: ( uni * ty ) > uni ).
tff(func_def_15,type,
uf_pure: ty ).
tff(func_def_16,type,
size1: uf_pure1 > $int ).
tff(func_def_17,type,
num1: uf_pure1 > $int ).
tff(func_def_19,type,
uf: ty ).
tff(func_def_20,type,
mk_uf1: uf_pure1 > uf1 ).
tff(func_def_21,type,
state1: uf1 > uf_pure1 ).
tff(func_def_22,type,
graph: ty ).
tff(func_def_25,type,
sK2: ( $int * uf_pure1 ) > $int ).
tff(func_def_26,type,
sK3: ( $int * ( $int * graph1 ) ) > graph1 ).
tff(func_def_27,type,
sK4: ( $int * ( $int * graph1 ) ) > $int ).
tff(func_def_28,type,
sK5: ( $int * ( $int * graph1 ) ) > $int ).
tff(func_def_29,type,
sK6: ( $int * ( $int * graph1 ) ) > graph1 ).
tff(func_def_30,type,
sK7: ( $int * ( $int * graph1 ) ) > $int ).
tff(func_def_31,type,
sK8: ( $int * ( $int * graph1 ) ) > $int ).
tff(func_def_32,type,
sK9: ( $int * ( $int * graph1 ) ) > $int ).
tff(func_def_33,type,
sK10: ( $int * ( $int * graph1 ) ) > graph1 ).
tff(func_def_34,type,
sK11: ( $int * ( $int * graph1 ) ) > $int ).
tff(func_def_35,type,
sK12: $int ).
tff(func_def_36,type,
sK13: $int ).
tff(func_def_37,type,
sK14: $int ).
tff(f1,axiom,
! [X0: ty] : sort1(X0,witness1(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',witness_sort1) ).
tff(f2,axiom,
! [X0: ty,X1: bool1,X2: uni,X3: uni] : sort1(X0,match_bool1(X0,X1,X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',match_bool_sort1) ).
tff(f5,axiom,
true1 != false1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',true_False) ).
tff(f6,axiom,
! [X0: bool1] :
( ( X0 = false1 )
| ( X0 = true1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bool_inversion) ).
tff(f7,axiom,
! [X0: tuple02] : ( X0 = tuple03 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tuple0_inversion) ).
tff(f9,axiom,
! [X0: ty,X1: uni] : sort1(ref(X0),mk_ref(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mk_ref_sort1) ).
tff(f10,axiom,
! [X0: ty,X1: uni] : sort1(X0,contents(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contents_sort1) ).
tff(f18,axiom,
! [X0: uf_pure1] : ( state1(mk_uf1(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_def1) ).
tff(f19,axiom,
! [X0: uf1] : ( X0 = mk_uf1(state1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uf_inversion1) ).
tff(f20,axiom,
! [X0: graph1,X1: $int] : path1(X0,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_refl) ).
tff(f21,axiom,
! [X0: graph1,X1: $int,X2: $int] :
( path1(X0,X1,X2)
=> path1(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_sym) ).
tff(f23,axiom,
! [X0: graph1,X1: $int,X2: $int] :
( path1(X0,X1,X2)
=> ( ? [X3: graph1,X4: $int,X5: $int,X6: $int] :
( ( X2 = X6 )
& ( X1 = X4 )
& ( X0 = X3 )
& path1(X3,X5,X6)
& path1(X3,X4,X5) )
| ? [X3: graph1,X4: $int,X5: $int] :
( ( X2 = X4 )
& ( X1 = X5 )
& ( X0 = X3 )
& path1(X3,X4,X5) )
| ? [X3: graph1,X4: $int] :
( ( X2 = X4 )
& ( X1 = X4 )
& ( X0 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_inversion) ).
tff(f24,conjecture,
! [X0: $int,X1: $int,X2: $int] :
( $lesseq(0,X0)
=> ( ( $less(X1,X0)
& $lesseq(0,X1) )
=> ( ( $less(X2,X0)
& $lesseq(0,X2) )
=> $less($sum($product(X1,X0),X2),$product(X0,X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ineq1) ).
tff(f25,negated_conjecture,
~ ! [X0: $int,X1: $int,X2: $int] :
( $lesseq(0,X0)
=> ( ( $less(X1,X0)
& $lesseq(0,X1) )
=> ( ( $less(X2,X0)
& $lesseq(0,X2) )
=> $less($sum($product(X1,X0),X2),$product(X0,X0)) ) ) ),
inference(negated_conjecture,[status(cth)],[f24]) ).
tff(f30,plain,
~ ! [X0: $int,X1: $int,X2: $int] :
( ~ $less(X0,0)
=> ( ( $less(X1,X0)
& ~ $less(X1,0) )
=> ( ( $less(X2,X0)
& ~ $less(X2,0) )
=> $less($sum($product(X1,X0),X2),$product(X0,X0)) ) ) ),
inference(theory_normalization,[],[f25]) ).
tff(f31,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f32,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f33,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f34,plain,
! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f35,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f36,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f37,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f38,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f39,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f40,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f41,plain,
! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f42,plain,
! [X0: $int,X1: $int] : ( $product(X1,X0) = $product(X0,X1) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f43,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$product(X1,X2)) = $product($product(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f44,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f45,plain,
! [X0: $int] : ( 0 = $product(X0,0) ),
introduced(definition,[],[tha_times_zero]) ).
tff(f46,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
introduced(definition,[],[tha_distributivity]) ).
tff(f47,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(f48,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_extra_integer_ordering]) ).
tff(f49,plain,
! [X0: graph1,X1: $int,X2: $int] :
( path1(X0,X1,X2)
=> ( ? [X8: graph1,X9: $int,X10: $int,X11: $int] :
( ( X2 = X11 )
& ( X1 = X9 )
& ( X0 = X8 )
& path1(X8,X10,X11)
& path1(X8,X9,X10) )
| ? [X5: graph1,X6: $int,X7: $int] :
( ( X2 = X6 )
& ( X1 = X7 )
& ( X0 = X5 )
& path1(X5,X6,X7) )
| ? [X3: graph1,X4: $int] :
( ( X2 = X4 )
& ( X1 = X4 )
& ( X0 = X3 ) ) ) ),
inference(rectify,[],[f23]) ).
tff(f64,plain,
! [X0: graph1,X1: $int,X2: $int] :
( ~ path1(X0,X1,X2)
| path1(X0,X2,X1) ),
inference(ennf_transformation,[],[f21]) ).
tff(f69,plain,
? [X0: $int,X1: $int,X2: $int] :
( ~ $less(X0,0)
& $less(X1,X0)
& ~ $less(X1,0)
& $less(X2,X0)
& ~ $less(X2,0)
& ~ $less($sum($product(X1,X0),X2),$product(X0,X0)) ),
inference(ennf_transformation,[],[f30]) ).
tff(f70,plain,
? [X0: $int,X1: $int,X2: $int] :
( ~ $less(X0,0)
& $less(X1,X0)
& ~ $less(X1,0)
& $less(X2,X0)
& ~ $less(X2,0)
& ~ $less($sum($product(X1,X0),X2),$product(X0,X0)) ),
inference(flattening,[],[f69]) ).
tff(f83,plain,
( ~ $less(sK12,0)
& $less(sK13,sK12)
& ~ $less(sK13,0)
& $less(sK14,sK12)
& ~ $less(sK14,0)
& ~ $less($sum($product(sK13,sK12),sK14),$product(sK12,sK12)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14]),skolemize(X0,sK12),skolemize(X1,sK13),skolemize(X2,sK14)],[f70]) ).
tff(f84,plain,
! [X0: ty] : sort1(X0,witness1(X0)),
inference(cnf_transformation,[],[f1]) ).
tff(f85,plain,
! [X2: uni,X3: uni,X0: ty,X1: bool1] : sort1(X0,match_bool1(X0,X1,X2,X3)),
inference(cnf_transformation,[],[f2]) ).
tff(f88,plain,
true1 != false1,
inference(cnf_transformation,[],[f5]) ).
tff(f89,plain,
! [X0: bool1] :
( ( false1 = X0 )
| ( true1 = X0 ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f90,plain,
! [X0: tuple02] : ( tuple03 = X0 ),
inference(cnf_transformation,[],[f7]) ).
tff(f92,plain,
! [X0: ty,X1: uni] : sort1(ref(X0),mk_ref(X0,X1)),
inference(cnf_transformation,[],[f9]) ).
tff(f93,plain,
! [X0: ty,X1: uni] : sort1(X0,contents(X0,X1)),
inference(cnf_transformation,[],[f10]) ).
tff(f103,plain,
! [X0: uf_pure1] : ( state1(mk_uf1(X0)) = X0 ),
inference(cnf_transformation,[],[f18]) ).
tff(f104,plain,
! [X0: uf1] : ( mk_uf1(state1(X0)) = X0 ),
inference(cnf_transformation,[],[f19]) ).
tff(f105,plain,
! [X0: graph1,X1: $int] : path1(X0,X1,X1),
inference(cnf_transformation,[],[f20]) ).
tff(f106,plain,
! [X2: $int,X0: graph1,X1: $int] :
( ~ path1(X0,X1,X2)
| path1(X0,X2,X1) ),
inference(cnf_transformation,[],[f64]) ).
tff(f120,plain,
~ $less(sK12,0),
inference(cnf_transformation,[],[f83]) ).
tff(f121,plain,
$less(sK13,sK12),
inference(cnf_transformation,[],[f83]) ).
tff(f122,plain,
~ $less(sK13,0),
inference(cnf_transformation,[],[f83]) ).
tff(f123,plain,
$less(sK14,sK12),
inference(cnf_transformation,[],[f83]) ).
tff(f124,plain,
~ $less(sK14,0),
inference(cnf_transformation,[],[f83]) ).
tcf(c_52,negated_conjecture,
! [X0_int: $int] : $product(X0_int,0) = 0,
inference(cnf_transformation,[],[f45]) ).
tcf(c_53,negated_conjecture,
! [X0_int: $int] : $product(X0_int,1) = X0_int,
inference(cnf_transformation,[],[f44]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $product(X0_int,X1_int) = $product(X1_int,X0_int),
inference(cnf_transformation,[],[f42]) ).
tcf(c_56,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f41]) ).
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,[],[f40]) ).
tcf(c_61,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f36]) ).
tcf(c_62,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
inference(cnf_transformation,[],[f35]) ).
tcf(c_64,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,0) = X0_int,
inference(cnf_transformation,[],[f33]) ).
tcf(c_66,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
inference(cnf_transformation,[],[f31]) ).
tcf(c_67,negated_conjecture,
! [X0_ty: ty] : sort1(X0_ty,witness1(X0_ty)),
inference(cnf_transformation,[],[f84]) ).
tcf(c_68,negated_conjecture,
! [X0_uni: uni,X0_ty: ty,X0_bool1: bool1,X1_uni: uni] : sort1(X0_ty,match_bool1(X0_ty,X0_bool1,X0_uni,X1_uni)),
inference(cnf_transformation,[],[f85]) ).
tcf(c_71,negated_conjecture,
true1 != false1,
inference(cnf_transformation,[],[f88]) ).
tcf(c_72,negated_conjecture,
! [X0_bool1: bool1] :
( ( X0_bool1 = false1 )
| ( X0_bool1 = true1 ) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_73,negated_conjecture,
! [X0_tuple02: tuple02] : X0_tuple02 = tuple03,
inference(cnf_transformation,[],[f90]) ).
tcf(c_75,negated_conjecture,
! [X0_uni: uni,X0_ty: ty] : sort1(ref(X0_ty),mk_ref(X0_ty,X0_uni)),
inference(cnf_transformation,[],[f92]) ).
tcf(c_76,negated_conjecture,
! [X0_uni: uni,X0_ty: ty] : sort1(X0_ty,contents(X0_ty,X0_uni)),
inference(cnf_transformation,[],[f93]) ).
tcf(c_86,negated_conjecture,
! [X0_uf_pure1: uf_pure1] : state1(mk_uf1(X0_uf_pure1)) = X0_uf_pure1,
inference(cnf_transformation,[],[f103]) ).
tcf(c_87,negated_conjecture,
! [X0_uf1: uf1] : mk_uf1(state1(X0_uf1)) = X0_uf1,
inference(cnf_transformation,[],[f104]) ).
tcf(c_88,negated_conjecture,
! [X0_int: $int,X0_graph1: graph1] : path1(X0_graph1,X0_int,X0_int),
inference(cnf_transformation,[],[f105]) ).
tcf(c_89,plain,
! [X0_int: $int,X0_graph1: graph1,X1_int: $int] :
( path1(X0_graph1,X1_int,X0_int)
| ~ path1(X0_graph1,X0_int,X1_int) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_104,negated_conjecture,
~ $less(sK14,0),
inference(cnf_transformation,[],[f124]) ).
tcf(c_105,negated_conjecture,
$less(sK14,sK12),
inference(cnf_transformation,[],[f123]) ).
tcf(c_106,negated_conjecture,
~ $less(sK13,0),
inference(cnf_transformation,[],[f122]) ).
tcf(c_107,negated_conjecture,
$less(sK13,sK12),
inference(cnf_transformation,[],[f121]) ).
tcf(c_108,negated_conjecture,
~ $less(sK12,0),
inference(cnf_transformation,[],[f120]) ).
tcf(c_109,plain,
$less(0,1),
theory(arith) ).
tcf(c_157,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_158,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_157]) ).
tcf(c_169,plain,
! [X0_int: $int,X0_graph1: graph1,X1_int: $int] :
( path1(X0_graph1,X1_int,X0_int)
| ~ path1(X0_graph1,X0_int,X1_int) ),
inference(prop_impl_just,[status(thm)],[c_89]) ).
tcf(c_191,plain,
! [X0_bool1: bool1] :
( ( X0_bool1 = false1 )
| ( X0_bool1 = true1 ) ),
inference(prop_impl_just,[status(thm)],[c_72]) ).
tcf(c_547,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_109,c_108,c_107,c_106,c_105,c_104,c_169,c_88,c_87,c_86,c_76,c_75,c_73,c_191,c_71,c_68,c_67,c_66,c_64,c_62,c_61,c_158,c_56,c_55,c_53,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW652_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 22:48:32 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running TFA theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 0.38/1.17 % SZS status Started for theBenchmark.p
% 0.38/1.17 ERROR - "ProverProcess:heur/schedule_none:304.99997901916504" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.38/1.17 Fatal error: exception Failure("undefined enum value")
% 0.38/1.17 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_e61nxkqy/8qmudlys 2>> /export/starexec/sandbox2/tmp/iprover_out_e61nxkqy/8qmudlys_error
% 0.38/1.17 % SZS status Theorem for theBenchmark.p
% 0.38/1.17
% 0.38/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.38/1.17
% 0.38/1.17 % ------ iProver source info
% 0.38/1.17
% 0.38/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 0.38/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.38/1.17 % git: non_committed_changes: false
% 0.38/1.17
% 0.38/1.17 % ------ Parsing...
% 0.38/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.38/1.17
% 0.38/1.17 % ------ Preprocessing...%
% 0.38/1.17
% 0.38/1.17 % SZS status Theorem for theBenchmark.p
% 0.38/1.17
% 0.38/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.38/1.17
% 0.38/1.17
%------------------------------------------------------------------------------