TSTP Solution File: LCL671+1.010 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : LCL671+1.010 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n021.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:29 EDT 2023
% Result : CounterSatisfiable 2.88s 1.13s
% Output : Model 2.88s
% 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 ) ).
%------ Positive definition of sP7
fof(lit_def_002,axiom,
! [X0] :
( sP7(X0)
<=> $true ) ).
%------ Positive definition of sP6
fof(lit_def_003,axiom,
! [X0] :
( sP6(X0)
<=> $true ) ).
%------ Positive definition of sP5
fof(lit_def_004,axiom,
! [X0] :
( sP5(X0)
<=> $true ) ).
%------ Positive definition of sP4
fof(lit_def_005,axiom,
! [X0] :
( sP4(X0)
<=> $true ) ).
%------ Positive definition of sP3
fof(lit_def_006,axiom,
! [X0] :
( sP3(X0)
<=> $true ) ).
%------ Positive definition of sP2
fof(lit_def_007,axiom,
! [X0] :
( sP2(X0)
<=> $true ) ).
%------ Positive definition of sP1
fof(lit_def_008,axiom,
! [X0] :
( sP1(X0)
<=> $true ) ).
%------ Positive definition of sP0
fof(lit_def_009,axiom,
! [X0] :
( sP0(X0)
<=> $true ) ).
%------ Positive definition of p2
fof(lit_def_010,axiom,
! [X0] :
( p2(X0)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK8
fof(lit_def_011,axiom,
! [X0,X1] :
( iProver_Flat_sK8(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK9
fof(lit_def_012,axiom,
! [X0,X1] :
( iProver_Flat_sK9(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK10
fof(lit_def_013,axiom,
! [X0,X1] :
( iProver_Flat_sK10(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK11
fof(lit_def_014,axiom,
! [X0,X1] :
( iProver_Flat_sK11(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK12
fof(lit_def_015,axiom,
! [X0,X1] :
( iProver_Flat_sK12(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK13
fof(lit_def_016,axiom,
! [X0,X1] :
( iProver_Flat_sK13(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK14
fof(lit_def_017,axiom,
! [X0,X1] :
( iProver_Flat_sK14(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK15
fof(lit_def_018,axiom,
! [X0,X1] :
( iProver_Flat_sK15(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK16
fof(lit_def_019,axiom,
! [X0,X1] :
( iProver_Flat_sK16(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK17
fof(lit_def_020,axiom,
! [X0,X1] :
( iProver_Flat_sK17(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK18
fof(lit_def_021,axiom,
! [X0,X1] :
( iProver_Flat_sK18(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK19
fof(lit_def_022,axiom,
! [X0,X1] :
( iProver_Flat_sK19(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK20
fof(lit_def_023,axiom,
! [X0,X1] :
( iProver_Flat_sK20(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK21
fof(lit_def_024,axiom,
! [X0,X1] :
( iProver_Flat_sK21(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK22
fof(lit_def_025,axiom,
! [X0,X1] :
( iProver_Flat_sK22(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK23
fof(lit_def_026,axiom,
! [X0,X1] :
( iProver_Flat_sK23(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK24
fof(lit_def_027,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK24(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_sK25
fof(lit_def_028,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK25(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK26
fof(lit_def_029,axiom,
! [X0,X1] :
( iProver_Flat_sK26(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK27
fof(lit_def_030,axiom,
! [X0,X1] :
( iProver_Flat_sK27(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK28
fof(lit_def_031,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK28(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK29
fof(lit_def_032,axiom,
! [X0,X1] :
( iProver_Flat_sK29(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK30
fof(lit_def_033,axiom,
! [X0,X1] :
( iProver_Flat_sK30(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_sK31
fof(lit_def_034,axiom,
! [X0,X1] :
( ~ iProver_Flat_sK31(X0,X1)
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK33
fof(lit_def_035,axiom,
! [X0,X1] :
( iProver_Flat_sK33(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK32
fof(lit_def_036,axiom,
! [X0] :
( iProver_Flat_sK32(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK35
fof(lit_def_037,axiom,
! [X0,X1] :
( iProver_Flat_sK35(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK34
fof(lit_def_038,axiom,
! [X0] :
( iProver_Flat_sK34(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK37
fof(lit_def_039,axiom,
! [X0,X1] :
( iProver_Flat_sK37(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK36
fof(lit_def_040,axiom,
! [X0] :
( iProver_Flat_sK36(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK39
fof(lit_def_041,axiom,
! [X0,X1] :
( iProver_Flat_sK39(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK38
fof(lit_def_042,axiom,
! [X0] :
( iProver_Flat_sK38(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK41
fof(lit_def_043,axiom,
! [X0,X1] :
( iProver_Flat_sK41(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK40
fof(lit_def_044,axiom,
! [X0] :
( iProver_Flat_sK40(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK43
fof(lit_def_045,axiom,
! [X0,X1] :
( iProver_Flat_sK43(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK42
fof(lit_def_046,axiom,
! [X0] :
( iProver_Flat_sK42(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK45
fof(lit_def_047,axiom,
! [X0,X1] :
( iProver_Flat_sK45(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK44
fof(lit_def_048,axiom,
! [X0] :
( iProver_Flat_sK44(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK47
fof(lit_def_049,axiom,
! [X0,X1] :
( iProver_Flat_sK47(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK46
fof(lit_def_050,axiom,
! [X0] :
( iProver_Flat_sK46(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK49
fof(lit_def_051,axiom,
! [X0,X1] :
( iProver_Flat_sK49(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK48
fof(lit_def_052,axiom,
! [X0] :
( iProver_Flat_sK48(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK51
fof(lit_def_053,axiom,
! [X0,X1] :
( iProver_Flat_sK51(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK50
fof(lit_def_054,axiom,
! [X0] :
( iProver_Flat_sK50(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK53
fof(lit_def_055,axiom,
! [X0,X1] :
( iProver_Flat_sK53(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK52
fof(lit_def_056,axiom,
! [X0] :
( iProver_Flat_sK52(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK54
fof(lit_def_058,axiom,
! [X0] :
( iProver_Flat_sK54(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK56
fof(lit_def_060,axiom,
! [X0] :
( iProver_Flat_sK56(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK58
fof(lit_def_062,axiom,
! [X0] :
( iProver_Flat_sK58(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK60
fof(lit_def_064,axiom,
! [X0] :
( iProver_Flat_sK60(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK62
fof(lit_def_066,axiom,
! [X0] :
( iProver_Flat_sK62(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK64
fof(lit_def_068,axiom,
! [X0] :
( iProver_Flat_sK64(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK66
fof(lit_def_070,axiom,
! [X0] :
( iProver_Flat_sK66(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK68
fof(lit_def_072,axiom,
! [X0] :
( iProver_Flat_sK68(X0)
<=> 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_2 ) ).
%------ Positive definition of iProver_Flat_sK70
fof(lit_def_074,axiom,
! [X0] :
( iProver_Flat_sK70(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK73
fof(lit_def_075,axiom,
! [X0] :
( iProver_Flat_sK73(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK72
fof(lit_def_076,axiom,
! [X0] :
( iProver_Flat_sK72(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK74
fof(lit_def_077,axiom,
! [X0] :
( iProver_Flat_sK74(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK76
fof(lit_def_078,axiom,
! [X0] :
( iProver_Flat_sK76(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK75
fof(lit_def_079,axiom,
! [X0] :
( iProver_Flat_sK75(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK77
fof(lit_def_080,axiom,
! [X0] :
( iProver_Flat_sK77(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK79
fof(lit_def_081,axiom,
! [X0] :
( iProver_Flat_sK79(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK78
fof(lit_def_082,axiom,
! [X0] :
( iProver_Flat_sK78(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK80
fof(lit_def_083,axiom,
! [X0] :
( iProver_Flat_sK80(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK82
fof(lit_def_084,axiom,
! [X0] :
( iProver_Flat_sK82(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK81
fof(lit_def_085,axiom,
! [X0] :
( iProver_Flat_sK81(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK83
fof(lit_def_086,axiom,
! [X0] :
( iProver_Flat_sK83(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK85
fof(lit_def_087,axiom,
! [X0] :
( iProver_Flat_sK85(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK84
fof(lit_def_088,axiom,
! [X0] :
( iProver_Flat_sK84(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK86
fof(lit_def_089,axiom,
! [X0] :
( iProver_Flat_sK86(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK88
fof(lit_def_090,axiom,
! [X0] :
( iProver_Flat_sK88(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK87
fof(lit_def_091,axiom,
! [X0] :
( iProver_Flat_sK87(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK89
fof(lit_def_092,axiom,
! [X0] :
( iProver_Flat_sK89(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK91
fof(lit_def_093,axiom,
! [X0] :
( iProver_Flat_sK91(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK90
fof(lit_def_094,axiom,
! [X0] :
( iProver_Flat_sK90(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK92
fof(lit_def_095,axiom,
! [X0] :
( iProver_Flat_sK92(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK94
fof(lit_def_096,axiom,
! [X0] :
( iProver_Flat_sK94(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK93
fof(lit_def_097,axiom,
! [X0] :
( iProver_Flat_sK93(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK95
fof(lit_def_098,axiom,
! [X0] :
( iProver_Flat_sK95(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK97
fof(lit_def_099,axiom,
! [X0] :
( iProver_Flat_sK97(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK96
fof(lit_def_100,axiom,
! [X0] :
( iProver_Flat_sK96(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK98
fof(lit_def_101,axiom,
! [X0] :
( iProver_Flat_sK98(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK100
fof(lit_def_102,axiom,
! [X0] :
( iProver_Flat_sK100(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK99
fof(lit_def_103,axiom,
! [X0] :
( iProver_Flat_sK99(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK101
fof(lit_def_104,axiom,
! [X0] :
( iProver_Flat_sK101(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK103
fof(lit_def_105,axiom,
! [X0] :
( iProver_Flat_sK103(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK102
fof(lit_def_106,axiom,
! [X0] :
( iProver_Flat_sK102(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK104
fof(lit_def_107,axiom,
! [X0] :
( iProver_Flat_sK104(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK106
fof(lit_def_108,axiom,
! [X0] :
( iProver_Flat_sK106(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK105
fof(lit_def_109,axiom,
! [X0] :
( iProver_Flat_sK105(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK107
fof(lit_def_110,axiom,
! [X0] :
( iProver_Flat_sK107(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK109
fof(lit_def_111,axiom,
! [X0] :
( iProver_Flat_sK109(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK108
fof(lit_def_112,axiom,
! [X0] :
( iProver_Flat_sK108(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK110
fof(lit_def_113,axiom,
! [X0] :
( iProver_Flat_sK110(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK112
fof(lit_def_114,axiom,
! [X0] :
( iProver_Flat_sK112(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK111
fof(lit_def_115,axiom,
! [X0] :
( iProver_Flat_sK111(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK113
fof(lit_def_116,axiom,
! [X0] :
( iProver_Flat_sK113(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK115
fof(lit_def_117,axiom,
! [X0] :
( iProver_Flat_sK115(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK114
fof(lit_def_118,axiom,
! [X0] :
( iProver_Flat_sK114(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK116
fof(lit_def_119,axiom,
! [X0] :
( iProver_Flat_sK116(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK118
fof(lit_def_120,axiom,
! [X0] :
( iProver_Flat_sK118(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK117
fof(lit_def_121,axiom,
! [X0] :
( iProver_Flat_sK117(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK119
fof(lit_def_122,axiom,
! [X0] :
( iProver_Flat_sK119(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK121
fof(lit_def_123,axiom,
! [X0] :
( iProver_Flat_sK121(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK120
fof(lit_def_124,axiom,
! [X0] :
( iProver_Flat_sK120(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK122
fof(lit_def_125,axiom,
! [X0] :
( iProver_Flat_sK122(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK124
fof(lit_def_126,axiom,
! [X0] :
( iProver_Flat_sK124(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK123
fof(lit_def_127,axiom,
! [X0] :
( iProver_Flat_sK123(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK125
fof(lit_def_128,axiom,
! [X0] :
( iProver_Flat_sK125(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK127
fof(lit_def_129,axiom,
! [X0] :
( iProver_Flat_sK127(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK126
fof(lit_def_130,axiom,
! [X0] :
( iProver_Flat_sK126(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK128
fof(lit_def_131,axiom,
! [X0] :
( iProver_Flat_sK128(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK129
fof(lit_def_132,axiom,
! [X0,X1] :
( iProver_Flat_sK129(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK130
fof(lit_def_133,axiom,
! [X0,X1] :
( iProver_Flat_sK130(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK131
fof(lit_def_134,axiom,
! [X0,X1] :
( iProver_Flat_sK131(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL671+1.010 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n021.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 : Fri Aug 25 06:22:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running model finding
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.88/1.13 % SZS status Started for theBenchmark.p
% 2.88/1.13 % SZS status CounterSatisfiable for theBenchmark.p
% 2.88/1.13
% 2.88/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.88/1.13
% 2.88/1.13 ------ iProver source info
% 2.88/1.13
% 2.88/1.13 git: date: 2023-05-31 18:12:56 +0000
% 2.88/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.88/1.13 git: non_committed_changes: false
% 2.88/1.13 git: last_make_outside_of_git: false
% 2.88/1.13
% 2.88/1.13 ------ Parsing...
% 2.88/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.88/1.13
% 2.88/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.88/1.13
% 2.88/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.88/1.13 ------ Proving...
% 2.88/1.13 ------ Problem Properties
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 clauses 217
% 2.88/1.13 conjectures 161
% 2.88/1.13 EPR 123
% 2.88/1.13 Horn 190
% 2.88/1.13 unary 96
% 2.88/1.13 binary 21
% 2.88/1.13 lits 746
% 2.88/1.13 lits eq 0
% 2.88/1.13 fd_pure 0
% 2.88/1.13 fd_pseudo 0
% 2.88/1.13 fd_cond 0
% 2.88/1.13 fd_pseudo_cond 0
% 2.88/1.13 AC symbols 0
% 2.88/1.13
% 2.88/1.13 ------ Input Options Time Limit: Unbounded
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 ------ Finite Models:
% 2.88/1.13
% 2.88/1.13 ------ lit_activity_flag true
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 1
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13 ------
% 2.88/1.13 Current options:
% 2.88/1.13 ------
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 ------ Proving...
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 ------ Proving...
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 ------ Proving...
% 2.88/1.13
% 2.88/1.13 ------ Trying domains of size >= : 2
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 ------ Proving...
% 2.88/1.13
% 2.88/1.13
% 2.88/1.13 % SZS status CounterSatisfiable for theBenchmark.p
% 2.88/1.13
% 2.88/1.13 ------ Building Model...Done
% 2.88/1.13
% 2.88/1.13 %------ The model is defined over ground terms (initial term algebra).
% 2.88/1.13 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.88/1.13 %------ where \phi is a formula over the term algebra.
% 2.88/1.13 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.88/1.13 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.88/1.13 %------ See help for --sat_out_model for different model outputs.
% 2.88/1.13 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.88/1.13 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.88/1.13 % SZS output start Model for theBenchmark.p
% See solution above
% 2.88/1.14 ------ Statistics
% 2.88/1.14
% 2.88/1.14 ------ Problem properties
% 2.88/1.14
% 2.88/1.14 clauses: 217
% 2.88/1.14 conjectures: 161
% 2.88/1.14 epr: 123
% 2.88/1.14 horn: 190
% 2.88/1.14 ground: 95
% 2.88/1.14 unary: 96
% 2.88/1.14 binary: 21
% 2.88/1.14 lits: 746
% 2.88/1.14 lits_eq: 0
% 2.88/1.14 fd_pure: 0
% 2.88/1.14 fd_pseudo: 0
% 2.88/1.14 fd_cond: 0
% 2.88/1.14 fd_pseudo_cond: 0
% 2.88/1.14 ac_symbols: 0
% 2.88/1.14
% 2.88/1.14 ------ General
% 2.88/1.14
% 2.88/1.14 abstr_ref_over_cycles: 0
% 2.88/1.14 abstr_ref_under_cycles: 0
% 2.88/1.14 gc_basic_clause_elim: 0
% 2.88/1.14 num_of_symbols: 596
% 2.88/1.14 num_of_terms: 4579
% 2.88/1.14
% 2.88/1.14 parsing_time: 0.028
% 2.88/1.14 unif_index_cands_time: 0.002
% 2.88/1.14 unif_index_add_time: 0.002
% 2.88/1.14 orderings_time: 0.
% 2.88/1.14 out_proof_time: 0.
% 2.88/1.14 total_time: 0.352
% 2.88/1.14
% 2.88/1.14 ------ Preprocessing
% 2.88/1.14
% 2.88/1.14 num_of_splits: 0
% 2.88/1.14 num_of_split_atoms: 0
% 2.88/1.14 num_of_reused_defs: 0
% 2.88/1.14 num_eq_ax_congr_red: 0
% 2.88/1.14 num_of_sem_filtered_clauses: 0
% 2.88/1.14 num_of_subtypes: 0
% 2.88/1.14 monotx_restored_types: 0
% 2.88/1.14 sat_num_of_epr_types: 0
% 2.88/1.14 sat_num_of_non_cyclic_types: 0
% 2.88/1.14 sat_guarded_non_collapsed_types: 0
% 2.88/1.14 num_pure_diseq_elim: 0
% 2.88/1.14 simp_replaced_by: 0
% 2.88/1.14 res_preprocessed: 0
% 2.88/1.14 sup_preprocessed: 0
% 2.88/1.14 prep_upred: 0
% 2.88/1.14 prep_unflattend: 0
% 2.88/1.14 prep_well_definedness: 0
% 2.88/1.14 smt_new_axioms: 0
% 2.88/1.14 pred_elim_cands: 11
% 2.88/1.14 pred_elim: 0
% 2.88/1.14 pred_elim_cl: 0
% 2.88/1.14 pred_elim_cycles: 8
% 2.88/1.14 merged_defs: 0
% 2.88/1.14 merged_defs_ncl: 0
% 2.88/1.14 bin_hyper_res: 0
% 2.88/1.14 prep_cycles: 1
% 2.88/1.14
% 2.88/1.14 splitting_time: 0.
% 2.88/1.14 sem_filter_time: 0.002
% 2.88/1.14 monotx_time: 0.
% 2.88/1.14 subtype_inf_time: 0.
% 2.88/1.14 res_prep_time: 0.029
% 2.88/1.14 sup_prep_time: 0.
% 2.88/1.14 pred_elim_time: 0.018
% 2.88/1.14 bin_hyper_res_time: 0.
% 2.88/1.14 prep_time_total: 0.061
% 2.88/1.14
% 2.88/1.14 ------ Propositional Solver
% 2.88/1.14
% 2.88/1.14 prop_solver_calls: 85
% 2.88/1.14 prop_fast_solver_calls: 2756
% 2.88/1.14 smt_solver_calls: 0
% 2.88/1.14 smt_fast_solver_calls: 0
% 2.88/1.14 prop_num_of_clauses: 2007
% 2.88/1.14 prop_preprocess_simplified: 25437
% 2.88/1.14 prop_fo_subsumed: 0
% 2.88/1.14
% 2.88/1.14 prop_solver_time: 0.008
% 2.88/1.14 prop_fast_solver_time: 0.002
% 2.88/1.14 prop_unsat_core_time: 0.007
% 2.88/1.14 smt_solver_time: 0.
% 2.88/1.14 smt_fast_solver_time: 0.
% 2.88/1.14
% 2.88/1.14 ------ QBF
% 2.88/1.14
% 2.88/1.14 qbf_q_res: 0
% 2.88/1.14 qbf_num_tautologies: 0
% 2.88/1.14 qbf_prep_cycles: 0
% 2.88/1.14
% 2.88/1.14 ------ BMC1
% 2.88/1.14
% 2.88/1.14 bmc1_current_bound: -1
% 2.88/1.14 bmc1_last_solved_bound: -1
% 2.88/1.14 bmc1_unsat_core_size: -1
% 2.88/1.14 bmc1_unsat_core_parents_size: -1
% 2.88/1.14 bmc1_merge_next_fun: 0
% 2.88/1.14
% 2.88/1.14 bmc1_unsat_core_clauses_time: 0.
% 2.88/1.14
% 2.88/1.14 ------ Instantiation
% 2.88/1.14
% 2.88/1.14 inst_num_of_clauses: 592
% 2.88/1.14 inst_num_in_passive: 0
% 2.88/1.14 inst_num_in_active: 2308
% 2.88/1.14 inst_num_of_loops: 2492
% 2.88/1.14 inst_num_in_unprocessed: 0
% 2.88/1.14 inst_num_of_learning_restarts: 0
% 2.88/1.14 inst_num_moves_active_passive: 161
% 2.88/1.14 inst_lit_activity: 0
% 2.88/1.14 inst_lit_activity_moves: 0
% 2.88/1.14 inst_num_tautologies: 0
% 2.88/1.14 inst_num_prop_implied: 0
% 2.88/1.14 inst_num_existing_simplified: 0
% 2.88/1.14 inst_num_eq_res_simplified: 0
% 2.88/1.14 inst_num_child_elim: 0
% 2.88/1.14 inst_num_of_dismatching_blockings: 0
% 2.88/1.14 inst_num_of_non_proper_insts: 2048
% 2.88/1.14 inst_num_of_duplicates: 0
% 2.88/1.14 inst_inst_num_from_inst_to_res: 0
% 2.88/1.14
% 2.88/1.14 inst_time_sim_new: 0.038
% 2.88/1.14 inst_time_sim_given: 0.
% 2.88/1.14 inst_time_dismatching_checking: 0.005
% 2.88/1.14 inst_time_total: 0.152
% 2.88/1.14
% 2.88/1.14 ------ Resolution
% 2.88/1.14
% 2.88/1.14 res_num_of_clauses: 217
% 2.88/1.14 res_num_in_passive: 0
% 2.88/1.14 res_num_in_active: 0
% 2.88/1.14 res_num_of_loops: 218
% 2.88/1.14 res_forward_subset_subsumed: 272
% 2.88/1.14 res_backward_subset_subsumed: 2
% 2.88/1.14 res_forward_subsumed: 0
% 2.88/1.14 res_backward_subsumed: 0
% 2.88/1.14 res_forward_subsumption_resolution: 0
% 2.88/1.14 res_backward_subsumption_resolution: 0
% 2.88/1.14 res_clause_to_clause_subsumption: 1652
% 2.88/1.14 res_subs_bck_cnt: 1
% 2.88/1.14 res_orphan_elimination: 0
% 2.88/1.14 res_tautology_del: 136
% 2.88/1.14 res_num_eq_res_simplified: 0
% 2.88/1.14 res_num_sel_changes: 0
% 2.88/1.14 res_moves_from_active_to_pass: 0
% 2.88/1.14
% 2.88/1.14 res_time_sim_new: 0.004
% 2.88/1.14 res_time_sim_fw_given: 0.013
% 2.88/1.14 res_time_sim_bw_given: 0.007
% 2.88/1.14 res_time_total: 0.004
% 2.88/1.14
% 2.88/1.14 ------ Superposition
% 2.88/1.14
% 2.88/1.14 sup_num_of_clauses: undef
% 2.88/1.14 sup_num_in_active: undef
% 2.88/1.14 sup_num_in_passive: undef
% 2.88/1.14 sup_num_of_loops: 0
% 2.88/1.14 sup_fw_superposition: 0
% 2.88/1.14 sup_bw_superposition: 0
% 2.88/1.14 sup_eq_factoring: 0
% 2.88/1.14 sup_eq_resolution: 0
% 2.88/1.14 sup_immediate_simplified: 0
% 2.88/1.14 sup_given_eliminated: 0
% 2.88/1.14 comparisons_done: 0
% 2.88/1.14 comparisons_avoided: 0
% 2.88/1.14 comparisons_inc_criteria: 0
% 2.88/1.14 sup_deep_cl_discarded: 0
% 2.88/1.14 sup_num_of_deepenings: 0
% 2.88/1.14 sup_num_of_restarts: 0
% 2.88/1.14
% 2.88/1.14 sup_time_generating: 0.
% 2.88/1.14 sup_time_sim_fw_full: 0.
% 2.88/1.14 sup_time_sim_bw_full: 0.
% 2.88/1.14 sup_time_sim_fw_immed: 0.
% 2.88/1.14 sup_time_sim_bw_immed: 0.
% 2.88/1.14 sup_time_prep_sim_fw_input: 0.
% 2.88/1.14 sup_time_prep_sim_bw_input: 0.
% 2.88/1.14 sup_time_total: 0.
% 2.88/1.14
% 2.88/1.14 ------ Simplifications
% 2.88/1.14
% 2.88/1.14 sim_repeated: 0
% 2.88/1.14 sim_fw_subset_subsumed: 0
% 2.88/1.14 sim_bw_subset_subsumed: 0
% 2.88/1.14 sim_fw_subsumed: 0
% 2.88/1.14 sim_bw_subsumed: 0
% 2.88/1.14 sim_fw_subsumption_res: 0
% 2.88/1.14 sim_bw_subsumption_res: 0
% 2.88/1.14 sim_fw_unit_subs: 0
% 2.88/1.14 sim_bw_unit_subs: 0
% 2.88/1.14 sim_tautology_del: 0
% 2.88/1.14 sim_eq_tautology_del: 0
% 2.88/1.14 sim_eq_res_simp: 0
% 2.88/1.14 sim_fw_demodulated: 0
% 2.88/1.14 sim_bw_demodulated: 0
% 2.88/1.14 sim_encompassment_demod: 0
% 2.88/1.14 sim_light_normalised: 0
% 2.88/1.14 sim_ac_normalised: 0
% 2.88/1.14 sim_joinable_taut: 0
% 2.88/1.14 sim_joinable_simp: 0
% 2.88/1.14 sim_fw_ac_demod: 0
% 2.88/1.14 sim_bw_ac_demod: 0
% 2.88/1.14 sim_smt_subsumption: 0
% 2.88/1.14 sim_smt_simplified: 0
% 2.88/1.14 sim_ground_joinable: 0
% 2.88/1.14 sim_bw_ground_joinable: 0
% 2.88/1.14 sim_connectedness: 0
% 2.88/1.14
% 2.88/1.14 sim_time_fw_subset_subs: 0.
% 2.88/1.14 sim_time_bw_subset_subs: 0.
% 2.88/1.14 sim_time_fw_subs: 0.
% 2.88/1.14 sim_time_bw_subs: 0.
% 2.88/1.14 sim_time_fw_subs_res: 0.
% 2.88/1.14 sim_time_bw_subs_res: 0.
% 2.88/1.14 sim_time_fw_unit_subs: 0.
% 2.88/1.14 sim_time_bw_unit_subs: 0.
% 2.88/1.14 sim_time_tautology_del: 0.
% 2.88/1.14 sim_time_eq_tautology_del: 0.
% 2.88/1.14 sim_time_eq_res_simp: 0.
% 2.88/1.14 sim_time_fw_demod: 0.
% 2.88/1.14 sim_time_bw_demod: 0.
% 2.88/1.14 sim_time_light_norm: 0.
% 2.88/1.14 sim_time_joinable: 0.
% 2.88/1.14 sim_time_ac_norm: 0.
% 2.88/1.14 sim_time_fw_ac_demod: 0.
% 2.88/1.14 sim_time_bw_ac_demod: 0.
% 2.88/1.14 sim_time_smt_subs: 0.
% 2.88/1.14 sim_time_fw_gjoin: 0.
% 2.88/1.14 sim_time_fw_connected: 0.
% 2.88/1.14
% 2.88/1.14
%------------------------------------------------------------------------------