TSTP Solution File: LCL280-3 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : LCL280-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n025.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 07:54:12 EDT 2023
% Result : Satisfiable 3.12s 1.13s
% Output : Model 3.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL280-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 17:48:51 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.12/1.13 % SZS status Started for theBenchmark.p
% 3.12/1.13 % SZS status Satisfiable for theBenchmark.p
% 3.12/1.13
% 3.12/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.12/1.13
% 3.12/1.13 ------ iProver source info
% 3.12/1.13
% 3.12/1.13 git: date: 2023-05-31 18:12:56 +0000
% 3.12/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.12/1.13 git: non_committed_changes: false
% 3.12/1.13 git: last_make_outside_of_git: false
% 3.12/1.13
% 3.12/1.13 ------ Parsing...successful
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.12/1.13
% 3.12/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.12/1.13
% 3.12/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.12/1.13 ------ Proving...
% 3.12/1.13 ------ Problem Properties
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 clauses 10
% 3.12/1.13 conjectures 1
% 3.12/1.13 EPR 0
% 3.12/1.13 Horn 10
% 3.12/1.13 unary 9
% 3.12/1.13 binary 0
% 3.12/1.13 lits 12
% 3.12/1.13 lits eq 3
% 3.12/1.13 fd_pure 0
% 3.12/1.13 fd_pseudo 0
% 3.12/1.13 fd_cond 0
% 3.12/1.13 fd_pseudo_cond 0
% 3.12/1.13 AC symbols 0
% 3.12/1.13
% 3.12/1.13 ------ Input Options Time Limit: Unbounded
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 ------ Finite Models:
% 3.12/1.13
% 3.12/1.13 ------ lit_activity_flag true
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 ------ Trying domains of size >= : 1
% 3.12/1.13
% 3.12/1.13 ------ Trying domains of size >= : 2
% 3.12/1.13 ------
% 3.12/1.13 Current options:
% 3.12/1.13 ------
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 ------ Proving...
% 3.12/1.13
% 3.12/1.13 ------ Trying domains of size >= : 2
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 ------ Proving...
% 3.12/1.13
% 3.12/1.13 ------ Trying domains of size >= : 2
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 ------ Proving...
% 3.12/1.13
% 3.12/1.13
% 3.12/1.13 % SZS status Satisfiable for theBenchmark.p
% 3.12/1.13
% 3.12/1.13 ------ Building Model...Done
% 3.12/1.13
% 3.12/1.13 %------ The model is defined over ground terms (initial term algebra).
% 3.12/1.13 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.12/1.13 %------ where \phi is a formula over the term algebra.
% 3.12/1.13 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.12/1.13 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.12/1.13 %------ See help for --sat_out_model for different model outputs.
% 3.12/1.13 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.12/1.13 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.12/1.13 % SZS output start Model for theBenchmark.p
% 3.12/1.13
% 3.12/1.13 %------ Negative definition of equality_sorted
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0_12,X0_1,X1_1] :
% 3.12/1.13 ( ~(equality_sorted(X0_12,X0_1,X1_1)) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0_12=$i & X0=iProver_Domain_i_1 & X1=iProver_Domain_i_2 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0_12=$i & X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of theorem
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0] :
% 3.12/1.13 ( theorem(X0) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of axiom
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0] :
% 3.12/1.13 ( axiom(X0) <=>
% 3.12/1.13 $false
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_p
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0] :
% 3.12/1.13 ( iProver_Flat_p(X0) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_r
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0] :
% 3.12/1.13 ( iProver_Flat_r(X0) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_equivalent
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0,X1,X2] :
% 3.12/1.13 ( iProver_Flat_equivalent(X0,X1,X2) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X2=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_q
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0] :
% 3.12/1.13 ( iProver_Flat_q(X0) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_s
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0] :
% 3.12/1.13 ( iProver_Flat_s(X0) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_and
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0,X1,X2] :
% 3.12/1.13 ( iProver_Flat_and(X0,X1,X2) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_2 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_2 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X2=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X2=iProver_Domain_i_2 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_or
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0,X1,X2] :
% 3.12/1.13 ( iProver_Flat_or(X0,X1,X2) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_2 & X2=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_2 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_2 | X2!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_implies
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0,X1,X2] :
% 3.12/1.13 ( iProver_Flat_implies(X0,X1,X2) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X2!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13
% 3.12/1.13 %------ Positive definition of iProver_Flat_not
% 3.12/1.13 fof(lit_def,axiom,
% 3.12/1.13 (! [X0,X1] :
% 3.12/1.13 ( iProver_Flat_not(X0,X1) <=>
% 3.12/1.13 (
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_1 )
% 3.12/1.13 &
% 3.12/1.13 ( X1!=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 |
% 3.12/1.13 (
% 3.12/1.13 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 )
% 3.12/1.13 )
% 3.12/1.13
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 )
% 3.12/1.13 ).
% 3.12/1.13 % SZS output end Model for theBenchmark.p
% 3.12/1.13 ------ Statistics
% 3.12/1.13
% 3.12/1.13 ------ Problem properties
% 3.12/1.13
% 3.12/1.13 clauses: 10
% 3.12/1.13 conjectures: 1
% 3.12/1.13 epr: 0
% 3.12/1.13 horn: 10
% 3.12/1.13 ground: 1
% 3.12/1.13 unary: 9
% 3.12/1.13 binary: 0
% 3.12/1.13 lits: 12
% 3.12/1.13 lits_eq: 3
% 3.12/1.13 fd_pure: 0
% 3.12/1.13 fd_pseudo: 0
% 3.12/1.13 fd_cond: 0
% 3.12/1.13 fd_pseudo_cond: 0
% 3.12/1.13 ac_symbols: 0
% 3.12/1.13
% 3.12/1.13 ------ General
% 3.12/1.13
% 3.12/1.13 abstr_ref_over_cycles: 0
% 3.12/1.13 abstr_ref_under_cycles: 0
% 3.12/1.13 gc_basic_clause_elim: 0
% 3.12/1.13 num_of_symbols: 135
% 3.12/1.13 num_of_terms: 2268
% 3.12/1.13
% 3.12/1.13 parsing_time: 0.
% 3.12/1.13 unif_index_cands_time: 0.008
% 3.12/1.13 unif_index_add_time: 0.004
% 3.12/1.13 orderings_time: 0.
% 3.12/1.13 out_proof_time: 0.
% 3.12/1.13 total_time: 0.278
% 3.12/1.13
% 3.12/1.13 ------ Preprocessing
% 3.12/1.13
% 3.12/1.13 num_of_splits: 0
% 3.12/1.13 num_of_split_atoms: 0
% 3.12/1.13 num_of_reused_defs: 0
% 3.12/1.13 num_eq_ax_congr_red: 0
% 3.12/1.13 num_of_sem_filtered_clauses: 1
% 3.12/1.13 num_of_subtypes: 0
% 3.12/1.13 monotx_restored_types: 0
% 3.12/1.13 sat_num_of_epr_types: 0
% 3.12/1.13 sat_num_of_non_cyclic_types: 0
% 3.12/1.13 sat_guarded_non_collapsed_types: 0
% 3.12/1.13 num_pure_diseq_elim: 0
% 3.12/1.13 simp_replaced_by: 0
% 3.12/1.13 res_preprocessed: 0
% 3.12/1.13 sup_preprocessed: 1
% 3.12/1.13 prep_upred: 0
% 3.12/1.13 prep_unflattend: 5
% 3.12/1.13 prep_well_definedness: 0
% 3.12/1.13 smt_new_axioms: 0
% 3.12/1.13 pred_elim_cands: 1
% 3.12/1.13 pred_elim: 1
% 3.12/1.13 pred_elim_cl: 1
% 3.12/1.13 pred_elim_cycles: 3
% 3.12/1.13 merged_defs: 0
% 3.12/1.13 merged_defs_ncl: 0
% 3.12/1.13 bin_hyper_res: 0
% 3.12/1.13 prep_cycles: 4
% 3.12/1.13
% 3.12/1.13 splitting_time: 0.
% 3.12/1.13 sem_filter_time: 0.002
% 3.12/1.13 monotx_time: 0.
% 3.12/1.13 subtype_inf_time: 0.
% 3.12/1.13 res_prep_time: 0.007
% 3.12/1.13 sup_prep_time: 0.
% 3.12/1.13 pred_elim_time: 0.
% 3.12/1.13 bin_hyper_res_time: 0.
% 3.12/1.13 prep_time_total: 0.013
% 3.12/1.13
% 3.12/1.13 ------ Propositional Solver
% 3.12/1.13
% 3.12/1.13 prop_solver_calls: 114
% 3.12/1.13 prop_fast_solver_calls: 284
% 3.12/1.13 smt_solver_calls: 0
% 3.12/1.13 smt_fast_solver_calls: 0
% 3.12/1.13 prop_num_of_clauses: 1757
% 3.12/1.13 prop_preprocess_simplified: 4816
% 3.12/1.13 prop_fo_subsumed: 0
% 3.12/1.13
% 3.12/1.13 prop_solver_time: 0.006
% 3.12/1.13 prop_fast_solver_time: 0.
% 3.12/1.13 prop_unsat_core_time: 0.
% 3.12/1.13 smt_solver_time: 0.
% 3.12/1.13 smt_fast_solver_time: 0.
% 3.12/1.13
% 3.12/1.13 ------ QBF
% 3.12/1.13
% 3.12/1.13 qbf_q_res: 0
% 3.12/1.13 qbf_num_tautologies: 0
% 3.12/1.13 qbf_prep_cycles: 0
% 3.12/1.13
% 3.12/1.13 ------ BMC1
% 3.12/1.13
% 3.12/1.13 bmc1_current_bound: -1
% 3.12/1.13 bmc1_last_solved_bound: -1
% 3.12/1.13 bmc1_unsat_core_size: -1
% 3.12/1.13 bmc1_unsat_core_parents_size: -1
% 3.12/1.13 bmc1_merge_next_fun: 0
% 3.12/1.13
% 3.12/1.13 bmc1_unsat_core_clauses_time: 0.
% 3.12/1.13
% 3.12/1.13 ------ Instantiation
% 3.12/1.13
% 3.12/1.13 inst_num_of_clauses: 233
% 3.12/1.13 inst_num_in_passive: 0
% 3.12/1.13 inst_num_in_active: 1363
% 3.12/1.13 inst_num_of_loops: 4533
% 3.12/1.13 inst_num_in_unprocessed: 0
% 3.12/1.13 inst_num_of_learning_restarts: 1
% 3.12/1.13 inst_num_moves_active_passive: 2989
% 3.12/1.13 inst_lit_activity: 0
% 3.12/1.13 inst_lit_activity_moves: 0
% 3.12/1.13 inst_num_tautologies: 0
% 3.12/1.13 inst_num_prop_implied: 0
% 3.12/1.13 inst_num_existing_simplified: 0
% 3.12/1.13 inst_num_eq_res_simplified: 0
% 3.12/1.13 inst_num_child_elim: 0
% 3.12/1.13 inst_num_of_dismatching_blockings: 813
% 3.12/1.13 inst_num_of_non_proper_insts: 2618
% 3.12/1.13 inst_num_of_duplicates: 0
% 3.12/1.13 inst_inst_num_from_inst_to_res: 0
% 3.12/1.13
% 3.12/1.13 inst_time_sim_new: 0.055
% 3.12/1.13 inst_time_sim_given: 0.
% 3.12/1.13 inst_time_dismatching_checking: 0.007
% 3.12/1.13 inst_time_total: 0.235
% 3.12/1.13
% 3.12/1.13 ------ Resolution
% 3.12/1.13
% 3.12/1.13 res_num_of_clauses: 18
% 3.12/1.13 res_num_in_passive: 0
% 3.12/1.13 res_num_in_active: 0
% 3.12/1.13 res_num_of_loops: 62
% 3.12/1.13 res_forward_subset_subsumed: 35
% 3.12/1.13 res_backward_subset_subsumed: 0
% 3.12/1.13 res_forward_subsumed: 0
% 3.12/1.13 res_backward_subsumed: 0
% 3.12/1.13 res_forward_subsumption_resolution: 0
% 3.12/1.13 res_backward_subsumption_resolution: 0
% 3.12/1.13 res_clause_to_clause_subsumption: 165
% 3.12/1.13 res_subs_bck_cnt: 1
% 3.12/1.13 res_orphan_elimination: 0
% 3.12/1.13 res_tautology_del: 5
% 3.12/1.13 res_num_eq_res_simplified: 0
% 3.12/1.13 res_num_sel_changes: 0
% 3.12/1.13 res_moves_from_active_to_pass: 0
% 3.12/1.13
% 3.12/1.13 res_time_sim_new: 0.
% 3.12/1.13 res_time_sim_fw_given: 0.
% 3.12/1.13 res_time_sim_bw_given: 0.
% 3.12/1.13 res_time_total: 0.005
% 3.12/1.13
% 3.12/1.13 ------ Superposition
% 3.12/1.13
% 3.12/1.13 sup_num_of_clauses: undef
% 3.12/1.13 sup_num_in_active: undef
% 3.12/1.13 sup_num_in_passive: undef
% 3.12/1.13 sup_num_of_loops: 0
% 3.12/1.13 sup_fw_superposition: 0
% 3.12/1.13 sup_bw_superposition: 0
% 3.12/1.13 sup_eq_factoring: 0
% 3.12/1.13 sup_eq_resolution: 0
% 3.12/1.13 sup_immediate_simplified: 0
% 3.12/1.13 sup_given_eliminated: 0
% 3.12/1.13 comparisons_done: 12
% 3.12/1.13 comparisons_avoided: 0
% 3.12/1.13 comparisons_inc_criteria: 0
% 3.12/1.13 sup_deep_cl_discarded: 0
% 3.12/1.13 sup_num_of_deepenings: 0
% 3.12/1.13 sup_num_of_restarts: 0
% 3.12/1.13
% 3.12/1.13 sup_time_generating: 0.
% 3.12/1.13 sup_time_sim_fw_full: 0.
% 3.12/1.13 sup_time_sim_bw_full: 0.
% 3.12/1.13 sup_time_sim_fw_immed: 0.
% 3.12/1.13 sup_time_sim_bw_immed: 0.
% 3.12/1.13 sup_time_prep_sim_fw_input: 0.
% 3.12/1.13 sup_time_prep_sim_bw_input: 0.
% 3.12/1.13 sup_time_total: 0.
% 3.12/1.13
% 3.12/1.13 ------ Simplifications
% 3.12/1.13
% 3.12/1.13 sim_repeated: 0
% 3.12/1.13 sim_fw_subset_subsumed: 0
% 3.12/1.13 sim_bw_subset_subsumed: 0
% 3.12/1.13 sim_fw_subsumed: 0
% 3.12/1.13 sim_bw_subsumed: 0
% 3.12/1.13 sim_fw_subsumption_res: 0
% 3.12/1.13 sim_bw_subsumption_res: 0
% 3.12/1.13 sim_fw_unit_subs: 0
% 3.12/1.13 sim_bw_unit_subs: 0
% 3.12/1.13 sim_tautology_del: 0
% 3.12/1.13 sim_eq_tautology_del: 0
% 3.12/1.13 sim_eq_res_simp: 0
% 3.12/1.13 sim_fw_demodulated: 1
% 3.12/1.13 sim_bw_demodulated: 0
% 3.12/1.13 sim_encompassment_demod: 0
% 3.12/1.13 sim_light_normalised: 0
% 3.12/1.13 sim_ac_normalised: 0
% 3.12/1.13 sim_joinable_taut: 0
% 3.12/1.13 sim_joinable_simp: 0
% 3.12/1.13 sim_fw_ac_demod: 0
% 3.12/1.13 sim_bw_ac_demod: 0
% 3.12/1.13 sim_smt_subsumption: 0
% 3.12/1.13 sim_smt_simplified: 0
% 3.12/1.13 sim_ground_joinable: 0
% 3.12/1.13 sim_bw_ground_joinable: 0
% 3.12/1.13 sim_connectedness: 0
% 3.12/1.13
% 3.12/1.13 sim_time_fw_subset_subs: 0.
% 3.12/1.13 sim_time_bw_subset_subs: 0.
% 3.12/1.13 sim_time_fw_subs: 0.
% 3.12/1.13 sim_time_bw_subs: 0.
% 3.12/1.13 sim_time_fw_subs_res: 0.
% 3.12/1.13 sim_time_bw_subs_res: 0.
% 3.12/1.13 sim_time_fw_unit_subs: 0.
% 3.12/1.13 sim_time_bw_unit_subs: 0.
% 3.12/1.13 sim_time_tautology_del: 0.
% 3.12/1.13 sim_time_eq_tautology_del: 0.
% 3.12/1.13 sim_time_eq_res_simp: 0.
% 3.12/1.13 sim_time_fw_demod: 0.
% 3.12/1.13 sim_time_bw_demod: 0.
% 3.12/1.13 sim_time_light_norm: 0.
% 3.12/1.13 sim_time_joinable: 0.
% 3.12/1.13 sim_time_ac_norm: 0.
% 3.12/1.13 sim_time_fw_ac_demod: 0.
% 3.12/1.13 sim_time_bw_ac_demod: 0.
% 3.12/1.13 sim_time_smt_subs: 0.
% 3.12/1.13 sim_time_fw_gjoin: 0.
% 3.12/1.13 sim_time_fw_connected: 0.
% 3.12/1.13
% 3.12/1.13
%------------------------------------------------------------------------------