TSTP Solution File: KLE136+1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : KLE136+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 05:32:49 EDT 2023
% Result : CounterSatisfiable 18.24s 3.06s
% Output : Model 18.24s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of equality_sorted
fof(lit_def,axiom,
! [X0_12,X0,X1] :
( ~ equality_sorted(X0_12,X0,X1)
<=> ( ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_3 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_4 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_1 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3 ) ) ) ).
%------ Positive definition of iProver_Flat_addition
fof(lit_def_001,axiom,
! [X0,X1,X2] :
( iProver_Flat_addition(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_3 )
& X1 != iProver_Domain_i_2
& ( X1 != iProver_Domain_i_2
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_2
| X2 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X2 != iProver_Domain_i_3 )
& X1 != iProver_Domain_i_3
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_3 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_4 )
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_2
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3
& X2 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3
& X2 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_4
& X2 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X2 = iProver_Domain_i_3
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 ) ) ) ).
%------ Positive definition of iProver_Flat_zero
fof(lit_def_002,axiom,
! [X0] :
( iProver_Flat_zero(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_multiplication
fof(lit_def_003,axiom,
! [X0,X1,X2] :
( iProver_Flat_multiplication(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_4
& X1 != iProver_Domain_i_1
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_3 )
& ( X1 != iProver_Domain_i_2
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_2
| X2 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X2 != iProver_Domain_i_3 )
& X1 != iProver_Domain_i_3
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_3 )
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_3
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X2 = iProver_Domain_i_3
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 ) ) ) ).
%------ Positive definition of iProver_Flat_one
fof(lit_def_004,axiom,
! [X0] :
( iProver_Flat_one(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_antidomain
fof(lit_def_005,axiom,
! [X0,X1] :
( iProver_Flat_antidomain(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_coantidomain
fof(lit_def_006,axiom,
! [X0,X1] :
( iProver_Flat_coantidomain(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_divergence
fof(lit_def_007,axiom,
! [X0,X1] :
( iProver_Flat_divergence(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_3 ) ) ) ).
%------ Positive definition of iProver_Flat_star
fof(lit_def_008,axiom,
! [X0,X1] :
( iProver_Flat_star(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_3 ) ) ) ).
%------ Positive definition of iProver_Flat_sK0
fof(lit_def_009,axiom,
! [X0] :
( iProver_Flat_sK0(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK1
fof(lit_def_010,axiom,
! [X0] :
( iProver_Flat_sK1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE136+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_iprover %s %d SAT
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 12:06:13 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.16/0.44 Running model finding
% 0.16/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 18.24/3.06 % SZS status Started for theBenchmark.p
% 18.24/3.06 % SZS status CounterSatisfiable for theBenchmark.p
% 18.24/3.06
% 18.24/3.06 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 18.24/3.06
% 18.24/3.06 ------ iProver source info
% 18.24/3.06
% 18.24/3.06 git: date: 2023-05-31 18:12:56 +0000
% 18.24/3.06 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 18.24/3.06 git: non_committed_changes: false
% 18.24/3.06 git: last_make_outside_of_git: false
% 18.24/3.06
% 18.24/3.06 ------ Parsing...
% 18.24/3.06 ------ Clausification by vclausify_rel & Parsing by iProver...
% 18.24/3.06
% 18.24/3.06 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 18.24/3.06
% 18.24/3.06 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 18.24/3.06
% 18.24/3.06 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 18.24/3.06 ------ Proving...
% 18.24/3.06 ------ Problem Properties
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 clauses 22
% 18.24/3.06 conjectures 3
% 18.24/3.06 EPR 0
% 18.24/3.06 Horn 22
% 18.24/3.06 unary 21
% 18.24/3.06 binary 1
% 18.24/3.06 lits 23
% 18.24/3.06 lits eq 23
% 18.24/3.06 fd_pure 0
% 18.24/3.06 fd_pseudo 0
% 18.24/3.06 fd_cond 0
% 18.24/3.06 fd_pseudo_cond 0
% 18.24/3.06 AC symbols 1
% 18.24/3.06
% 18.24/3.06 ------ Input Options Time Limit: Unbounded
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Finite Models:
% 18.24/3.06
% 18.24/3.06 ------ lit_activity_flag true
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 1
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06 ------
% 18.24/3.06 Current options:
% 18.24/3.06 ------
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 2
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 3
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 3
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 3
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 3
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 3
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 4
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 4
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06 ------ Trying domains of size >= : 4
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 ------ Proving...
% 18.24/3.06
% 18.24/3.06
% 18.24/3.06 % SZS status CounterSatisfiable for theBenchmark.p
% 18.24/3.06
% 18.24/3.06 ------ Building Model...Done
% 18.24/3.06
% 18.24/3.06 %------ The model is defined over ground terms (initial term algebra).
% 18.24/3.06 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 18.24/3.06 %------ where \phi is a formula over the term algebra.
% 18.24/3.06 %------ If we have equality in the problem then it is also defined as a predicate above,
% 18.24/3.06 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 18.24/3.06 %------ See help for --sat_out_model for different model outputs.
% 18.24/3.06 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 18.24/3.06 %------ where the first argument stands for the sort ($i in the unsorted case)
% 18.24/3.06 % SZS output start Model for theBenchmark.p
% See solution above
% 18.24/3.06 ------ Statistics
% 18.24/3.06
% 18.24/3.06 ------ Problem properties
% 18.24/3.06
% 18.24/3.06 clauses: 22
% 18.24/3.06 conjectures: 3
% 18.24/3.06 epr: 0
% 18.24/3.06 horn: 22
% 18.24/3.06 ground: 3
% 18.24/3.06 unary: 21
% 18.24/3.06 binary: 1
% 18.24/3.06 lits: 23
% 18.24/3.06 lits_eq: 23
% 18.24/3.06 fd_pure: 0
% 18.24/3.06 fd_pseudo: 0
% 18.24/3.06 fd_cond: 0
% 18.24/3.06 fd_pseudo_cond: 0
% 18.24/3.06 ac_symbols: 1
% 18.24/3.06
% 18.24/3.06 ------ General
% 18.24/3.06
% 18.24/3.06 abstr_ref_over_cycles: 0
% 18.24/3.06 abstr_ref_under_cycles: 0
% 18.24/3.06 gc_basic_clause_elim: 0
% 18.24/3.06 num_of_symbols: 150
% 18.24/3.06 num_of_terms: 5158
% 18.24/3.06
% 18.24/3.06 parsing_time: 0.006
% 18.24/3.06 unif_index_cands_time: 0.068
% 18.24/3.06 unif_index_add_time: 0.026
% 18.24/3.06 orderings_time: 0.
% 18.24/3.06 out_proof_time: 0.
% 18.24/3.06 total_time: 2.097
% 18.24/3.06
% 18.24/3.06 ------ Preprocessing
% 18.24/3.06
% 18.24/3.06 num_of_splits: 0
% 18.24/3.06 num_of_split_atoms: 0
% 18.24/3.06 num_of_reused_defs: 0
% 18.24/3.06 num_eq_ax_congr_red: 0
% 18.24/3.06 num_of_sem_filtered_clauses: 0
% 18.24/3.06 num_of_subtypes: 0
% 18.24/3.06 monotx_restored_types: 0
% 18.24/3.06 sat_num_of_epr_types: 0
% 18.24/3.06 sat_num_of_non_cyclic_types: 0
% 18.24/3.06 sat_guarded_non_collapsed_types: 0
% 18.24/3.06 num_pure_diseq_elim: 0
% 18.24/3.06 simp_replaced_by: 0
% 18.24/3.06 res_preprocessed: 0
% 18.24/3.06 sup_preprocessed: 0
% 18.24/3.06 prep_upred: 0
% 18.24/3.06 prep_unflattend: 0
% 18.24/3.06 prep_well_definedness: 0
% 18.24/3.06 smt_new_axioms: 0
% 18.24/3.06 pred_elim_cands: 0
% 18.24/3.06 pred_elim: 0
% 18.24/3.06 pred_elim_cl: 0
% 18.24/3.06 pred_elim_cycles: 0
% 18.24/3.06 merged_defs: 0
% 18.24/3.06 merged_defs_ncl: 0
% 18.24/3.06 bin_hyper_res: 0
% 18.24/3.06 prep_cycles: 2
% 18.24/3.06
% 18.24/3.06 splitting_time: 0.
% 18.24/3.06 sem_filter_time: 0.001
% 18.24/3.06 monotx_time: 0.
% 18.24/3.06 subtype_inf_time: 0.
% 18.24/3.06 res_prep_time: 0.002
% 18.24/3.06 sup_prep_time: 0.002
% 18.24/3.06 pred_elim_time: 0.
% 18.24/3.06 bin_hyper_res_time: 0.
% 18.24/3.06 prep_time_total: 0.009
% 18.24/3.06
% 18.24/3.06 ------ Propositional Solver
% 18.24/3.06
% 18.24/3.06 prop_solver_calls: 152
% 18.24/3.06 prop_fast_solver_calls: 192
% 18.24/3.06 smt_solver_calls: 0
% 18.24/3.06 smt_fast_solver_calls: 0
% 18.24/3.06 prop_num_of_clauses: 14575
% 18.24/3.06 prop_preprocess_simplified: 37113
% 18.24/3.06 prop_fo_subsumed: 0
% 18.24/3.06
% 18.24/3.06 prop_solver_time: 0.028
% 18.24/3.06 prop_fast_solver_time: 0.
% 18.24/3.06 prop_unsat_core_time: 0.003
% 18.24/3.06 smt_solver_time: 0.
% 18.24/3.06 smt_fast_solver_time: 0.
% 18.24/3.06
% 18.24/3.06 ------ QBF
% 18.24/3.06
% 18.24/3.06 qbf_q_res: 0
% 18.24/3.06 qbf_num_tautologies: 0
% 18.24/3.06 qbf_prep_cycles: 0
% 18.24/3.06
% 18.24/3.06 ------ BMC1
% 18.24/3.06
% 18.24/3.06 bmc1_current_bound: -1
% 18.24/3.06 bmc1_last_solved_bound: -1
% 18.24/3.06 bmc1_unsat_core_size: -1
% 18.24/3.06 bmc1_unsat_core_parents_size: -1
% 18.24/3.06 bmc1_merge_next_fun: 0
% 18.24/3.06
% 18.24/3.06 bmc1_unsat_core_clauses_time: 0.
% 18.24/3.06
% 18.24/3.06 ------ Instantiation
% 18.24/3.06
% 18.24/3.06 inst_num_of_clauses: 4102
% 18.24/3.06 inst_num_in_passive: 0
% 18.24/3.06 inst_num_in_active: 11044
% 18.24/3.06 inst_num_of_loops: 13885
% 18.24/3.06 inst_num_in_unprocessed: 0
% 18.24/3.06 inst_num_of_learning_restarts: 1
% 18.24/3.06 inst_num_moves_active_passive: 2650
% 18.24/3.06 inst_lit_activity: 0
% 18.24/3.06 inst_lit_activity_moves: 0
% 18.24/3.06 inst_num_tautologies: 0
% 18.24/3.06 inst_num_prop_implied: 0
% 18.24/3.06 inst_num_existing_simplified: 0
% 18.24/3.06 inst_num_eq_res_simplified: 0
% 18.24/3.06 inst_num_child_elim: 0
% 18.24/3.06 inst_num_of_dismatching_blockings: 3186
% 18.24/3.06 inst_num_of_non_proper_insts: 13661
% 18.24/3.06 inst_num_of_duplicates: 0
% 18.24/3.06 inst_inst_num_from_inst_to_res: 0
% 18.24/3.06
% 18.24/3.06 inst_time_sim_new: 0.706
% 18.24/3.06 inst_time_sim_given: 0.001
% 18.24/3.06 inst_time_dismatching_checking: 0.069
% 18.24/3.06 inst_time_total: 1.931
% 18.24/3.06
% 18.24/3.06 ------ Resolution
% 18.24/3.06
% 18.24/3.06 res_num_of_clauses: 30
% 18.24/3.06 res_num_in_passive: 0
% 18.24/3.06 res_num_in_active: 0
% 18.24/3.06 res_num_of_loops: 54
% 18.24/3.06 res_forward_subset_subsumed: 567
% 18.24/3.06 res_backward_subset_subsumed: 0
% 18.24/3.06 res_forward_subsumed: 0
% 18.24/3.06 res_backward_subsumed: 0
% 18.24/3.06 res_forward_subsumption_resolution: 0
% 18.24/3.06 res_backward_subsumption_resolution: 0
% 18.24/3.06 res_clause_to_clause_subsumption: 200
% 18.24/3.06 res_subs_bck_cnt: 3
% 18.24/3.06 res_orphan_elimination: 0
% 18.24/3.06 res_tautology_del: 0
% 18.24/3.06 res_num_eq_res_simplified: 0
% 18.24/3.06 res_num_sel_changes: 0
% 18.24/3.06 res_moves_from_active_to_pass: 0
% 18.24/3.06
% 18.24/3.06 res_time_sim_new: 0.
% 18.24/3.06 res_time_sim_fw_given: 0.
% 18.24/3.06 res_time_sim_bw_given: 0.
% 18.24/3.06 res_time_total: 0.
% 18.24/3.06
% 18.24/3.06 ------ Superposition
% 18.24/3.06
% 18.24/3.06 sup_num_of_clauses: undef
% 18.24/3.06 sup_num_in_active: undef
% 18.24/3.06 sup_num_in_passive: undef
% 18.24/3.06 sup_num_of_loops: 0
% 18.24/3.06 sup_fw_superposition: 0
% 18.24/3.06 sup_bw_superposition: 0
% 18.24/3.06 sup_eq_factoring: 0
% 18.24/3.06 sup_eq_resolution: 0
% 18.24/3.06 sup_immediate_simplified: 0
% 18.24/3.06 sup_given_eliminated: 0
% 18.24/3.06 comparisons_done: 159
% 18.24/3.06 comparisons_avoided: 0
% 18.24/3.06 comparisons_inc_criteria: 0
% 18.24/3.06 sup_deep_cl_discarded: 0
% 18.24/3.06 sup_num_of_deepenings: 0
% 18.24/3.06 sup_num_of_restarts: 0
% 18.24/3.06
% 18.24/3.06 sup_time_generating: 0.
% 18.24/3.06 sup_time_sim_fw_full: 0.
% 18.24/3.06 sup_time_sim_bw_full: 0.
% 18.24/3.06 sup_time_sim_fw_immed: 0.
% 18.24/3.06 sup_time_sim_bw_immed: 0.
% 18.24/3.06 sup_time_prep_sim_fw_input: 0.
% 18.24/3.06 sup_time_prep_sim_bw_input: 0.001
% 18.24/3.06 sup_time_total: 0.
% 18.24/3.06
% 18.24/3.06 ------ Simplifications
% 18.24/3.06
% 18.24/3.06 sim_repeated: 0
% 18.24/3.06 sim_fw_subset_subsumed: 0
% 18.24/3.06 sim_bw_subset_subsumed: 0
% 18.24/3.06 sim_fw_subsumed: 0
% 18.24/3.06 sim_bw_subsumed: 0
% 18.24/3.06 sim_fw_subsumption_res: 0
% 18.24/3.06 sim_bw_subsumption_res: 0
% 18.24/3.06 sim_fw_unit_subs: 0
% 18.24/3.06 sim_bw_unit_subs: 0
% 18.24/3.06 sim_tautology_del: 0
% 18.24/3.06 sim_eq_tautology_del: 0
% 18.24/3.06 sim_eq_res_simp: 0
% 18.24/3.06 sim_fw_demodulated: 0
% 18.24/3.06 sim_bw_demodulated: 0
% 18.24/3.06 sim_encompassment_demod: 0
% 18.24/3.06 sim_light_normalised: 0
% 18.24/3.06 sim_ac_normalised: 2
% 18.24/3.06 sim_joinable_taut: 0
% 18.24/3.06 sim_joinable_simp: 0
% 18.24/3.06 sim_fw_ac_demod: 0
% 18.24/3.06 sim_bw_ac_demod: 0
% 18.24/3.06 sim_smt_subsumption: 0
% 18.24/3.06 sim_smt_simplified: 0
% 18.24/3.06 sim_ground_joinable: 0
% 18.24/3.06 sim_bw_ground_joinable: 0
% 18.24/3.06 sim_connectedness: 0
% 18.24/3.06
% 18.24/3.06 sim_time_fw_subset_subs: 0.
% 18.24/3.06 sim_time_bw_subset_subs: 0.
% 18.24/3.06 sim_time_fw_subs: 0.
% 18.24/3.06 sim_time_bw_subs: 0.
% 18.24/3.06 sim_time_fw_subs_res: 0.
% 18.24/3.06 sim_time_bw_subs_res: 0.
% 18.24/3.06 sim_time_fw_unit_subs: 0.
% 18.24/3.06 sim_time_bw_unit_subs: 0.
% 18.24/3.06 sim_time_tautology_del: 0.
% 18.24/3.06 sim_time_eq_tautology_del: 0.
% 18.24/3.06 sim_time_eq_res_simp: 0.
% 18.24/3.06 sim_time_fw_demod: 0.
% 18.24/3.06 sim_time_bw_demod: 0.
% 18.24/3.06 sim_time_light_norm: 0.
% 18.24/3.06 sim_time_joinable: 0.
% 18.24/3.06 sim_time_ac_norm: 0.
% 18.24/3.06 sim_time_fw_ac_demod: 0.
% 18.24/3.06 sim_time_bw_ac_demod: 0.
% 18.24/3.06 sim_time_smt_subs: 0.
% 18.24/3.06 sim_time_fw_gjoin: 0.
% 18.24/3.06 sim_time_fw_connected: 0.
% 18.24/3.06
% 18.24/3.07
%------------------------------------------------------------------------------