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 : n009.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:20:11 CDT 2018 0.02/0.23 % CPUTime : 0.07/0.25 0.07/0.25 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% 0.07/0.25 0.07/0.25 %---------------- SAT mode ----------------% 0.07/0.25 0.07/0.25 Input problem: /export/starexec/sandbox/benchmark/theBenchmark.p 0.07/0.25 0.07/0.25 Solving is in progress....... 13.18/3.60 13.18/3.60 %---------------- iProver v2.8 (CASC-J9) ----------------% 13.18/3.60 13.18/3.60 warning: prop_lit_to_fof_flag: true 13.18/3.60 warning: use_rec_defs_flag: true 13.18/3.60 warning: def_merge_tr_red_non_prop_flag: true 13.18/3.60 warning: finite_models commented: preprocess_after_flattening 13.18/3.60 warning: pred_elim_qbf: true 13.18/3.60 warning: dbg_qbf_res_prep_flag: true 13.18/3.60 13.18/3.60 ------ iProver source info 13.18/3.60 13.18/3.60 git: date: 2018-07-06 14:03:16 +0100 13.18/3.60 git: sha1: a23ae0111c2c203083e5922e8bb09a201cc5ec4f 13.18/3.60 git: non_committed_changes: false 13.18/3.60 git: last_make_outside_of_git: false 13.18/3.60 13.18/3.60 13.18/3.60 ------ Parsing... 13.18/3.60 ------ Clausification by vclausify_rel & Parsing by iProver... 13.18/3.60 13.18/3.60 ------ Preprocessing... sf_s rm: 6 0s sf_e pe_s pe_e sf_s rm: 2 0s sf_e pe_s pe_e 13.18/3.60 13.18/3.60 ------ Preprocessing... scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e 13.18/3.60 13.18/3.60 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 13.18/3.60 ------ Proving... 13.18/3.60 ------ Problem Properties 13.18/3.60 13.18/3.60 13.18/3.60 clauses 25 13.18/3.60 conjectures 0 13.18/3.60 EPR 8 13.18/3.60 Horn 24 13.18/3.60 unary 8 13.18/3.60 binary 5 13.18/3.60 lits 61 13.18/3.60 lits eq 33 13.18/3.60 13.18/3.60 ------ Input Options Time Limit: Unbounded 13.18/3.60 13.18/3.60 13.18/3.60 ------ Finite Models: 13.18/3.60 13.18/3.60 ------ lit_activity_flag true 13.18/3.60 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 1 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 2 13.18/3.60 ------ Current options: 13.18/3.60 13.18/3.60 13.18/3.60 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 2 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 2 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 2 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 3 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 3 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 3 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 4 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 ------ Trying domains of size >= : 4 13.18/3.60 13.18/3.60 13.18/3.60 ------ Proving... 13.18/3.60 13.18/3.60 13.18/3.60 % SZS status CounterSatisfiable 13.18/3.60 13.18/3.60 ------ Building Model...Done 13.18/3.60 13.18/3.60 %------ The model is defined over ground terms (initial term algebra). 13.18/3.60 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 13.18/3.60 %------ where \phi is a formula over the term algebra. 13.18/3.60 %------ If we have equality in the problem then it is also defined as a predicate above, 13.18/3.60 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type 13.18/3.60 %------ See help for --sat_out_model for different model outputs. 13.18/3.60 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" 13.18/3.60 %------ where the first argument stands for the sort ($i in the unsorted case) 13.18/3.60 13.18/3.60 13.18/3.60 % SZS output start Model 13.18/3.60 13.18/3.60 13.18/3.60 %------ Positive definition of equality_sorted 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X0,X1] : 13.18/3.60 ( equality_sorted(X0,X0,X1) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=$o & X1=X0 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_plus_0_$i ) 13.18/3.60 & 13.18/3.60 ( X0!=iProver_Domain_iProver_plus_0_$i_1 | X1!=iProver_Domain_iProver_plus_0_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X0!=iProver_Domain_iProver_plus_0_$i_2 | X1!=iProver_Domain_iProver_plus_0_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_le_2_$i & X0=iProver_Domain_iProver_le_2_$i_1 & X1=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_le_2_$i & X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of queens_q 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 ( queens_q <=> 13.18/3.60 $false 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of queens_p 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 ( queens_p <=> 13.18/3.60 $true 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of le 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X1] : 13.18/3.60 ( le(X0,X1) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X1=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_3 & X1=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_3 & X1=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of lt 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X1] : 13.18/3.60 ( lt(X0,X1) <=> 13.18/3.60 $false 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_n 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0] : 13.18/3.60 ( iProver_Flat_n(X0) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_s 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X1] : 13.18/3.60 ( iProver_Flat_s(X0,X1) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X1=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_3 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_4 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_sK0 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0] : 13.18/3.60 ( iProver_Flat_sK0(X0) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_minus 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X1,X2] : 13.18/3.60 ( iProver_Flat_minus(X0,X1,X2) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 | X2!=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 | X2!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 | X2!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_3 | X2!=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_3 | X2!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_4 | X2!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X2!=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X2!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X2!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X1=iProver_Domain_iProver_le_2_$i_2 & X2=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X1=iProver_Domain_iProver_le_2_$i_3 & X2=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X1=iProver_Domain_iProver_le_2_$i_3 & X2=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X2=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 & X2=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X2!=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X2!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X2!=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_2 & X2=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_2 & X2=iProver_Domain_iProver_le_2_$i_3 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_4 & X2=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 & X2=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_4 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_p 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X1] : 13.18/3.60 ( iProver_Flat_p(X0,X1) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_3 & X1=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_4 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_plus 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0,X0,X1] : 13.18/3.60 ( iProver_Flat_plus(X0,X0,X1) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_plus_0_$i_1 & X0=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_plus_0_$i_1 & X0=iProver_Domain_iProver_le_2_$i_4 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_plus_0_$i_1 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X0!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X0!=iProver_Domain_iProver_le_2_$i_4 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_plus_0_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X0!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X0!=iProver_Domain_iProver_le_2_$i_4 | X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 & 13.18/3.60 ( X1!=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 | 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_plus_0_$i_2 & X0=iProver_Domain_iProver_le_2_$i_2 & X1=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_sK1 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0] : 13.18/3.60 ( iProver_Flat_sK1(X0) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_1 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 %------ Positive definition of iProver_Flat_n0 13.18/3.60 fof(lit_def,axiom, 13.18/3.60 (! [X0] : 13.18/3.60 ( iProver_Flat_n0(X0) <=> 13.18/3.60 ( 13.18/3.60 ( 13.18/3.60 ( X0=iProver_Domain_iProver_le_2_$i_2 ) 13.18/3.60 ) 13.18/3.60 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ) 13.18/3.60 ). 13.18/3.60 13.18/3.60 13.18/3.60 % SZS output end Model 13.18/3.60 13.18/3.60 ------ Statistics 13.18/3.60 13.18/3.60 ------ General 13.18/3.60 13.18/3.60 abstr_arg_filter_cycles: 0 13.18/3.60 gc_basic_clause_elim: 0 13.18/3.60 forced_gc_time: 0 13.18/3.60 parsing_time: 0.005 13.18/3.60 unif_index_cands_time: 0.091 13.18/3.60 unif_index_add_time: 0.038 13.18/3.60 out_proof_time: 0. 13.18/3.60 total_time: 3.315 13.18/3.60 num_of_symbols: 79 13.18/3.60 num_of_terms: 2831 13.18/3.60 13.18/3.60 ------ Preprocessing 13.18/3.60 13.18/3.60 num_of_splits: 0 13.18/3.60 num_of_split_atoms: 0 13.18/3.60 num_of_reused_defs: 0 13.18/3.60 num_eq_ax_congr_red: 0 13.18/3.60 num_of_sem_filtered_clauses: 5 13.18/3.60 num_of_subtypes: 2 13.18/3.60 monotx_restored_types: 0 13.18/3.60 sat_num_of_epr_types: 0 13.18/3.60 sat_num_of_non_cyclic_types: 1 13.18/3.60 sat_guarded_non_collapsed_types: 0 13.18/3.60 num_pure_diseq_elim: 0 13.18/3.60 simp_replaced_by: 0 13.18/3.60 res_preprocessed: 87 13.18/3.60 prep_upred: 0 13.18/3.60 prep_unflattend: 0 13.18/3.60 pred_elim_cands: 1 13.18/3.60 pred_elim: 0 13.18/3.60 pred_elim_cl: 0 13.18/3.60 pred_elim_cycles: 2 13.18/3.60 merged_defs: 0 13.18/3.60 merged_defs_ncl: 0 13.18/3.60 prep_cycles: 4 13.18/3.60 pred_elim_time: 0. 13.18/3.60 splitting_time: 0. 13.18/3.60 sem_filter_time: 0.002 13.18/3.60 monotx_time: 0. 13.18/3.60 subtype_inf_time: 0. 13.18/3.60 13.18/3.60 ------ Problem properties 13.18/3.60 13.18/3.60 clauses: 25 13.18/3.60 conjectures: 0 13.18/3.60 epr: 8 13.18/3.60 horn: 24 13.18/3.60 unary: 8 13.18/3.60 binary: 5 13.18/3.60 lits: 61 13.18/3.60 lits_eq: 33 13.18/3.60 13.18/3.60 ------ Propositional Solver 13.18/3.60 13.18/3.60 prop_solver_calls: 170 13.18/3.60 prop_fast_solver_calls: 446 13.18/3.60 prop_num_of_clauses: 17865 13.18/3.60 prop_preprocess_simplified: 47984 13.18/3.60 prop_fo_subsumed: 8 13.18/3.60 prop_solver_time: 0.024 13.18/3.60 prop_fast_solver_time: 0. 13.18/3.60 prop_unsat_core_time: 0.001 13.18/3.60 13.18/3.60 ------ QBF 13.18/3.60 13.18/3.60 qbf_q_res: 0 13.18/3.60 qbf_num_tautologies: 0 13.18/3.60 qbf_prep_cycles: 0 13.18/3.60 13.18/3.60 ------ BMC1 13.18/3.60 13.18/3.60 bmc1_current_bound: -1 13.18/3.60 bmc1_last_solved_bound: -1 13.18/3.60 bmc1_unsat_core_size: -1 13.18/3.60 bmc1_unsat_core_parents_size: -1 13.18/3.60 bmc1_merge_next_fun: 0 13.18/3.60 bmc1_unsat_core_clauses_time: 0. 13.18/3.60 13.18/3.60 ------ Instantiation 13.18/3.60 13.18/3.60 inst_num_of_clauses: 328 13.18/3.60 inst_num_in_passive: 0 13.18/3.60 inst_num_in_active: 14908 13.18/3.60 inst_num_in_unprocessed: 0 13.18/3.60 inst_num_of_loops: 25884 13.18/3.60 inst_num_of_learning_restarts: 4 13.18/3.60 inst_num_moves_active_passive: 10822 13.18/3.60 inst_lit_activity: 0 13.18/3.60 inst_lit_activity_moves: 0 13.18/3.60 inst_num_tautologies: 0 13.18/3.60 inst_num_prop_implied: 0 13.18/3.60 inst_num_existing_simplified: 0 13.18/3.60 inst_num_eq_res_simplified: 0 13.18/3.60 inst_num_child_elim: 0 13.18/3.60 inst_num_of_dismatching_blockings: 9667 13.18/3.60 inst_num_of_non_proper_insts: 28115 13.18/3.60 inst_num_of_duplicates: 41793 13.18/3.60 inst_inst_num_from_inst_to_res: 0 13.18/3.60 inst_dismatching_checking_time: 0.052 13.18/3.60 13.18/3.60 ------ Resolution 13.18/3.60 13.18/3.60 res_num_of_clauses: 0 13.18/3.60 res_num_in_passive: 0 13.18/3.60 res_num_in_active: 0 13.18/3.60 res_num_of_loops: 91 13.18/3.60 res_forward_subset_subsumed: 1125 13.18/3.60 res_backward_subset_subsumed: 0 13.18/3.60 res_forward_subsumed: 0 13.18/3.60 res_backward_subsumed: 0 13.18/3.60 res_forward_subsumption_resolution: 0 13.18/3.60 res_backward_subsumption_resolution: 0 13.18/3.60 res_clause_to_clause_subsumption: 0 13.18/3.60 res_orphan_elimination: 0 13.18/3.60 res_tautology_del: 552 13.18/3.60 res_num_eq_res_simplified: 0 13.18/3.60 res_num_sel_changes: 0 13.18/3.60 res_moves_from_active_to_pass: 0 13.18/3.60 13.42/3.65 /export/starexec/sandbox/solver/bin/iprover_sat_single.sh: line 74: 11917 Killed "$PROVER" $1 --time_out_real $2 $INP >> $3 2> /dev/null 13.42/3.67 /export/starexec/sandbox/solver/bin/iprover_sat_single.sh: line 74: 11914 Killed "$PROVER" $1 --time_out_real $2 $INP >> $3 2> /dev/null 13.42/3.70 /export/starexec/sandbox/solver/bin/iprover_sat_single.sh: line 74: 11920 Killed "$PROVER" $1 --time_out_real $2 $INP >> $3 2> /dev/null 13.42/3.70 USED TIME: 13.57 CPU 3.46 WC 13.42/3.71 EOF