TSTP Solution File: LCL677+1.015 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : LCL677+1.015 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n012.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:58:37 EDT 2023
% Result : CounterSatisfiable 3.21s 1.13s
% Output : Model 3.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of r1
fof(lit_def,axiom,
! [X0,X1] :
( ~ r1(X0,X1)
<=> ( X1 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of p1
fof(lit_def_001,axiom,
! [X0] :
( ~ p1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of p2
fof(lit_def_002,axiom,
! [X0] :
( ~ p2(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of p3
fof(lit_def_003,axiom,
! [X0] :
( ~ p3(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of sP47
fof(lit_def_004,axiom,
! [X0] :
( sP47(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of p4
fof(lit_def_005,axiom,
! [X0] :
( p4(X0)
<=> $true ) ).
%------ Negative definition of sP46
fof(lit_def_006,axiom,
! [X0] :
( ~ sP46(X0)
<=> $false ) ).
%------ Positive definition of sP45
fof(lit_def_007,axiom,
! [X0] :
( sP45(X0)
<=> $false ) ).
%------ Negative definition of sP44
fof(lit_def_008,axiom,
! [X0] :
( ~ sP44(X0)
<=> $false ) ).
%------ Positive definition of sP43
fof(lit_def_009,axiom,
! [X0] :
( sP43(X0)
<=> $false ) ).
%------ Negative definition of sP42
fof(lit_def_010,axiom,
! [X0] :
( ~ sP42(X0)
<=> $false ) ).
%------ Positive definition of sP39
fof(lit_def_011,axiom,
! [X0] :
( sP39(X0)
<=> $false ) ).
%------ Negative definition of sP41
fof(lit_def_012,axiom,
! [X0] :
( ~ sP41(X0)
<=> $false ) ).
%------ Positive definition of sP40
fof(lit_def_013,axiom,
! [X0] :
( sP40(X0)
<=> $false ) ).
%------ Positive definition of sP36
fof(lit_def_014,axiom,
! [X0] :
( sP36(X0)
<=> $false ) ).
%------ Negative definition of sP38
fof(lit_def_015,axiom,
! [X0] :
( ~ sP38(X0)
<=> $false ) ).
%------ Positive definition of sP37
fof(lit_def_016,axiom,
! [X0] :
( sP37(X0)
<=> $false ) ).
%------ Positive definition of sP32
fof(lit_def_017,axiom,
! [X0] :
( sP32(X0)
<=> $false ) ).
%------ Positive definition of sP35
fof(lit_def_018,axiom,
! [X0] :
( sP35(X0)
<=> $false ) ).
%------ Positive definition of sP33
fof(lit_def_019,axiom,
! [X0] :
( sP33(X0)
<=> $false ) ).
%------ Negative definition of sP34
fof(lit_def_020,axiom,
! [X0] :
( ~ sP34(X0)
<=> $false ) ).
%------ Positive definition of sP28
fof(lit_def_021,axiom,
! [X0] :
( sP28(X0)
<=> $false ) ).
%------ Positive definition of sP31
fof(lit_def_022,axiom,
! [X0] :
( sP31(X0)
<=> $false ) ).
%------ Positive definition of sP29
fof(lit_def_023,axiom,
! [X0] :
( sP29(X0)
<=> $false ) ).
%------ Negative definition of sP30
fof(lit_def_024,axiom,
! [X0] :
( ~ sP30(X0)
<=> $false ) ).
%------ Positive definition of sP25
fof(lit_def_025,axiom,
! [X0] :
( sP25(X0)
<=> $false ) ).
%------ Negative definition of sP27
fof(lit_def_026,axiom,
! [X0] :
( ~ sP27(X0)
<=> $false ) ).
%------ Positive definition of sP23
fof(lit_def_027,axiom,
! [X0] :
( sP23(X0)
<=> $false ) ).
%------ Positive definition of sP26
fof(lit_def_028,axiom,
! [X0] :
( sP26(X0)
<=> $false ) ).
%------ Positive definition of sP24
fof(lit_def_029,axiom,
! [X0] :
( sP24(X0)
<=> $false ) ).
%------ Positive definition of sP20
fof(lit_def_030,axiom,
! [X0] :
( sP20(X0)
<=> $false ) ).
%------ Negative definition of sP22
fof(lit_def_031,axiom,
! [X0] :
( ~ sP22(X0)
<=> $false ) ).
%------ Positive definition of sP18
fof(lit_def_032,axiom,
! [X0] :
( sP18(X0)
<=> $false ) ).
%------ Positive definition of sP21
fof(lit_def_033,axiom,
! [X0] :
( sP21(X0)
<=> $false ) ).
%------ Positive definition of sP19
fof(lit_def_034,axiom,
! [X0] :
( sP19(X0)
<=> $false ) ).
%------ Positive definition of sP13
fof(lit_def_035,axiom,
! [X0] :
( sP13(X0)
<=> $false ) ).
%------ Positive definition of sP17
fof(lit_def_036,axiom,
! [X0] :
( sP17(X0)
<=> $false ) ).
%------ Positive definition of sP15
fof(lit_def_037,axiom,
! [X0] :
( sP15(X0)
<=> $false ) ).
%------ Negative definition of sP16
fof(lit_def_038,axiom,
! [X0] :
( ~ sP16(X0)
<=> $false ) ).
%------ Positive definition of sP14
fof(lit_def_039,axiom,
! [X0] :
( sP14(X0)
<=> $false ) ).
%------ Positive definition of sP12
fof(lit_def_040,axiom,
! [X0] :
( sP12(X0)
<=> $false ) ).
%------ Positive definition of sP7
fof(lit_def_041,axiom,
! [X0] :
( sP7(X0)
<=> $false ) ).
%------ Positive definition of sP11
fof(lit_def_042,axiom,
! [X0] :
( sP11(X0)
<=> $false ) ).
%------ Positive definition of sP9
fof(lit_def_043,axiom,
! [X0] :
( sP9(X0)
<=> $false ) ).
%------ Negative definition of sP10
fof(lit_def_044,axiom,
! [X0] :
( ~ sP10(X0)
<=> $false ) ).
%------ Positive definition of sP8
fof(lit_def_045,axiom,
! [X0] :
( sP8(X0)
<=> $false ) ).
%------ Positive definition of sP6
fof(lit_def_046,axiom,
! [X0] :
( sP6(X0)
<=> $false ) ).
%------ Positive definition of sP5
fof(lit_def_047,axiom,
! [X0] :
( sP5(X0)
<=> $false ) ).
%------ Positive definition of sP0
fof(lit_def_048,axiom,
! [X0] :
( sP0(X0)
<=> $false ) ).
%------ Negative definition of sP4
fof(lit_def_049,axiom,
! [X0] :
( ~ sP4(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of sP2
fof(lit_def_050,axiom,
! [X0] :
( ~ sP2(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of sP3
fof(lit_def_051,axiom,
! [X0] :
( sP3(X0)
<=> $false ) ).
%------ Positive definition of sP1
fof(lit_def_052,axiom,
! [X0] :
( sP1(X0)
<=> $false ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_053,axiom,
( sP0_iProver_split
<=> $true ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_054,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_055,axiom,
( sP2_iProver_split
<=> $true ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_056,axiom,
( sP3_iProver_split
<=> $true ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_057,axiom,
( sP4_iProver_split
<=> $true ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_058,axiom,
( sP5_iProver_split
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_059,axiom,
( sP6_iProver_split
<=> $true ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_060,axiom,
( sP7_iProver_split
<=> $true ) ).
%------ Positive definition of iProver_Flat_sK48
fof(lit_def_061,axiom,
! [X0,X1] :
( iProver_Flat_sK48(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK106
fof(lit_def_062,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK106(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK107
fof(lit_def_063,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK107(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK108
fof(lit_def_064,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK108(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK109
fof(lit_def_065,axiom,
! [X0,X1] :
( iProver_Flat_sK109(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK110
fof(lit_def_066,axiom,
! [X0,X1] :
( iProver_Flat_sK110(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK111
fof(lit_def_067,axiom,
! [X0,X1] :
( iProver_Flat_sK111(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK112
fof(lit_def_068,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK112(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK113
fof(lit_def_069,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK113(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK115
fof(lit_def_070,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK115(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK114
fof(lit_def_071,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK114(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK116
fof(lit_def_072,axiom,
! [X0,X1] :
( iProver_Flat_sK116(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK117
fof(lit_def_073,axiom,
! [X0,X1] :
( iProver_Flat_sK117(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK118
fof(lit_def_074,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK118(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK119
fof(lit_def_075,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK119(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK121
fof(lit_def_076,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK121(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK120
fof(lit_def_077,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK120(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK122
fof(lit_def_078,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK122(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK123
fof(lit_def_079,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK123(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK125
fof(lit_def_080,axiom,
! [X0,X1] :
( iProver_Flat_sK125(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK124
fof(lit_def_081,axiom,
! [X0] :
( iProver_Flat_sK124(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK127
fof(lit_def_082,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK127(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK126
fof(lit_def_083,axiom,
! [X0] :
( iProver_Flat_sK126(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK128
fof(lit_def_084,axiom,
! [X0] :
( ~ iProver_Flat_sK128(X0)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK130
fof(lit_def_085,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK130(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK129
fof(lit_def_086,axiom,
! [X0] :
( iProver_Flat_sK129(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK131
fof(lit_def_087,axiom,
! [X0] :
( ~ iProver_Flat_sK131(X0)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK132
fof(lit_def_088,axiom,
! [X0] :
( iProver_Flat_sK132(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK133
fof(lit_def_089,axiom,
! [X0] :
( iProver_Flat_sK133(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK146
fof(lit_def_090,axiom,
! [X0] :
( iProver_Flat_sK146(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK147
fof(lit_def_091,axiom,
! [X0] :
( iProver_Flat_sK147(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK148
fof(lit_def_092,axiom,
! [X0] :
( iProver_Flat_sK148(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK149
fof(lit_def_093,axiom,
! [X0] :
( iProver_Flat_sK149(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK150
fof(lit_def_094,axiom,
! [X0] :
( iProver_Flat_sK150(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK151
fof(lit_def_095,axiom,
! [X0] :
( iProver_Flat_sK151(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK152
fof(lit_def_096,axiom,
! [X0] :
( iProver_Flat_sK152(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL677+1.015 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d SAT
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 17:41:27 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.21/1.13 % SZS status Started for theBenchmark.p
% 3.21/1.13 % SZS status CounterSatisfiable for theBenchmark.p
% 3.21/1.13
% 3.21/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.21/1.13
% 3.21/1.13 ------ iProver source info
% 3.21/1.13
% 3.21/1.13 git: date: 2023-05-31 18:12:56 +0000
% 3.21/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.21/1.13 git: non_committed_changes: false
% 3.21/1.13 git: last_make_outside_of_git: false
% 3.21/1.13
% 3.21/1.13 ------ Parsing...
% 3.21/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.21/1.13
% 3.21/1.13 ------ Preprocessing... sf_s rm: 308 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.21/1.13
% 3.21/1.13 ------ Preprocessing... gs_s sp: 11 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.21/1.13 ------ Proving...
% 3.21/1.13 ------ Problem Properties
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 clauses 90
% 3.21/1.13 conjectures 46
% 3.21/1.13 EPR 46
% 3.21/1.13 Horn 35
% 3.21/1.13 unary 10
% 3.21/1.13 binary 15
% 3.21/1.13 lits 368
% 3.21/1.13 lits eq 0
% 3.21/1.13 fd_pure 0
% 3.21/1.13 fd_pseudo 0
% 3.21/1.13 fd_cond 0
% 3.21/1.13 fd_pseudo_cond 0
% 3.21/1.13 AC symbols 0
% 3.21/1.13
% 3.21/1.13 ------ Input Options Time Limit: Unbounded
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 ------ Finite Models:
% 3.21/1.13
% 3.21/1.13 ------ lit_activity_flag true
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 ------ Trying domains of size >= : 1
% 3.21/1.13
% 3.21/1.13 ------ Trying domains of size >= : 2
% 3.21/1.13
% 3.21/1.13 ------ Trying domains of size >= : 2
% 3.21/1.13
% 3.21/1.13 ------ Trying domains of size >= : 2
% 3.21/1.13 ------
% 3.21/1.13 Current options:
% 3.21/1.13 ------
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 ------ Proving...
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 % SZS status CounterSatisfiable for theBenchmark.p
% 3.21/1.13
% 3.21/1.13 ------ Building Model...Done
% 3.21/1.13
% 3.21/1.13 %------ The model is defined over ground terms (initial term algebra).
% 3.21/1.13 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.21/1.13 %------ where \phi is a formula over the term algebra.
% 3.21/1.13 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.21/1.13 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.21/1.13 %------ See help for --sat_out_model for different model outputs.
% 3.21/1.13 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.21/1.13 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.21/1.13 % SZS output start Model for theBenchmark.p
% See solution above
% 3.21/1.14 ------ Statistics
% 3.21/1.14
% 3.21/1.14 ------ Problem properties
% 3.21/1.14
% 3.21/1.14 clauses: 90
% 3.21/1.14 conjectures: 46
% 3.21/1.14 epr: 46
% 3.21/1.14 horn: 35
% 3.21/1.14 ground: 17
% 3.21/1.14 unary: 10
% 3.21/1.14 binary: 15
% 3.21/1.14 lits: 368
% 3.21/1.14 lits_eq: 0
% 3.21/1.14 fd_pure: 0
% 3.21/1.14 fd_pseudo: 0
% 3.21/1.14 fd_cond: 0
% 3.21/1.14 fd_pseudo_cond: 0
% 3.21/1.14 ac_symbols: 0
% 3.21/1.14
% 3.21/1.14 ------ General
% 3.21/1.14
% 3.21/1.14 abstr_ref_over_cycles: 0
% 3.21/1.14 abstr_ref_under_cycles: 0
% 3.21/1.14 gc_basic_clause_elim: 0
% 3.21/1.14 num_of_symbols: 342
% 3.21/1.14 num_of_terms: 3423
% 3.21/1.14
% 3.21/1.14 parsing_time: 0.041
% 3.21/1.14 unif_index_cands_time: 0.
% 3.21/1.14 unif_index_add_time: 0.
% 3.21/1.14 orderings_time: 0.
% 3.21/1.14 out_proof_time: 0.
% 3.21/1.14 total_time: 0.276
% 3.21/1.14
% 3.21/1.14 ------ Preprocessing
% 3.21/1.14
% 3.21/1.14 num_of_splits: 11
% 3.21/1.14 num_of_split_atoms: 8
% 3.21/1.14 num_of_reused_defs: 3
% 3.21/1.14 num_eq_ax_congr_red: 0
% 3.21/1.14 num_of_sem_filtered_clauses: 308
% 3.21/1.14 num_of_subtypes: 0
% 3.21/1.14 monotx_restored_types: 0
% 3.21/1.14 sat_num_of_epr_types: 0
% 3.21/1.14 sat_num_of_non_cyclic_types: 0
% 3.21/1.14 sat_guarded_non_collapsed_types: 0
% 3.21/1.14 num_pure_diseq_elim: 0
% 3.21/1.14 simp_replaced_by: 0
% 3.21/1.14 res_preprocessed: 0
% 3.21/1.14 sup_preprocessed: 0
% 3.21/1.14 prep_upred: 0
% 3.21/1.14 prep_unflattend: 0
% 3.21/1.14 prep_well_definedness: 0
% 3.21/1.14 smt_new_axioms: 0
% 3.21/1.14 pred_elim_cands: 11
% 3.21/1.14 pred_elim: 0
% 3.21/1.14 pred_elim_cl: 0
% 3.21/1.14 pred_elim_cycles: 14
% 3.21/1.14 merged_defs: 0
% 3.21/1.14 merged_defs_ncl: 0
% 3.21/1.14 bin_hyper_res: 0
% 3.21/1.14 prep_cycles: 2
% 3.21/1.14
% 3.21/1.14 splitting_time: 0.
% 3.21/1.14 sem_filter_time: 0.002
% 3.21/1.14 monotx_time: 0.
% 3.21/1.14 subtype_inf_time: 0.
% 3.21/1.14 res_prep_time: 0.087
% 3.21/1.14 sup_prep_time: 0.
% 3.21/1.14 pred_elim_time: 0.053
% 3.21/1.14 bin_hyper_res_time: 0.001
% 3.21/1.14 prep_time_total: 0.181
% 3.21/1.14
% 3.21/1.14 ------ Propositional Solver
% 3.21/1.14
% 3.21/1.14 prop_solver_calls: 17
% 3.21/1.14 prop_fast_solver_calls: 10571
% 3.21/1.14 smt_solver_calls: 0
% 3.21/1.14 smt_fast_solver_calls: 0
% 3.21/1.14 prop_num_of_clauses: 1335
% 3.21/1.14 prop_preprocess_simplified: 8218
% 3.21/1.14 prop_fo_subsumed: 0
% 3.21/1.14
% 3.21/1.14 prop_solver_time: 0.001
% 3.21/1.14 prop_fast_solver_time: 0.013
% 3.21/1.14 prop_unsat_core_time: 0.
% 3.21/1.14 smt_solver_time: 0.
% 3.21/1.14 smt_fast_solver_time: 0.
% 3.21/1.14
% 3.21/1.14 ------ QBF
% 3.21/1.14
% 3.21/1.14 qbf_q_res: 0
% 3.21/1.14 qbf_num_tautologies: 0
% 3.21/1.14 qbf_prep_cycles: 0
% 3.21/1.14
% 3.21/1.14 ------ BMC1
% 3.21/1.14
% 3.21/1.14 bmc1_current_bound: -1
% 3.21/1.14 bmc1_last_solved_bound: -1
% 3.21/1.14 bmc1_unsat_core_size: -1
% 3.21/1.14 bmc1_unsat_core_parents_size: -1
% 3.21/1.14 bmc1_merge_next_fun: 0
% 3.21/1.14
% 3.21/1.14 bmc1_unsat_core_clauses_time: 0.
% 3.21/1.14
% 3.21/1.14 ------ Instantiation
% 3.21/1.14
% 3.21/1.14 inst_num_of_clauses: 275
% 3.21/1.14 inst_num_in_passive: 0
% 3.21/1.14 inst_num_in_active: 275
% 3.21/1.14 inst_num_of_loops: 318
% 3.21/1.14 inst_num_in_unprocessed: 0
% 3.21/1.14 inst_num_of_learning_restarts: 0
% 3.21/1.14 inst_num_moves_active_passive: 30
% 3.21/1.14 inst_lit_activity: 0
% 3.21/1.14 inst_lit_activity_moves: 0
% 3.21/1.14 inst_num_tautologies: 0
% 3.21/1.14 inst_num_prop_implied: 0
% 3.21/1.14 inst_num_existing_simplified: 0
% 3.21/1.14 inst_num_eq_res_simplified: 0
% 3.21/1.14 inst_num_child_elim: 0
% 3.21/1.14 inst_num_of_dismatching_blockings: 0
% 3.21/1.14 inst_num_of_non_proper_insts: 274
% 3.21/1.14 inst_num_of_duplicates: 0
% 3.21/1.14 inst_inst_num_from_inst_to_res: 0
% 3.21/1.14
% 3.21/1.14 inst_time_sim_new: 0.006
% 3.21/1.14 inst_time_sim_given: 0.
% 3.21/1.14 inst_time_dismatching_checking: 0.
% 3.21/1.14 inst_time_total: 0.022
% 3.21/1.14
% 3.21/1.14 ------ Resolution
% 3.21/1.14
% 3.21/1.14 res_num_of_clauses: 82
% 3.21/1.14 res_num_in_passive: 0
% 3.21/1.14 res_num_in_active: 0
% 3.21/1.14 res_num_of_loops: 474
% 3.21/1.14 res_forward_subset_subsumed: 24
% 3.21/1.14 res_backward_subset_subsumed: 0
% 3.21/1.14 res_forward_subsumed: 0
% 3.21/1.14 res_backward_subsumed: 0
% 3.21/1.14 res_forward_subsumption_resolution: 0
% 3.21/1.14 res_backward_subsumption_resolution: 0
% 3.21/1.14 res_clause_to_clause_subsumption: 6015
% 3.21/1.14 res_subs_bck_cnt: 183
% 3.21/1.14 res_orphan_elimination: 0
% 3.21/1.14 res_tautology_del: 80
% 3.21/1.14 res_num_eq_res_simplified: 0
% 3.21/1.14 res_num_sel_changes: 0
% 3.21/1.14 res_moves_from_active_to_pass: 0
% 3.21/1.14
% 3.21/1.14 res_time_sim_new: 0.013
% 3.21/1.14 res_time_sim_fw_given: 0.047
% 3.21/1.14 res_time_sim_bw_given: 0.019
% 3.21/1.14 res_time_total: 0.014
% 3.21/1.14
% 3.21/1.14 ------ Superposition
% 3.21/1.14
% 3.21/1.14 sup_num_of_clauses: undef
% 3.21/1.14 sup_num_in_active: undef
% 3.21/1.14 sup_num_in_passive: undef
% 3.21/1.14 sup_num_of_loops: 0
% 3.21/1.14 sup_fw_superposition: 0
% 3.21/1.14 sup_bw_superposition: 0
% 3.21/1.14 sup_eq_factoring: 0
% 3.21/1.14 sup_eq_resolution: 0
% 3.21/1.14 sup_immediate_simplified: 0
% 3.21/1.14 sup_given_eliminated: 0
% 3.21/1.14 comparisons_done: 0
% 3.21/1.14 comparisons_avoided: 0
% 3.21/1.14 comparisons_inc_criteria: 0
% 3.21/1.14 sup_deep_cl_discarded: 0
% 3.21/1.14 sup_num_of_deepenings: 0
% 3.21/1.14 sup_num_of_restarts: 0
% 3.21/1.14
% 3.21/1.14 sup_time_generating: 0.
% 3.21/1.14 sup_time_sim_fw_full: 0.
% 3.21/1.14 sup_time_sim_bw_full: 0.
% 3.21/1.14 sup_time_sim_fw_immed: 0.
% 3.21/1.14 sup_time_sim_bw_immed: 0.
% 3.21/1.14 sup_time_prep_sim_fw_input: 0.
% 3.21/1.14 sup_time_prep_sim_bw_input: 0.
% 3.21/1.14 sup_time_total: 0.
% 3.21/1.14
% 3.21/1.14 ------ Simplifications
% 3.21/1.14
% 3.21/1.14 sim_repeated: 0
% 3.21/1.14 sim_fw_subset_subsumed: 0
% 3.21/1.14 sim_bw_subset_subsumed: 0
% 3.21/1.14 sim_fw_subsumed: 0
% 3.21/1.14 sim_bw_subsumed: 0
% 3.21/1.14 sim_fw_subsumption_res: 0
% 3.21/1.14 sim_bw_subsumption_res: 0
% 3.21/1.14 sim_fw_unit_subs: 0
% 3.21/1.14 sim_bw_unit_subs: 0
% 3.21/1.14 sim_tautology_del: 0
% 3.21/1.14 sim_eq_tautology_del: 0
% 3.21/1.14 sim_eq_res_simp: 0
% 3.21/1.14 sim_fw_demodulated: 0
% 3.21/1.14 sim_bw_demodulated: 0
% 3.21/1.14 sim_encompassment_demod: 0
% 3.21/1.14 sim_light_normalised: 0
% 3.21/1.14 sim_ac_normalised: 0
% 3.21/1.14 sim_joinable_taut: 0
% 3.21/1.14 sim_joinable_simp: 0
% 3.21/1.14 sim_fw_ac_demod: 0
% 3.21/1.14 sim_bw_ac_demod: 0
% 3.21/1.14 sim_smt_subsumption: 0
% 3.21/1.14 sim_smt_simplified: 0
% 3.21/1.14 sim_ground_joinable: 0
% 3.21/1.14 sim_bw_ground_joinable: 0
% 3.21/1.14 sim_connectedness: 0
% 3.21/1.14
% 3.21/1.14 sim_time_fw_subset_subs: 0.
% 3.21/1.14 sim_time_bw_subset_subs: 0.
% 3.21/1.14 sim_time_fw_subs: 0.
% 3.21/1.14 sim_time_bw_subs: 0.
% 3.21/1.14 sim_time_fw_subs_res: 0.
% 3.21/1.14 sim_time_bw_subs_res: 0.
% 3.21/1.14 sim_time_fw_unit_subs: 0.
% 3.21/1.14 sim_time_bw_unit_subs: 0.
% 3.21/1.14 sim_time_tautology_del: 0.
% 3.21/1.14 sim_time_eq_tautology_del: 0.
% 3.21/1.14 sim_time_eq_res_simp: 0.
% 3.21/1.14 sim_time_fw_demod: 0.
% 3.21/1.14 sim_time_bw_demod: 0.
% 3.21/1.14 sim_time_light_norm: 0.
% 3.21/1.14 sim_time_joinable: 0.
% 3.21/1.14 sim_time_ac_norm: 0.
% 3.21/1.14 sim_time_fw_ac_demod: 0.
% 3.21/1.14 sim_time_bw_ac_demod: 0.
% 3.21/1.14 sim_time_smt_subs: 0.
% 3.21/1.14 sim_time_fw_gjoin: 0.
% 3.21/1.14 sim_time_fw_connected: 0.
% 3.21/1.14
% 3.21/1.14
%------------------------------------------------------------------------------