TSTP Solution File: LCL165-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : LCL165-1 : TPTP v8.1.2. Released v1.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 07:53:42 EDT 2023
% Result : Satisfiable 15.07s 2.65s
% Output : Model 15.07s
% 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_x
fof(lit_def_001,axiom,
! [X0] :
( iProver_Flat_x(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_or
fof(lit_def_002,axiom,
! [X0,X1,X2] :
( iProver_Flat_or(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
& X2 != iProver_Domain_i_4 )
| ( 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_1
& X2 = iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_3 )
| ( 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_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3
& X2 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_4
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X2 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3
& X1 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_3
& 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_3
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_3
& X2 = iProver_Domain_i_3
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3 )
| ( 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_1
| X2 != iProver_Domain_i_4 )
& 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_2
| X2 != iProver_Domain_i_4 )
& 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 )
& ( X1 != iProver_Domain_i_4
| X2 != iProver_Domain_i_2 )
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 ) ) ) ).
%------ Positive definition of iProver_Flat_and
fof(lit_def_003,axiom,
! [X0,X1,X2] :
( iProver_Flat_and(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_3
& X2 = iProver_Domain_i_3 )
| ( 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_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
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_3 ) ) ) ) ).
%------ Positive definition of iProver_Flat_not
fof(lit_def_004,axiom,
! [X0,X1] :
( iProver_Flat_not(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_2
& X1 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_implies
fof(lit_def_005,axiom,
! [X0,X1,X2] :
( iProver_Flat_implies(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& 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_1
| X2 != iProver_Domain_i_4 )
& 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_2 )
& ( X1 != iProver_Domain_i_3
| X2 != iProver_Domain_i_3 )
& X1 != iProver_Domain_i_4
& ( X1 != iProver_Domain_i_4
| X2 != 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_2
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_3
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_4
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_4
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_4
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_4
& X2 = iProver_Domain_i_3 )
| ( 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
& X1 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3
& X1 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_3
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_3
& X1 != iProver_Domain_i_4 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_3
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_3
& X1 = iProver_Domain_i_2
& X2 != iProver_Domain_i_1
& X2 != 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
& X2 != iProver_Domain_i_1
& X2 != iProver_Domain_i_2
& X2 != iProver_Domain_i_3 )
| ( X0 = iProver_Domain_i_4
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_4 ) ) ) ).
%------ Positive definition of iProver_Flat_truth
fof(lit_def_006,axiom,
! [X0] :
( iProver_Flat_truth(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL165-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 04:59:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.45 Running model finding
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 15.07/2.65 % SZS status Started for theBenchmark.p
% 15.07/2.65 % SZS status Satisfiable for theBenchmark.p
% 15.07/2.65
% 15.07/2.65 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 15.07/2.65
% 15.07/2.65 ------ iProver source info
% 15.07/2.65
% 15.07/2.65 git: date: 2023-05-31 18:12:56 +0000
% 15.07/2.65 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 15.07/2.65 git: non_committed_changes: false
% 15.07/2.65 git: last_make_outside_of_git: false
% 15.07/2.65
% 15.07/2.65 ------ Parsing...successful
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 15.07/2.65
% 15.07/2.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 15.07/2.65
% 15.07/2.65 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 15.07/2.65 ------ Proving...
% 15.07/2.65 ------ Problem Properties
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 clauses 11
% 15.07/2.65 conjectures 1
% 15.07/2.65 EPR 0
% 15.07/2.65 Horn 11
% 15.07/2.65 unary 11
% 15.07/2.65 binary 0
% 15.07/2.65 lits 11
% 15.07/2.65 lits eq 11
% 15.07/2.65 fd_pure 0
% 15.07/2.65 fd_pseudo 0
% 15.07/2.65 fd_cond 0
% 15.07/2.65 fd_pseudo_cond 0
% 15.07/2.65 AC symbols 2
% 15.07/2.65
% 15.07/2.65 ------ Input Options Time Limit: Unbounded
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Finite Models:
% 15.07/2.65
% 15.07/2.65 ------ lit_activity_flag true
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 1
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 2
% 15.07/2.65 ------
% 15.07/2.65 Current options:
% 15.07/2.65 ------
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 2
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 2
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 2
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 2
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 3
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 3
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 3
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 3
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 4
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 4
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 4
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65 ------ Trying domains of size >= : 4
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 ------ Proving...
% 15.07/2.65
% 15.07/2.65
% 15.07/2.65 % SZS status Satisfiable for theBenchmark.p
% 15.07/2.65
% 15.07/2.65 ------ Building Model...Done
% 15.07/2.65
% 15.07/2.65 %------ The model is defined over ground terms (initial term algebra).
% 15.07/2.65 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 15.07/2.65 %------ where \phi is a formula over the term algebra.
% 15.07/2.65 %------ If we have equality in the problem then it is also defined as a predicate above,
% 15.07/2.65 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 15.07/2.65 %------ See help for --sat_out_model for different model outputs.
% 15.07/2.65 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 15.07/2.65 %------ where the first argument stands for the sort ($i in the unsorted case)
% 15.07/2.65 % SZS output start Model for theBenchmark.p
% See solution above
% 15.07/2.66 ------ Statistics
% 15.07/2.66
% 15.07/2.66 ------ Problem properties
% 15.07/2.66
% 15.07/2.66 clauses: 11
% 15.07/2.66 conjectures: 1
% 15.07/2.66 epr: 0
% 15.07/2.66 horn: 11
% 15.07/2.66 ground: 1
% 15.07/2.66 unary: 11
% 15.07/2.66 binary: 0
% 15.07/2.66 lits: 11
% 15.07/2.66 lits_eq: 11
% 15.07/2.66 fd_pure: 0
% 15.07/2.66 fd_pseudo: 0
% 15.07/2.66 fd_cond: 0
% 15.07/2.66 fd_pseudo_cond: 0
% 15.07/2.66 ac_symbols: 2
% 15.07/2.66
% 15.07/2.66 ------ General
% 15.07/2.66
% 15.07/2.66 abstr_ref_over_cycles: 0
% 15.07/2.66 abstr_ref_under_cycles: 0
% 15.07/2.66 gc_basic_clause_elim: 0
% 15.07/2.66 num_of_symbols: 131
% 15.07/2.66 num_of_terms: 3777
% 15.07/2.66
% 15.07/2.66 parsing_time: 0.
% 15.07/2.66 unif_index_cands_time: 0.063
% 15.07/2.66 unif_index_add_time: 0.029
% 15.07/2.66 orderings_time: 0.
% 15.07/2.66 out_proof_time: 0.
% 15.07/2.66 total_time: 1.827
% 15.07/2.66
% 15.07/2.66 ------ Preprocessing
% 15.07/2.66
% 15.07/2.66 num_of_splits: 0
% 15.07/2.66 num_of_split_atoms: 0
% 15.07/2.66 num_of_reused_defs: 0
% 15.07/2.66 num_eq_ax_congr_red: 0
% 15.07/2.66 num_of_sem_filtered_clauses: 0
% 15.07/2.66 num_of_subtypes: 0
% 15.07/2.66 monotx_restored_types: 0
% 15.07/2.66 sat_num_of_epr_types: 0
% 15.07/2.66 sat_num_of_non_cyclic_types: 0
% 15.07/2.66 sat_guarded_non_collapsed_types: 0
% 15.07/2.66 num_pure_diseq_elim: 0
% 15.07/2.66 simp_replaced_by: 0
% 15.07/2.66 res_preprocessed: 0
% 15.07/2.66 sup_preprocessed: 1
% 15.07/2.66 prep_upred: 0
% 15.07/2.66 prep_unflattend: 0
% 15.07/2.66 prep_well_definedness: 0
% 15.07/2.66 smt_new_axioms: 0
% 15.07/2.66 pred_elim_cands: 0
% 15.07/2.66 pred_elim: 0
% 15.07/2.66 pred_elim_cl: 0
% 15.07/2.66 pred_elim_cycles: 0
% 15.07/2.66 merged_defs: 0
% 15.07/2.66 merged_defs_ncl: 0
% 15.07/2.66 bin_hyper_res: 0
% 15.07/2.66 prep_cycles: 2
% 15.07/2.66
% 15.07/2.66 splitting_time: 0.
% 15.07/2.66 sem_filter_time: 0.
% 15.07/2.66 monotx_time: 0.
% 15.07/2.66 subtype_inf_time: 0.
% 15.07/2.66 res_prep_time: 0.003
% 15.07/2.66 sup_prep_time: 0.
% 15.07/2.66 pred_elim_time: 0.
% 15.07/2.66 bin_hyper_res_time: 0.
% 15.07/2.66 prep_time_total: 0.008
% 15.07/2.66
% 15.07/2.66 ------ Propositional Solver
% 15.07/2.66
% 15.07/2.66 prop_solver_calls: 186
% 15.07/2.66 prop_fast_solver_calls: 111
% 15.07/2.66 smt_solver_calls: 0
% 15.07/2.66 smt_fast_solver_calls: 0
% 15.07/2.66 prop_num_of_clauses: 20776
% 15.07/2.66 prop_preprocess_simplified: 60838
% 15.07/2.66 prop_fo_subsumed: 0
% 15.07/2.66
% 15.07/2.66 prop_solver_time: 0.035
% 15.07/2.66 prop_fast_solver_time: 0.
% 15.07/2.66 prop_unsat_core_time: 0.006
% 15.07/2.66 smt_solver_time: 0.
% 15.07/2.66 smt_fast_solver_time: 0.
% 15.07/2.66
% 15.07/2.66 ------ QBF
% 15.07/2.66
% 15.07/2.66 qbf_q_res: 0
% 15.07/2.66 qbf_num_tautologies: 0
% 15.07/2.66 qbf_prep_cycles: 0
% 15.07/2.66
% 15.07/2.66 ------ BMC1
% 15.07/2.66
% 15.07/2.66 bmc1_current_bound: -1
% 15.07/2.66 bmc1_last_solved_bound: -1
% 15.07/2.66 bmc1_unsat_core_size: -1
% 15.07/2.66 bmc1_unsat_core_parents_size: -1
% 15.07/2.66 bmc1_merge_next_fun: 0
% 15.07/2.66
% 15.07/2.66 bmc1_unsat_core_clauses_time: 0.
% 15.07/2.66
% 15.07/2.66 ------ Instantiation
% 15.07/2.66
% 15.07/2.66 inst_num_of_clauses: 1348
% 15.07/2.66 inst_num_in_passive: 0
% 15.07/2.66 inst_num_in_active: 16670
% 15.07/2.66 inst_num_of_loops: 21814
% 15.07/2.66 inst_num_in_unprocessed: 0
% 15.07/2.66 inst_num_of_learning_restarts: 3
% 15.07/2.66 inst_num_moves_active_passive: 4934
% 15.07/2.66 inst_lit_activity: 0
% 15.07/2.66 inst_lit_activity_moves: 0
% 15.07/2.66 inst_num_tautologies: 0
% 15.07/2.66 inst_num_prop_implied: 0
% 15.07/2.66 inst_num_existing_simplified: 0
% 15.07/2.66 inst_num_eq_res_simplified: 0
% 15.07/2.66 inst_num_child_elim: 0
% 15.07/2.66 inst_num_of_dismatching_blockings: 10523
% 15.07/2.66 inst_num_of_non_proper_insts: 27107
% 15.07/2.66 inst_num_of_duplicates: 0
% 15.07/2.66 inst_inst_num_from_inst_to_res: 0
% 15.07/2.66
% 15.07/2.66 inst_time_sim_new: 0.577
% 15.07/2.66 inst_time_sim_given: 0.001
% 15.07/2.66 inst_time_dismatching_checking: 0.104
% 15.07/2.66 inst_time_total: 1.758
% 15.07/2.66
% 15.07/2.66 ------ Resolution
% 15.07/2.66
% 15.07/2.66 res_num_of_clauses: 17
% 15.07/2.66 res_num_in_passive: 0
% 15.07/2.66 res_num_in_active: 0
% 15.07/2.66 res_num_of_loops: 30
% 15.07/2.66 res_forward_subset_subsumed: 921
% 15.07/2.66 res_backward_subset_subsumed: 0
% 15.07/2.66 res_forward_subsumed: 0
% 15.07/2.66 res_backward_subsumed: 0
% 15.07/2.66 res_forward_subsumption_resolution: 0
% 15.07/2.66 res_backward_subsumption_resolution: 0
% 15.07/2.66 res_clause_to_clause_subsumption: 70
% 15.07/2.66 res_subs_bck_cnt: 1
% 15.07/2.66 res_orphan_elimination: 0
% 15.07/2.66 res_tautology_del: 0
% 15.07/2.66 res_num_eq_res_simplified: 0
% 15.07/2.66 res_num_sel_changes: 0
% 15.07/2.66 res_moves_from_active_to_pass: 0
% 15.07/2.66
% 15.07/2.66 res_time_sim_new: 0.
% 15.07/2.66 res_time_sim_fw_given: 0.
% 15.07/2.66 res_time_sim_bw_given: 0.
% 15.07/2.66 res_time_total: 0.002
% 15.07/2.66
% 15.07/2.66 ------ Superposition
% 15.07/2.66
% 15.07/2.66 sup_num_of_clauses: undef
% 15.07/2.66 sup_num_in_active: undef
% 15.07/2.66 sup_num_in_passive: undef
% 15.07/2.66 sup_num_of_loops: 0
% 15.07/2.66 sup_fw_superposition: 0
% 15.07/2.66 sup_bw_superposition: 0
% 15.07/2.66 sup_eq_factoring: 0
% 15.07/2.66 sup_eq_resolution: 0
% 15.07/2.66 sup_immediate_simplified: 0
% 15.07/2.66 sup_given_eliminated: 0
% 15.07/2.66 comparisons_done: 55
% 15.07/2.66 comparisons_avoided: 0
% 15.07/2.66 comparisons_inc_criteria: 0
% 15.07/2.66 sup_deep_cl_discarded: 0
% 15.07/2.66 sup_num_of_deepenings: 0
% 15.07/2.66 sup_num_of_restarts: 0
% 15.07/2.66
% 15.07/2.66 sup_time_generating: 0.
% 15.07/2.66 sup_time_sim_fw_full: 0.
% 15.07/2.66 sup_time_sim_bw_full: 0.
% 15.07/2.66 sup_time_sim_fw_immed: 0.
% 15.07/2.66 sup_time_sim_bw_immed: 0.
% 15.07/2.66 sup_time_prep_sim_fw_input: 0.
% 15.07/2.66 sup_time_prep_sim_bw_input: 0.
% 15.07/2.66 sup_time_total: 0.
% 15.07/2.66
% 15.07/2.66 ------ Simplifications
% 15.07/2.66
% 15.07/2.66 sim_repeated: 0
% 15.07/2.66 sim_fw_subset_subsumed: 0
% 15.07/2.66 sim_bw_subset_subsumed: 0
% 15.07/2.66 sim_fw_subsumed: 0
% 15.07/2.66 sim_bw_subsumed: 0
% 15.07/2.66 sim_fw_subsumption_res: 0
% 15.07/2.66 sim_bw_subsumption_res: 0
% 15.07/2.66 sim_fw_unit_subs: 0
% 15.07/2.66 sim_bw_unit_subs: 0
% 15.07/2.66 sim_tautology_del: 0
% 15.07/2.66 sim_eq_tautology_del: 0
% 15.07/2.66 sim_eq_res_simp: 0
% 15.07/2.66 sim_fw_demodulated: 1
% 15.07/2.66 sim_bw_demodulated: 0
% 15.07/2.66 sim_encompassment_demod: 0
% 15.07/2.66 sim_light_normalised: 0
% 15.07/2.66 sim_ac_normalised: 1
% 15.07/2.66 sim_joinable_taut: 0
% 15.07/2.66 sim_joinable_simp: 0
% 15.07/2.66 sim_fw_ac_demod: 0
% 15.07/2.66 sim_bw_ac_demod: 0
% 15.07/2.66 sim_smt_subsumption: 0
% 15.07/2.66 sim_smt_simplified: 0
% 15.07/2.66 sim_ground_joinable: 0
% 15.07/2.66 sim_bw_ground_joinable: 0
% 15.07/2.66 sim_connectedness: 0
% 15.07/2.66
% 15.07/2.66 sim_time_fw_subset_subs: 0.
% 15.07/2.66 sim_time_bw_subset_subs: 0.
% 15.07/2.66 sim_time_fw_subs: 0.
% 15.07/2.66 sim_time_bw_subs: 0.
% 15.07/2.66 sim_time_fw_subs_res: 0.
% 15.07/2.66 sim_time_bw_subs_res: 0.
% 15.07/2.66 sim_time_fw_unit_subs: 0.
% 15.07/2.66 sim_time_bw_unit_subs: 0.
% 15.07/2.66 sim_time_tautology_del: 0.
% 15.07/2.66 sim_time_eq_tautology_del: 0.
% 15.07/2.66 sim_time_eq_res_simp: 0.
% 15.07/2.66 sim_time_fw_demod: 0.
% 15.07/2.66 sim_time_bw_demod: 0.
% 15.07/2.66 sim_time_light_norm: 0.
% 15.07/2.66 sim_time_joinable: 0.
% 15.07/2.66 sim_time_ac_norm: 0.
% 15.07/2.66 sim_time_fw_ac_demod: 0.
% 15.07/2.66 sim_time_bw_ac_demod: 0.
% 15.07/2.66 sim_time_smt_subs: 0.
% 15.07/2.66 sim_time_fw_gjoin: 0.
% 15.07/2.66 sim_time_fw_connected: 0.
% 15.07/2.66
% 15.07/2.66
%------------------------------------------------------------------------------