0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : iproveropt_run_sat.sh %d %s 0.02/0.23 % Computer : n151.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:18:12 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.25 0.02/0.25 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% 0.02/0.25 0.02/0.25 %---------------- SAT mode ----------------% 0.02/0.25 0.02/0.25 Input problem: /export/starexec/sandbox/benchmark/theBenchmark.p 0.02/0.25 0.02/0.25 Solving is in progress....... 3.63/1.23 3.63/1.23 %---------------- iProver v2.8 (CASC-J9) ----------------% 3.63/1.23 3.63/1.23 warning: prop_lit_to_fof_flag: true 3.63/1.23 warning: use_rec_defs_flag: true 3.63/1.23 warning: def_merge_tr_red_non_prop_flag: true 3.63/1.23 warning: finite_models commented: preprocess_after_flattening 3.63/1.23 warning: pred_elim_qbf: true 3.63/1.23 warning: dbg_qbf_res_prep_flag: true 3.63/1.23 3.63/1.23 ------ iProver source info 3.63/1.23 3.63/1.23 git: date: 2018-07-06 14:03:16 +0100 3.63/1.23 git: sha1: a23ae0111c2c203083e5922e8bb09a201cc5ec4f 3.63/1.23 git: non_committed_changes: false 3.63/1.23 git: last_make_outside_of_git: false 3.63/1.23 3.63/1.23 3.63/1.23 ------ Parsing... 3.63/1.23 ------ Clausification by vclausify_rel & Parsing by iProver... 3.63/1.23 3.63/1.23 ------ Preprocessing... sf_s rm: 10184 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e 3.63/1.23 3.63/1.23 ------ Preprocessing... scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e 3.63/1.23 ------ Proving... 3.63/1.23 ------ Problem Properties 3.63/1.23 3.63/1.23 3.63/1.23 clauses 0 3.63/1.23 conjectures 0 3.63/1.23 EPR 0 3.63/1.23 Horn 0 3.63/1.23 unary 0 3.63/1.23 binary 0 3.63/1.23 lits 0 3.63/1.23 lits eq 0 3.63/1.23 3.63/1.23 ------ Input Options Time Limit: Unbounded 3.63/1.23 3.63/1.23 3.63/1.23 ------ Finite Models: 3.63/1.23 3.63/1.23 ------ lit_activity_flag true 3.63/1.23 3.63/1.23 ------ Current options: 3.63/1.23 3.63/1.23 3.63/1.23 3.63/1.23 3.63/1.23 3.63/1.23 ------ Proving... 3.63/1.23 3.63/1.23 3.63/1.23 % SZS status Satisfiable 3.63/1.23 3.63/1.23 ------ Building Model...Done 3.63/1.23 3.63/1.23 %------ The model is defined over ground terms (initial term algebra). 3.63/1.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 3.63/1.23 %------ where \phi is a formula over the term algebra. 3.63/1.23 %------ If we have equality in the problem then it is also defined as a predicate above, 3.63/1.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type 3.63/1.23 %------ See help for --sat_out_model for different model outputs. 3.63/1.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" 3.63/1.23 %------ where the first argument stands for the sort ($i in the unsorted case) 3.63/1.23 3.63/1.23 3.63/1.23 % SZS output start Model 3.63/1.23 3.63/1.23 3.63/1.23 %------ Negative definition of chea 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(chea(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of sub 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( sub(X0,X1) <=> 3.63/1.23 $true 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of hsit 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(hsit(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of aff 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( aff(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of subs 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( subs(X0,X1) <=> 3.63/1.23 $true 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of direct_subsort 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(direct_subsort(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of state_adjective_inhabitant_binding 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(state_adjective_inhabitant_binding(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of assoc 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(assoc(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of in 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( in(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of ort_adjektiv_ort 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(ort_adjektiv_ort(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of prop 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( prop(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of loc 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( loc(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of attr 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( attr(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of impl 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(impl(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of state_adjective_state_binding 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(state_adjective_state_binding(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of exp 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( exp(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of ctxt 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ctxt(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of agt 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( agt(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of distrib_obj 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(distrib_obj(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of obj 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( obj(X0,X1) <=> 3.63/1.23 $true 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of ornt 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ornt(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of sP0 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( sP0(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of preds 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( preds(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of pred 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( pred(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of scar 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( scar(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of attch 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( attch(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of scarrel 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(scarrel(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of agtrel 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(agtrel(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of itms 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1,X2] : 3.63/1.23 ( itms(X0,X1,X2) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of temporal_attribute 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(temporal_attribute(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of arg2 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(arg2(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of arg1 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(arg1(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of flp 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( flp(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of prop_p3 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1,X2] : 3.63/1.23 ( prop_p3(X0,X1,X2) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of member 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(member(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of subr 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(subr(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of sspe 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( sspe(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of temp 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( temp(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of unter 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( unter(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of partei_adj_partei 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(partei_adj_partei(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of rslt 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( rslt(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of purp 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(purp(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Negative definition of mcont 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( ~(mcont(X0,X1)) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of benf 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( benf(X0,X1) <=> 3.63/1.23 $true 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of name 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( name(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of subsort 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( subsort(X0,X1) <=> 3.63/1.23 $true 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of pmod 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1,X2] : 3.63/1.23 ( pmod(X0,X1,X2) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of circ 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( circ(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 %------ Positive definition of attch_1_obj_transfer 3.63/1.23 fof(lit_def,axiom, 3.63/1.23 (! [X0,X1] : 3.63/1.23 ( attch_1_obj_transfer(X0,X1) <=> 3.63/1.23 $false 3.63/1.23 ) 3.63/1.23 ) 3.63/1.23 ). 3.63/1.23 3.63/1.23 3.63/1.23 % SZS output end Model 3.63/1.23 3.63/1.23 ------ Statistics 3.63/1.23 3.63/1.23 ------ General 3.63/1.23 3.63/1.23 abstr_arg_filter_cycles: 0 3.63/1.23 gc_basic_clause_elim: 0 3.63/1.23 forced_gc_time: 0 3.63/1.23 parsing_time: 0.308 3.63/1.23 unif_index_cands_time: 0. 3.63/1.23 unif_index_add_time: 0. 3.63/1.23 out_proof_time: 0. 3.63/1.23 total_time: 0.913 3.63/1.23 num_of_symbols: 16549 3.63/1.23 num_of_terms: 38566 3.63/1.23 3.63/1.23 ------ Preprocessing 3.63/1.23 3.63/1.23 num_of_splits: 0 3.63/1.23 num_of_split_atoms: 0 3.63/1.23 num_of_reused_defs: 0 3.63/1.23 num_eq_ax_congr_red: 0 3.63/1.23 num_of_sem_filtered_clauses: 10184 3.63/1.23 num_of_subtypes: 0 3.63/1.23 monotx_restored_types: 0 3.63/1.23 sat_num_of_epr_types: 0 3.63/1.23 sat_num_of_non_cyclic_types: 0 3.63/1.23 sat_guarded_non_collapsed_types: 0 3.63/1.23 num_pure_diseq_elim: 0 3.63/1.23 simp_replaced_by: 0 3.63/1.23 res_preprocessed: 10184 3.63/1.23 prep_upred: 0 3.63/1.23 prep_unflattend: 0 3.63/1.23 pred_elim_cands: 0 3.63/1.23 pred_elim: 0 3.63/1.23 pred_elim_cl: 0 3.63/1.23 pred_elim_cycles: 0 3.63/1.23 merged_defs: 0 3.63/1.23 merged_defs_ncl: 0 3.63/1.23 prep_cycles: 2 3.63/1.23 pred_elim_time: 0. 3.63/1.23 splitting_time: 0. 3.63/1.23 sem_filter_time: 0.045 3.63/1.23 monotx_time: 0. 3.63/1.23 subtype_inf_time: 0. 3.63/1.23 3.63/1.23 ------ Problem properties 3.63/1.23 3.63/1.23 clauses: 0 3.63/1.23 conjectures: 0 3.63/1.23 epr: 0 3.63/1.23 horn: 0 3.63/1.23 unary: 0 3.63/1.23 binary: 0 3.63/1.23 lits: 0 3.63/1.23 lits_eq: 0 3.63/1.23 3.63/1.23 ------ Propositional Solver 3.63/1.23 3.63/1.23 prop_solver_calls: 12 3.63/1.23 prop_fast_solver_calls: 21878 3.63/1.23 prop_num_of_clauses: 10402 3.63/1.23 prop_preprocess_simplified: 62706 3.63/1.23 prop_fo_subsumed: 0 3.63/1.23 prop_solver_time: 0.001 3.63/1.23 prop_fast_solver_time: 0.009 3.63/1.23 prop_unsat_core_time: 0. 3.63/1.23 3.63/1.23 ------ QBF 3.63/1.23 3.63/1.23 qbf_q_res: 0 3.63/1.23 qbf_num_tautologies: 0 3.63/1.23 qbf_prep_cycles: 0 3.63/1.23 3.63/1.23 ------ BMC1 3.63/1.23 3.63/1.23 bmc1_current_bound: -1 3.63/1.23 bmc1_last_solved_bound: -1 3.63/1.23 bmc1_unsat_core_size: -1 3.63/1.23 bmc1_unsat_core_parents_size: -1 3.63/1.23 bmc1_merge_next_fun: 0 3.63/1.23 bmc1_unsat_core_clauses_time: 0. 3.63/1.23 3.63/1.23 ------ Instantiation 3.63/1.23 3.63/1.23 inst_num_of_clauses: 0 3.63/1.23 inst_num_in_passive: 0 3.63/1.23 inst_num_in_active: 0 3.63/1.23 inst_num_in_unprocessed: 0 3.63/1.23 inst_num_of_loops: 1 3.63/1.23 inst_num_of_learning_restarts: 0 3.63/1.23 inst_num_moves_active_passive: 0 3.63/1.23 inst_lit_activity: 0 3.63/1.23 inst_lit_activity_moves: 0 3.63/1.23 inst_num_tautologies: 0 3.63/1.23 inst_num_prop_implied: 0 3.63/1.23 inst_num_existing_simplified: 0 3.63/1.23 inst_num_eq_res_simplified: 0 3.63/1.23 inst_num_child_elim: 0 3.63/1.23 inst_num_of_dismatching_blockings: 0 3.63/1.23 inst_num_of_non_proper_insts: 0 3.63/1.23 inst_num_of_duplicates: 0 3.63/1.23 inst_inst_num_from_inst_to_res: 0 3.63/1.23 inst_dismatching_checking_time: 0. 3.63/1.23 3.63/1.23 ------ Resolution 3.63/1.23 3.63/1.23 res_num_of_clauses: 0 3.63/1.23 res_num_in_passive: 0 3.63/1.23 res_num_in_active: 0 3.63/1.23 res_num_of_loops: 10186 3.63/1.23 res_forward_subset_subsumed: 0 3.63/1.23 res_backward_subset_subsumed: 0 3.63/1.23 res_forward_subsumed: 0 3.63/1.23 res_backward_subsumed: 0 3.63/1.23 res_forward_subsumption_resolution: 0 3.63/1.23 res_backward_subsumption_resolution: 0 3.63/1.23 res_clause_to_clause_subsumption: 0 3.63/1.23 res_orphan_elimination: 0 3.63/1.23 res_tautology_del: 0 3.63/1.23 res_num_eq_res_simplified: 0 3.63/1.23 res_num_sel_changes: 0 3.63/1.23 res_moves_from_active_to_pass: 0 3.63/1.23 3.63/1.27 /export/starexec/sandbox/solver/bin/iprover_sat_single.sh: line 74: 41330 Killed "$PROVER" $1 --time_out_real $2 $INP >> $3 2> /dev/null 3.63/1.29 /export/starexec/sandbox/solver/bin/iprover_sat_single.sh: line 74: 41327 Killed "$PROVER" $1 --time_out_real $2 $INP >> $3 2> /dev/null 4.31/1.48 USED TIME: 4.33 CPU 1.23 WC 4.31/1.49 EOF