%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP776+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.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 01:35:23 PM UTC 2026
% Result : Theorem 85.74s 12.50s
% Output : CNFRefutation 85.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 20
% Syntax : Number of formulae : 115 ( 47 unt; 5 def)
% Number of atoms : 296 ( 92 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 167 ( 80 ~; 72 |; 6 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 82 !; 1 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( g(X0)
=> g(inv(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos02) ).
fof(f3,axiom,
g(eh),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos03) ).
fof(f5,axiom,
! [X0] :
( g(X0)
=> product(eh,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos05) ).
fof(f7,axiom,
! [X0] :
( g(X0)
=> product(X0,inv(X0)) = eh ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos07) ).
fof(f10,axiom,
! [X0,X1] :
( h(X1)
=> h(opp(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos10) ).
fof(f11,axiom,
h(eg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos11) ).
fof(f12,axiom,
! [X0,X1,X2] :
( ( h(X0)
& h(X1)
& h(X2) )
=> sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos12) ).
fof(f13,axiom,
! [X0] :
( h(X0)
=> sum(eg,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos13) ).
fof(f14,axiom,
! [X0] :
( h(X0)
=> sum(X0,eg) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos14) ).
fof(f16,axiom,
! [X0] :
( h(X0)
=> sum(opp(X0),X0) = eg ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos16) ).
fof(f17,axiom,
! [X0] :
( g(X0)
=> h(f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos17) ).
fof(f18,axiom,
! [X0,X1] : f(product(X1,X0)) = sum(f(X1),f(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos18) ).
fof(f19,conjecture,
! [X0] :
( ( f(inv(X0)) = opp(f(X0))
| ~ g(X0) )
& f(eh) = eg ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ( f(inv(X0)) = opp(f(X0))
| ~ g(X0) )
& f(eh) = eg ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f23,plain,
! [X0] :
( ~ g(X0)
| g(inv(X0)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f26,plain,
! [X0] :
( ~ g(X0)
| product(eh,X0) = X0 ),
inference(ennf_transformation,[],[f5]) ).
fof(f28,plain,
! [X0] :
( ~ g(X0)
| product(X0,inv(X0)) = eh ),
inference(ennf_transformation,[],[f7]) ).
fof(f32,plain,
! [X0,X1] :
( ~ h(X1)
| h(opp(X0)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ h(X0)
| ~ h(X1)
| ~ h(X2)
| sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ h(X0)
| ~ h(X1)
| ~ h(X2)
| sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0)) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0] :
( ~ h(X0)
| sum(eg,X0) = X0 ),
inference(ennf_transformation,[],[f13]) ).
fof(f36,plain,
! [X0] :
( ~ h(X0)
| sum(X0,eg) = X0 ),
inference(ennf_transformation,[],[f14]) ).
fof(f38,plain,
! [X0] :
( ~ h(X0)
| sum(opp(X0),X0) = eg ),
inference(ennf_transformation,[],[f16]) ).
fof(f39,plain,
! [X0] :
( ~ g(X0)
| h(f(X0)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f40,plain,
? [X0] :
( ( f(inv(X0)) != opp(f(X0))
& g(X0) )
| eg != f(eh) ),
inference(ennf_transformation,[],[f20]) ).
fof(f41,plain,
( ( f(inv(sK0)) != opp(f(sK0))
& g(sK0) )
| eg != f(eh) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f40]) ).
fof(f43,plain,
! [X0] :
( ~ g(X0)
| g(inv(X0)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
g(eh),
inference(cnf_transformation,[],[f3]) ).
fof(f46,plain,
! [X0] :
( ~ g(X0)
| product(eh,X0) = X0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0] :
( ~ g(X0)
| eh = product(X0,inv(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f51,plain,
! [X0,X1] :
( ~ h(X1)
| h(opp(X0)) ),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
h(eg),
inference(cnf_transformation,[],[f11]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ h(X0)
| ~ h(X1)
| ~ h(X2)
| sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f54,plain,
! [X0] :
( ~ h(X0)
| sum(eg,X0) = X0 ),
inference(cnf_transformation,[],[f35]) ).
fof(f55,plain,
! [X0] :
( ~ h(X0)
| sum(X0,eg) = X0 ),
inference(cnf_transformation,[],[f36]) ).
fof(f57,plain,
! [X0] :
( ~ h(X0)
| eg = sum(opp(X0),X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f58,plain,
! [X0] :
( ~ g(X0)
| h(f(X0)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f59,plain,
! [X0,X1] : f(product(X1,X0)) = sum(f(X1),f(X0)),
inference(cnf_transformation,[],[f18]) ).
fof(f60,plain,
( f(inv(sK0)) != opp(f(sK0))
| eg != f(eh) ),
inference(cnf_transformation,[],[f41]) ).
fof(f61,plain,
( g(sK0)
| eg != f(eh) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_50,plain,
! [X0: $i] :
( g(inv(X0))
| ~ g(X0) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_51,plain,
g(eh),
inference(cnf_transformation,[],[f44]) ).
tcf(c_53,plain,
! [X0: $i] :
( ( product(eh,X0) = X0 )
| ~ g(X0) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_55,plain,
! [X0: $i] :
( ( product(X0,inv(X0)) = eh )
| ~ g(X0) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( h(opp(X1))
| ~ h(X0) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_59,plain,
h(eg),
inference(cnf_transformation,[],[f52]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sum(sum(X2,X0),X1) = sum(X2,sum(X0,X1)) )
| ~ h(X2)
| ~ h(X1)
| ~ h(X0) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_61,plain,
! [X0: $i] :
( ( sum(eg,X0) = X0 )
| ~ h(X0) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_62,plain,
! [X0: $i] :
( ( sum(X0,eg) = X0 )
| ~ h(X0) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_64,plain,
! [X0: $i] :
( ( sum(opp(X0),X0) = eg )
| ~ h(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_65,plain,
! [X0: $i] :
( h(f(X0))
| ~ g(X0) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] : sum(f(X0),f(X1)) = f(product(X0,X1)),
inference(cnf_transformation,[],[f59]) ).
tcf(c_67,negated_conjecture,
( g(sK0)
| ( f(eh) != eg ) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_68,negated_conjecture,
( ( f(eh) != eg )
| ( opp(f(sK0)) != f(inv(sK0)) ) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_258,plain,
! [X0: $i] :
( ~ iPr_def_10
| h(opp(X0)) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_58]) ).
tcf(c_259,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ h(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_58]) ).
tcf(c_260,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_58]) ).
tcf(c_261,definition,
iPr_def_12 = f(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_262,definition,
iPr_def_13 = opp(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_263,definition,
iPr_def_14 = inv(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_264,definition,
iPr_def_15 = f(iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_265,definition,
iPr_def_16 = f(eh),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_266,negated_conjecture,
( ( iPr_def_16 != eg )
| ( iPr_def_13 != iPr_def_15 ) ),
inference(demodulation,[status(thm)],[c_68,c_265,c_263,c_264,c_261,c_262]) ).
tcf(c_267,negated_conjecture,
( g(sK0)
| ( iPr_def_16 != eg ) ),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_268,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_270,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_286,plain,
( ~ iPr_def_11
| ~ h(eg) ),
inference(instantiation,[status(thm)],[c_259]) ).
tcf(c_584,plain,
! [X0: $i] : h(opp(X0)),
inference(global_subsumption_just,[status(thm)],[c_258,c_59,c_258,c_286,c_260]) ).
tcf(c_604,plain,
( h(iPr_def_16)
| ~ g(eh) ),
inference(superposition,[status(thm)],[c_265,c_65]) ).
tcf(c_611,plain,
h(iPr_def_16),
inference(forward_subsumption_resolution,[status(thm)],[c_604,c_51]) ).
tcf(c_625,plain,
product(eh,eh) = eh,
inference(superposition,[status(thm)],[c_51,c_53]) ).
tcf(c_646,plain,
sum(eg,iPr_def_16) = iPr_def_16,
inference(superposition,[status(thm)],[c_611,c_61]) ).
tcf(c_794,plain,
sum(opp(iPr_def_16),iPr_def_16) = eg,
inference(superposition,[status(thm)],[c_611,c_64]) ).
tcf(c_809,plain,
! [X0: $i] : sum(iPr_def_16,f(X0)) = f(product(eh,X0)),
inference(superposition,[status(thm)],[c_265,c_66]) ).
tcf(c_830,plain,
! [X0: $i] :
( ( iPr_def_16 = eg )
| ( iPr_def_16 != X0 )
| ( eg != X0 ) ),
inference(instantiation,[status(thm)],[c_270]) ).
tcf(c_876,plain,
! [X0: $i,X1: $i] :
( ( sum(sum(X1,iPr_def_16),X0) = sum(X1,sum(iPr_def_16,X0)) )
| ~ h(X1)
| ~ h(X0) ),
inference(superposition,[status(thm)],[c_611,c_60]) ).
tcf(c_903,plain,
( ( iPr_def_16 = eg )
| ( iPr_def_16 != iPr_def_16 )
| ( eg != iPr_def_16 ) ),
inference(instantiation,[status(thm)],[c_830]) ).
tcf(c_904,plain,
iPr_def_16 = iPr_def_16,
inference(instantiation,[status(thm)],[c_268]) ).
tcf(c_915,plain,
sum(iPr_def_16,f(eh)) = f(eh),
inference(superposition,[status(thm)],[c_625,c_809]) ).
tcf(c_919,plain,
sum(iPr_def_16,iPr_def_16) = iPr_def_16,
inference(light_normalisation,[status(thm)],[c_915,c_265]) ).
tcf(c_124141,plain,
! [X0: $i] :
( ( sum(sum(X0,iPr_def_16),iPr_def_16) = sum(X0,sum(iPr_def_16,iPr_def_16)) )
| ~ h(X0) ),
inference(superposition,[status(thm)],[c_611,c_876]) ).
tcf(c_124465,plain,
! [X0: $i] :
( ( sum(sum(X0,iPr_def_16),iPr_def_16) = sum(X0,iPr_def_16) )
| ~ h(X0) ),
inference(light_normalisation,[status(thm)],[c_124141,c_919]) ).
tcf(c_126330,plain,
! [X0: $i] : sum(sum(opp(X0),iPr_def_16),iPr_def_16) = sum(opp(X0),iPr_def_16),
inference(superposition,[status(thm)],[c_584,c_124465]) ).
tcf(c_128004,plain,
sum(eg,iPr_def_16) = eg,
inference(superposition,[status(thm)],[c_794,c_126330]) ).
tcf(c_128008,plain,
eg = iPr_def_16,
inference(light_normalisation,[status(thm)],[c_128004,c_646]) ).
tcf(c_128192,plain,
( g(sK0)
| ( iPr_def_16 != iPr_def_16 ) ),
inference(demodulation,[status(thm)],[c_267,c_128008]) ).
tcf(c_128193,plain,
g(sK0),
inference(equality_resolution_simp,[status(thm)],[c_128192]) ).
tcf(c_133276,negated_conjecture,
g(sK0),
inference(global_subsumption_just,[status(thm)],[c_267,c_128193]) ).
tcf(c_133278,negated_conjecture,
iPr_def_13 != iPr_def_15,
inference(global_subsumption_just,[status(thm)],[c_266,c_266,c_903,c_904,c_128008]) ).
tcf(c_133283,plain,
! [X0: $i] : h(opp(X0)),
inference(global_subsumption_just,[status(thm)],[c_258,c_59,c_258,c_286,c_260]) ).
tcf(c_133287,plain,
h(iPr_def_13),
inference(superposition,[status(thm)],[c_262,c_133283]) ).
tcf(c_133290,plain,
( g(iPr_def_14)
| ~ g(sK0) ),
inference(superposition,[status(thm)],[c_263,c_50]) ).
tcf(c_133292,plain,
g(iPr_def_14),
inference(forward_subsumption_resolution,[status(thm)],[c_133290,c_133276]) ).
tcf(c_133298,plain,
( h(iPr_def_12)
| ~ g(sK0) ),
inference(superposition,[status(thm)],[c_261,c_65]) ).
tcf(c_133299,plain,
( h(iPr_def_15)
| ~ g(iPr_def_14) ),
inference(superposition,[status(thm)],[c_264,c_65]) ).
tcf(c_133300,plain,
h(iPr_def_15),
inference(forward_subsumption_resolution,[status(thm)],[c_133299,c_133292]) ).
tcf(c_133301,plain,
h(iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_133298,c_133276]) ).
tcf(c_133334,plain,
! [X0: $i] :
( ( sum(iPr_def_16,X0) = X0 )
| ~ h(X0) ),
inference(light_normalisation,[status(thm)],[c_61,c_128008]) ).
tcf(c_133346,plain,
sum(iPr_def_16,iPr_def_15) = iPr_def_15,
inference(superposition,[status(thm)],[c_133300,c_133334]) ).
tcf(c_133349,plain,
! [X0: $i] :
( ( sum(X0,iPr_def_16) = X0 )
| ~ h(X0) ),
inference(light_normalisation,[status(thm)],[c_62,c_128008]) ).
tcf(c_133358,plain,
sum(iPr_def_13,iPr_def_16) = iPr_def_13,
inference(superposition,[status(thm)],[c_133287,c_133349]) ).
tcf(c_133397,plain,
product(sK0,inv(sK0)) = eh,
inference(superposition,[status(thm)],[c_133276,c_55]) ).
tcf(c_133399,plain,
product(sK0,iPr_def_14) = eh,
inference(light_normalisation,[status(thm)],[c_133397,c_263]) ).
tcf(c_133470,plain,
! [X0: $i] :
( ( sum(opp(X0),X0) = iPr_def_16 )
| ~ h(X0) ),
inference(light_normalisation,[status(thm)],[c_64,c_128008]) ).
tcf(c_133482,plain,
sum(opp(iPr_def_12),iPr_def_12) = iPr_def_16,
inference(superposition,[status(thm)],[c_133301,c_133470]) ).
tcf(c_133484,plain,
sum(iPr_def_13,iPr_def_12) = iPr_def_16,
inference(light_normalisation,[status(thm)],[c_133482,c_262]) ).
tcf(c_133521,plain,
! [X0: $i] : sum(iPr_def_12,f(X0)) = f(product(sK0,X0)),
inference(superposition,[status(thm)],[c_261,c_66]) ).
tcf(c_133583,plain,
! [X0: $i,X1: $i] :
( ( sum(sum(X1,iPr_def_12),X0) = sum(X1,sum(iPr_def_12,X0)) )
| ~ h(X1)
| ~ h(X0) ),
inference(superposition,[status(thm)],[c_133301,c_60]) ).
tcf(c_133632,plain,
sum(iPr_def_12,f(iPr_def_14)) = f(eh),
inference(superposition,[status(thm)],[c_133399,c_133521]) ).
tcf(c_133636,plain,
sum(iPr_def_12,iPr_def_15) = iPr_def_16,
inference(light_normalisation,[status(thm)],[c_133632,c_264,c_265]) ).
tcf(c_134987,plain,
! [X0: $i] :
( ( sum(sum(X0,iPr_def_12),iPr_def_15) = sum(X0,sum(iPr_def_12,iPr_def_15)) )
| ~ h(X0) ),
inference(superposition,[status(thm)],[c_133300,c_133583]) ).
tcf(c_134997,plain,
! [X0: $i] :
( ( sum(sum(X0,iPr_def_12),iPr_def_15) = sum(X0,iPr_def_16) )
| ~ h(X0) ),
inference(light_normalisation,[status(thm)],[c_134987,c_133636]) ).
tcf(c_142983,plain,
sum(sum(iPr_def_13,iPr_def_12),iPr_def_15) = sum(iPr_def_13,iPr_def_16),
inference(superposition,[status(thm)],[c_133287,c_134997]) ).
tcf(c_143017,plain,
iPr_def_13 = iPr_def_15,
inference(light_normalisation,[status(thm)],[c_142983,c_133358,c_133484,c_133346]) ).
tcf(c_143018,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_143017,c_133278]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP776+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 16:04:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 85.74/12.50 % SZS status Started for theBenchmark.p
% 85.74/12.50 ERROR - "ProverProcess:heur/379306:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Z3.Error("Sort mismatch at argument #1 for function (declare-fun f_97 (s_0) Bool) supplied sort is s_107")
% 85.74/12.50 Fatal error: exception Z3.Error("Sort mismatch at argument #1 for function (declare-fun f_97 (s_0) Bool) supplied sort is s_107")
% 85.74/12.50 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground false --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;ACNormalisation]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;Demod;LightNorm;ACNormalisation]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[]" --sup_input_bw "[SubsumptionRes]" --sup_input_fw "[SMTSubs;]" --sup_input_triv "[]" --sup_iter_deepening 1 --sup_passive_queue_type priority_queues --sup_passive_queues "[[+min_def_symb;-score;+epr];[-next_state;-conj_dist;+conj_symb]]" --sup_passive_queues_freq "[3;512]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 320 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.67" --time_out_real 2.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_otzqhyqg/3he8ki2a 2>> /export/starexec/sandbox2/tmp/iprover_out_otzqhyqg/3he8ki2a_error
% 85.74/12.50 % SZS status Theorem for theBenchmark.p
% 85.74/12.50
% 85.74/12.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 85.74/12.50
% 85.74/12.50 % ------ iProver source info
% 85.74/12.50
% 85.74/12.50 % git: date: 2026-07-19 20:42:38 +0200
% 85.74/12.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 85.74/12.50 % git: non_committed_changes: false
% 85.74/12.50
% 85.74/12.50 % ------ Parsing...
% 85.74/12.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 85.74/12.50
% 85.74/12.50 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 85.74/12.50
% 85.74/12.50 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 85.74/12.50
% 85.74/12.50 % ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 85.74/12.50 % ------ Proving...
% 85.74/12.50 % ------ Problem Properties
% 85.74/12.50
% 85.74/12.50 %
% 85.74/12.50 % clauses 27
% 85.74/12.50 % conjectures 2
% 85.74/12.50 % EPR 6
% 85.74/12.50 % Horn 26
% 85.74/12.50 % unary 8
% 85.74/12.50 % binary 15
% 85.74/12.50 % lits 52
% 85.74/12.50 % lits eq 19
% 85.74/12.50 % fd_pure 0
% 85.74/12.50 % fd_pseudo 0
% 85.74/12.50 % fd_cond 0
% 85.74/12.50 % fd_pseudo_cond 0
% 85.74/12.50 % AC symbols 0
% 85.74/12.50
% 85.74/12.50 % ------ Schedule dynamic 5 is on
% 85.74/12.50
% 85.74/12.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 85.74/12.50
% 85.74/12.50
% 85.74/12.50 % ------
% 85.74/12.50 % Current options:
% 85.74/12.50 % ------
% 85.74/12.50
% 85.74/12.50
% 85.74/12.50 %
% 85.74/12.50
% 85.74/12.50 % ------ Proving...
% 85.74/12.50 % Proof_search_loop: time out after: 4032 full_loop iterations
% 85.74/12.50
% 85.74/12.50 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 85.74/12.50
% 85.74/12.50
% 85.74/12.50 % ------
% 85.74/12.50 % Current options:
% 85.74/12.50 % ------
% 85.74/12.50
% 85.74/12.50
% 85.74/12.50 %
% 85.74/12.50
% 85.74/12.50 % ------ Proving...
% 85.74/12.50 %
% 85.74/12.50
% 85.74/12.50 % SZS status Theorem for theBenchmark.p
% 85.74/12.50
% 85.74/12.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 85.74/12.50
% 85.74/12.50
%------------------------------------------------------------------------------