TSTP Solution File: LCL641+1.015 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : LCL641+1.015 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n004.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:55:17 EDT 2023
% Result : CounterSatisfiable 11.48s 2.15s
% Output : Model 11.48s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of sP0
fof(lit_def,axiom,
! [X0] :
( sP0(X0)
<=> $false ) ).
%------ Negative definition of p1
fof(lit_def_001,axiom,
! [X0] :
( ~ p1(X0)
<=> ( X0 = iProver_Domain_i_1
| X0 = iProver_Domain_i_2 ) ) ).
%------ Positive definition of r1
fof(lit_def_002,axiom,
! [X0,X1] :
( r1(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X0 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X1 != iProver_Domain_i_2 ) ) ) ).
%------ Positive definition of sP3
fof(lit_def_003,axiom,
! [X0] :
( sP3(X0)
<=> $true ) ).
%------ Positive definition of sP2
fof(lit_def_004,axiom,
! [X0] :
( sP2(X0)
<=> $true ) ).
%------ Negative definition of sP1
fof(lit_def_005,axiom,
! [X0] :
( ~ sP1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK4
fof(lit_def_006,axiom,
! [X0,X1] :
( iProver_Flat_sK4(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK5
fof(lit_def_007,axiom,
! [X0,X1] :
( iProver_Flat_sK5(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK6
fof(lit_def_008,axiom,
! [X0,X1] :
( iProver_Flat_sK6(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK7
fof(lit_def_009,axiom,
! [X0,X1] :
( iProver_Flat_sK7(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK8
fof(lit_def_010,axiom,
! [X0,X1] :
( iProver_Flat_sK8(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_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 ) ) ) ).
%------ Negative definition of iProver_Flat_sK9
fof(lit_def_011,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK9(X0,X1)
<=> ( ( X1 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_2
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_sK10
fof(lit_def_012,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK10(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK11
fof(lit_def_013,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK11(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK12
fof(lit_def_014,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK12(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK14
fof(lit_def_015,axiom,
! [X0,X1] :
( iProver_Flat_sK14(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK13
fof(lit_def_016,axiom,
! [X0] :
( iProver_Flat_sK13(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK15
fof(lit_def_017,axiom,
! [X0,X1] :
( iProver_Flat_sK15(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK16
fof(lit_def_018,axiom,
! [X0,X1] :
( iProver_Flat_sK16(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK17
fof(lit_def_019,axiom,
! [X0,X1] :
( iProver_Flat_sK17(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK18
fof(lit_def_020,axiom,
! [X0,X1] :
( iProver_Flat_sK18(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK19
fof(lit_def_021,axiom,
! [X0,X1] :
( iProver_Flat_sK19(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK20
fof(lit_def_022,axiom,
! [X0,X1] :
( iProver_Flat_sK20(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK21
fof(lit_def_023,axiom,
! [X0,X1] :
( iProver_Flat_sK21(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK22
fof(lit_def_024,axiom,
! [X0,X1] :
( iProver_Flat_sK22(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK23
fof(lit_def_025,axiom,
! [X0,X1] :
( iProver_Flat_sK23(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK24
fof(lit_def_026,axiom,
! [X0,X1] :
( iProver_Flat_sK24(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK25
fof(lit_def_027,axiom,
! [X0,X1] :
( iProver_Flat_sK25(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK26
fof(lit_def_028,axiom,
! [X0,X1] :
( iProver_Flat_sK26(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK27
fof(lit_def_029,axiom,
! [X0,X1] :
( iProver_Flat_sK27(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK28
fof(lit_def_030,axiom,
! [X0,X1] :
( iProver_Flat_sK28(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK29
fof(lit_def_031,axiom,
! [X0,X1] :
( iProver_Flat_sK29(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK30
fof(lit_def_032,axiom,
! [X0,X1] :
( iProver_Flat_sK30(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK31
fof(lit_def_033,axiom,
! [X0,X1] :
( iProver_Flat_sK31(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK32
fof(lit_def_034,axiom,
! [X0,X1] :
( iProver_Flat_sK32(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK33
fof(lit_def_035,axiom,
! [X0,X1] :
( iProver_Flat_sK33(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK34
fof(lit_def_036,axiom,
! [X0,X1] :
( iProver_Flat_sK34(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK51
fof(lit_def_037,axiom,
! [X0,X1] :
( iProver_Flat_sK51(X0,X1)
<=> ( ( X0 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_sK50
fof(lit_def_038,axiom,
! [X0] :
( iProver_Flat_sK50(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK52
fof(lit_def_039,axiom,
! [X0,X1] :
( iProver_Flat_sK52(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_1 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2 ) ) ) ).
%------ Positive definition of iProver_Flat_sK53
fof(lit_def_040,axiom,
! [X0] :
( iProver_Flat_sK53(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_sK49
fof(lit_def_041,axiom,
! [X0] :
( iProver_Flat_sK49(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK48
fof(lit_def_042,axiom,
! [X0] :
( iProver_Flat_sK48(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK47
fof(lit_def_043,axiom,
! [X0] :
( iProver_Flat_sK47(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK46
fof(lit_def_044,axiom,
! [X0] :
( iProver_Flat_sK46(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK45
fof(lit_def_045,axiom,
! [X0] :
( iProver_Flat_sK45(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK44
fof(lit_def_046,axiom,
! [X0] :
( iProver_Flat_sK44(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK43
fof(lit_def_047,axiom,
! [X0] :
( iProver_Flat_sK43(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK42
fof(lit_def_048,axiom,
! [X0] :
( iProver_Flat_sK42(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK41
fof(lit_def_049,axiom,
! [X0] :
( iProver_Flat_sK41(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK40
fof(lit_def_050,axiom,
! [X0] :
( iProver_Flat_sK40(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK39
fof(lit_def_051,axiom,
! [X0] :
( iProver_Flat_sK39(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK38
fof(lit_def_052,axiom,
! [X0] :
( iProver_Flat_sK38(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK37
fof(lit_def_053,axiom,
! [X0] :
( iProver_Flat_sK37(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK36
fof(lit_def_054,axiom,
! [X0] :
( iProver_Flat_sK36(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK35
fof(lit_def_055,axiom,
! [X0] :
( iProver_Flat_sK35(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK54
fof(lit_def_056,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK54(X0,X1)
<=> ( X1 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of iProver_Flat_sK55
fof(lit_def_057,axiom,
! [X0,X1] :
( iProver_Flat_sK55(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK56
fof(lit_def_058,axiom,
! [X0,X1] :
( iProver_Flat_sK56(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK57
fof(lit_def_059,axiom,
! [X0,X1] :
( iProver_Flat_sK57(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK58
fof(lit_def_060,axiom,
! [X0,X1] :
( iProver_Flat_sK58(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK59
fof(lit_def_061,axiom,
! [X0,X1] :
( iProver_Flat_sK59(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK60
fof(lit_def_062,axiom,
! [X0,X1] :
( iProver_Flat_sK60(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK61
fof(lit_def_063,axiom,
! [X0,X1] :
( iProver_Flat_sK61(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK62
fof(lit_def_064,axiom,
! [X0,X1] :
( iProver_Flat_sK62(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK63
fof(lit_def_065,axiom,
! [X0,X1] :
( iProver_Flat_sK63(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK64
fof(lit_def_066,axiom,
! [X0,X1] :
( iProver_Flat_sK64(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK65
fof(lit_def_067,axiom,
! [X0,X1] :
( iProver_Flat_sK65(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK66
fof(lit_def_068,axiom,
! [X0,X1] :
( iProver_Flat_sK66(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK67
fof(lit_def_069,axiom,
! [X0,X1] :
( iProver_Flat_sK67(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK68
fof(lit_def_070,axiom,
! [X0,X1] :
( iProver_Flat_sK68(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK69
fof(lit_def_071,axiom,
! [X0,X1] :
( iProver_Flat_sK69(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK70
fof(lit_def_072,axiom,
! [X0,X1] :
( iProver_Flat_sK70(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK71
fof(lit_def_073,axiom,
! [X0,X1] :
( iProver_Flat_sK71(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK72
fof(lit_def_074,axiom,
! [X0,X1] :
( iProver_Flat_sK72(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK73
fof(lit_def_075,axiom,
! [X0,X1] :
( iProver_Flat_sK73(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL641+1.015 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 300
% 0.20/0.35 % DateTime : Thu Aug 24 22:03:38 EDT 2023
% 0.20/0.35 % CPUTime :
% 0.21/0.47 Running model finding
% 0.21/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
% 11.48/2.15 % SZS status Started for theBenchmark.p
% 11.48/2.15 % SZS status CounterSatisfiable for theBenchmark.p
% 11.48/2.15
% 11.48/2.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 11.48/2.15
% 11.48/2.15 ------ iProver source info
% 11.48/2.15
% 11.48/2.15 git: date: 2023-05-31 18:12:56 +0000
% 11.48/2.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 11.48/2.15 git: non_committed_changes: false
% 11.48/2.15 git: last_make_outside_of_git: false
% 11.48/2.15
% 11.48/2.15 ------ Parsing...
% 11.48/2.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 11.48/2.15
% 11.48/2.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 11.48/2.15
% 11.48/2.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.48/2.15 ------ Proving...
% 11.48/2.15 ------ Problem Properties
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 clauses 155
% 11.48/2.15 conjectures 134
% 11.48/2.15 EPR 21
% 11.48/2.15 Horn 43
% 11.48/2.15 unary 18
% 11.48/2.15 binary 5
% 11.48/2.15 lits 1758
% 11.48/2.15 lits eq 0
% 11.48/2.15 fd_pure 0
% 11.48/2.15 fd_pseudo 0
% 11.48/2.15 fd_cond 0
% 11.48/2.15 fd_pseudo_cond 0
% 11.48/2.15 AC symbols 0
% 11.48/2.15
% 11.48/2.15 ------ Input Options Time Limit: Unbounded
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Finite Models:
% 11.48/2.15
% 11.48/2.15 ------ lit_activity_flag true
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 1
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15 ------
% 11.48/2.15 Current options:
% 11.48/2.15 ------
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Proving...
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Proving...
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Proving...
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 2
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Proving...
% 11.48/2.15
% 11.48/2.15 ------ Trying domains of size >= : 3
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 ------ Proving...
% 11.48/2.15
% 11.48/2.15
% 11.48/2.15 % SZS status CounterSatisfiable for theBenchmark.p
% 11.48/2.15
% 11.48/2.15 ------ Building Model...Done
% 11.48/2.15
% 11.48/2.15 %------ The model is defined over ground terms (initial term algebra).
% 11.48/2.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 11.48/2.15 %------ where \phi is a formula over the term algebra.
% 11.48/2.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 11.48/2.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 11.48/2.15 %------ See help for --sat_out_model for different model outputs.
% 11.48/2.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 11.48/2.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 11.48/2.15 % SZS output start Model for theBenchmark.p
% See solution above
% 11.48/2.15 ------ Statistics
% 11.48/2.15
% 11.48/2.15 ------ Problem properties
% 11.48/2.15
% 11.48/2.15 clauses: 155
% 11.48/2.15 conjectures: 134
% 11.48/2.15 epr: 21
% 11.48/2.15 horn: 43
% 11.48/2.15 ground: 18
% 11.48/2.15 unary: 18
% 11.48/2.15 binary: 5
% 11.48/2.15 lits: 1758
% 11.48/2.15 lits_eq: 0
% 11.48/2.15 fd_pure: 0
% 11.48/2.15 fd_pseudo: 0
% 11.48/2.15 fd_cond: 0
% 11.48/2.15 fd_pseudo_cond: 0
% 11.48/2.15 ac_symbols: 0
% 11.48/2.15
% 11.48/2.15 ------ General
% 11.48/2.15
% 11.48/2.15 abstr_ref_over_cycles: 0
% 11.48/2.15 abstr_ref_under_cycles: 0
% 11.48/2.15 gc_basic_clause_elim: 0
% 11.48/2.15 num_of_symbols: 336
% 11.48/2.15 num_of_terms: 5217
% 11.48/2.15
% 11.48/2.15 parsing_time: 0.021
% 11.48/2.15 unif_index_cands_time: 0.034
% 11.48/2.15 unif_index_add_time: 0.006
% 11.48/2.15 orderings_time: 0.
% 11.48/2.15 out_proof_time: 0.
% 11.48/2.15 total_time: 1.388
% 11.48/2.15
% 11.48/2.15 ------ Preprocessing
% 11.48/2.15
% 11.48/2.15 num_of_splits: 0
% 11.48/2.15 num_of_split_atoms: 0
% 11.48/2.15 num_of_reused_defs: 0
% 11.48/2.15 num_eq_ax_congr_red: 0
% 11.48/2.15 num_of_sem_filtered_clauses: 0
% 11.48/2.15 num_of_subtypes: 0
% 11.48/2.15 monotx_restored_types: 0
% 11.48/2.15 sat_num_of_epr_types: 0
% 11.48/2.15 sat_num_of_non_cyclic_types: 0
% 11.48/2.15 sat_guarded_non_collapsed_types: 0
% 11.48/2.15 num_pure_diseq_elim: 0
% 11.48/2.15 simp_replaced_by: 0
% 11.48/2.15 res_preprocessed: 0
% 11.48/2.15 sup_preprocessed: 0
% 11.48/2.15 prep_upred: 0
% 11.48/2.15 prep_unflattend: 0
% 11.48/2.15 prep_well_definedness: 0
% 11.48/2.15 smt_new_axioms: 0
% 11.48/2.15 pred_elim_cands: 6
% 11.48/2.15 pred_elim: 0
% 11.48/2.15 pred_elim_cl: 0
% 11.48/2.15 pred_elim_cycles: 4
% 11.48/2.15 merged_defs: 0
% 11.48/2.15 merged_defs_ncl: 0
% 11.48/2.15 bin_hyper_res: 0
% 11.48/2.15 prep_cycles: 1
% 11.48/2.15
% 11.48/2.15 splitting_time: 0.
% 11.48/2.15 sem_filter_time: 0.004
% 11.48/2.15 monotx_time: 0.
% 11.48/2.15 subtype_inf_time: 0.
% 11.48/2.15 res_prep_time: 0.074
% 11.48/2.15 sup_prep_time: 0.
% 11.48/2.15 pred_elim_time: 0.019
% 11.48/2.15 bin_hyper_res_time: 0.
% 11.48/2.15 prep_time_total: 0.109
% 11.48/2.15
% 11.48/2.15 ------ Propositional Solver
% 11.48/2.15
% 11.48/2.15 prop_solver_calls: 42
% 11.48/2.15 prop_fast_solver_calls: 6148
% 11.48/2.15 smt_solver_calls: 0
% 11.48/2.15 smt_fast_solver_calls: 0
% 11.48/2.15 prop_num_of_clauses: 4727
% 11.48/2.15 prop_preprocess_simplified: 25078
% 11.48/2.15 prop_fo_subsumed: 0
% 11.48/2.15
% 11.48/2.15 prop_solver_time: 0.004
% 11.48/2.15 prop_fast_solver_time: 0.02
% 11.48/2.15 prop_unsat_core_time: 0.
% 11.48/2.15 smt_solver_time: 0.
% 11.48/2.15 smt_fast_solver_time: 0.
% 11.48/2.15
% 11.48/2.15 ------ QBF
% 11.48/2.15
% 11.48/2.15 qbf_q_res: 0
% 11.48/2.15 qbf_num_tautologies: 0
% 11.48/2.15 qbf_prep_cycles: 0
% 11.48/2.15
% 11.48/2.15 ------ BMC1
% 11.48/2.15
% 11.48/2.15 bmc1_current_bound: -1
% 11.48/2.15 bmc1_last_solved_bound: -1
% 11.48/2.15 bmc1_unsat_core_size: -1
% 11.48/2.15 bmc1_unsat_core_parents_size: -1
% 11.48/2.15 bmc1_merge_next_fun: 0
% 11.48/2.15
% 11.48/2.15 bmc1_unsat_core_clauses_time: 0.
% 11.48/2.15
% 11.48/2.15 ------ Instantiation
% 11.48/2.15
% 11.48/2.15 inst_num_of_clauses: 1517
% 11.48/2.15 inst_num_in_passive: 0
% 11.48/2.15 inst_num_in_active: 5223
% 11.48/2.15 inst_num_of_loops: 5972
% 11.48/2.15 inst_num_in_unprocessed: 0
% 11.48/2.15 inst_num_of_learning_restarts: 1
% 11.48/2.15 inst_num_moves_active_passive: 685
% 11.48/2.15 inst_lit_activity: 0
% 11.48/2.15 inst_lit_activity_moves: 0
% 11.48/2.15 inst_num_tautologies: 0
% 11.48/2.15 inst_num_prop_implied: 0
% 11.48/2.15 inst_num_existing_simplified: 0
% 11.48/2.15 inst_num_eq_res_simplified: 0
% 11.48/2.15 inst_num_child_elim: 0
% 11.48/2.15 inst_num_of_dismatching_blockings: 3326
% 11.48/2.15 inst_num_of_non_proper_insts: 5251
% 11.48/2.15 inst_num_of_duplicates: 0
% 11.48/2.15 inst_inst_num_from_inst_to_res: 0
% 11.48/2.15
% 11.48/2.15 inst_time_sim_new: 0.298
% 11.48/2.15 inst_time_sim_given: 0.
% 11.48/2.15 inst_time_dismatching_checking: 0.056
% 11.48/2.15 inst_time_total: 1.173
% 11.48/2.15
% 11.48/2.15 ------ Resolution
% 11.48/2.15
% 11.48/2.15 res_num_of_clauses: 155
% 11.48/2.15 res_num_in_passive: 0
% 11.48/2.15 res_num_in_active: 0
% 11.48/2.15 res_num_of_loops: 156
% 11.48/2.15 res_forward_subset_subsumed: 19
% 11.48/2.15 res_backward_subset_subsumed: 0
% 11.48/2.15 res_forward_subsumed: 0
% 11.48/2.15 res_backward_subsumed: 0
% 11.48/2.15 res_forward_subsumption_resolution: 0
% 11.48/2.15 res_backward_subsumption_resolution: 0
% 11.48/2.15 res_clause_to_clause_subsumption: 576
% 11.48/2.15 res_subs_bck_cnt: 10
% 11.48/2.15 res_orphan_elimination: 0
% 11.48/2.15 res_tautology_del: 5455
% 11.48/2.15 res_num_eq_res_simplified: 0
% 11.48/2.15 res_num_sel_changes: 0
% 11.48/2.15 res_moves_from_active_to_pass: 0
% 11.48/2.15
% 11.48/2.15 res_time_sim_new: 0.014
% 11.48/2.15 res_time_sim_fw_given: 0.045
% 11.48/2.15 res_time_sim_bw_given: 0.01
% 11.48/2.15 res_time_total: 0.014
% 11.48/2.15
% 11.48/2.15 ------ Superposition
% 11.48/2.15
% 11.48/2.15 sup_num_of_clauses: undef
% 11.48/2.15 sup_num_in_active: undef
% 11.48/2.15 sup_num_in_passive: undef
% 11.48/2.15 sup_num_of_loops: 0
% 11.48/2.15 sup_fw_superposition: 0
% 11.48/2.15 sup_bw_superposition: 0
% 11.48/2.15 sup_eq_factoring: 0
% 11.48/2.15 sup_eq_resolution: 0
% 11.48/2.15 sup_immediate_simplified: 0
% 11.48/2.15 sup_given_eliminated: 0
% 11.48/2.15 comparisons_done: 0
% 11.48/2.15 comparisons_avoided: 0
% 11.48/2.15 comparisons_inc_criteria: 0
% 11.48/2.15 sup_deep_cl_discarded: 0
% 11.48/2.15 sup_num_of_deepenings: 0
% 11.48/2.15 sup_num_of_restarts: 0
% 11.48/2.15
% 11.48/2.15 sup_time_generating: 0.
% 11.48/2.15 sup_time_sim_fw_full: 0.
% 11.48/2.15 sup_time_sim_bw_full: 0.
% 11.48/2.15 sup_time_sim_fw_immed: 0.
% 11.48/2.15 sup_time_sim_bw_immed: 0.
% 11.48/2.15 sup_time_prep_sim_fw_input: 0.
% 11.48/2.15 sup_time_prep_sim_bw_input: 0.
% 11.48/2.15 sup_time_total: 0.
% 11.48/2.15
% 11.48/2.15 ------ Simplifications
% 11.48/2.15
% 11.48/2.15 sim_repeated: 0
% 11.48/2.15 sim_fw_subset_subsumed: 0
% 11.48/2.15 sim_bw_subset_subsumed: 0
% 11.48/2.15 sim_fw_subsumed: 0
% 11.48/2.15 sim_bw_subsumed: 0
% 11.48/2.15 sim_fw_subsumption_res: 0
% 11.48/2.15 sim_bw_subsumption_res: 0
% 11.48/2.15 sim_fw_unit_subs: 0
% 11.48/2.15 sim_bw_unit_subs: 0
% 11.48/2.15 sim_tautology_del: 0
% 11.48/2.15 sim_eq_tautology_del: 0
% 11.48/2.15 sim_eq_res_simp: 0
% 11.48/2.15 sim_fw_demodulated: 0
% 11.48/2.15 sim_bw_demodulated: 0
% 11.48/2.15 sim_encompassment_demod: 0
% 11.48/2.15 sim_light_normalised: 0
% 11.48/2.15 sim_ac_normalised: 0
% 11.48/2.15 sim_joinable_taut: 0
% 11.48/2.15 sim_joinable_simp: 0
% 11.48/2.15 sim_fw_ac_demod: 0
% 11.48/2.15 sim_bw_ac_demod: 0
% 11.48/2.15 sim_smt_subsumption: 0
% 11.48/2.15 sim_smt_simplified: 0
% 11.48/2.15 sim_ground_joinable: 0
% 11.48/2.15 sim_bw_ground_joinable: 0
% 11.48/2.15 sim_connectedness: 0
% 11.48/2.15
% 11.48/2.15 sim_time_fw_subset_subs: 0.
% 11.48/2.15 sim_time_bw_subset_subs: 0.
% 11.48/2.15 sim_time_fw_subs: 0.
% 11.48/2.15 sim_time_bw_subs: 0.
% 11.48/2.15 sim_time_fw_subs_res: 0.
% 11.48/2.15 sim_time_bw_subs_res: 0.
% 11.48/2.15 sim_time_fw_unit_subs: 0.
% 11.48/2.15 sim_time_bw_unit_subs: 0.
% 11.48/2.15 sim_time_tautology_del: 0.
% 11.48/2.15 sim_time_eq_tautology_del: 0.
% 11.48/2.15 sim_time_eq_res_simp: 0.
% 11.48/2.15 sim_time_fw_demod: 0.
% 11.48/2.15 sim_time_bw_demod: 0.
% 11.48/2.15 sim_time_light_norm: 0.
% 11.48/2.15 sim_time_joinable: 0.
% 11.48/2.15 sim_time_ac_norm: 0.
% 11.48/2.15 sim_time_fw_ac_demod: 0.
% 11.48/2.15 sim_time_bw_ac_demod: 0.
% 11.48/2.15 sim_time_smt_subs: 0.
% 11.48/2.15 sim_time_fw_gjoin: 0.
% 11.48/2.15 sim_time_fw_connected: 0.
% 11.48/2.15
% 11.48/2.15
%------------------------------------------------------------------------------