TSTP Solution File: SYN907-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : SYN907-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n032.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 : Fri Sep 1 03:19:06 EDT 2023
% Result : Satisfiable 2.12s 1.03s
% Output : Model 2.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ssSkP614
fof(lit_def,axiom,
! [X0] :
( ssSkP614(X0)
<=> $true ) ).
%------ Positive definition of ssSkP577
fof(lit_def_001,axiom,
! [X0] :
( ssSkP577(X0)
<=> $true ) ).
%------ Positive definition of ssSkP627
fof(lit_def_002,axiom,
! [X0] :
( ssSkP627(X0)
<=> $true ) ).
%------ Positive definition of ssSkP629
fof(lit_def_003,axiom,
! [X0] :
( ssSkP629(X0)
<=> $true ) ).
%------ Positive definition of ssSkP631
fof(lit_def_004,axiom,
! [X0] :
( ssSkP631(X0)
<=> $true ) ).
%------ Positive definition of ssSkP633
fof(lit_def_005,axiom,
! [X0] :
( ssSkP633(X0)
<=> $true ) ).
%------ Positive definition of ssSkP635
fof(lit_def_006,axiom,
! [X0] :
( ssSkP635(X0)
<=> $true ) ).
%------ Positive definition of ssSkP637
fof(lit_def_007,axiom,
! [X0] :
( ssSkP637(X0)
<=> $true ) ).
%------ Positive definition of ssSkP639
fof(lit_def_008,axiom,
! [X0] :
( ssSkP639(X0)
<=> $true ) ).
%------ Positive definition of ssSkP641
fof(lit_def_009,axiom,
! [X0] :
( ssSkP641(X0)
<=> $true ) ).
%------ Positive definition of ssSkP643
fof(lit_def_010,axiom,
! [X0] :
( ssSkP643(X0)
<=> $true ) ).
%------ Positive definition of ssSkP645
fof(lit_def_011,axiom,
! [X0] :
( ssSkP645(X0)
<=> $true ) ).
%------ Positive definition of ssSkP647
fof(lit_def_012,axiom,
! [X0] :
( ssSkP647(X0)
<=> $true ) ).
%------ Positive definition of ssSkP649
fof(lit_def_013,axiom,
! [X0] :
( ssSkP649(X0)
<=> $true ) ).
%------ Positive definition of ssSkP651
fof(lit_def_014,axiom,
! [X0] :
( ssSkP651(X0)
<=> $true ) ).
%------ Positive definition of ssSkP653
fof(lit_def_015,axiom,
! [X0] :
( ssSkP653(X0)
<=> $true ) ).
%------ Positive definition of ssSkP655
fof(lit_def_016,axiom,
! [X0] :
( ssSkP655(X0)
<=> $true ) ).
%------ Positive definition of ssSkP657
fof(lit_def_017,axiom,
! [X0] :
( ssSkP657(X0)
<=> $true ) ).
%------ Positive definition of ssSkP659
fof(lit_def_018,axiom,
! [X0] :
( ssSkP659(X0)
<=> $true ) ).
%------ Positive definition of ssSkP661
fof(lit_def_019,axiom,
! [X0] :
( ssSkP661(X0)
<=> $true ) ).
%------ Positive definition of ssSkP663
fof(lit_def_020,axiom,
! [X0] :
( ssSkP663(X0)
<=> $true ) ).
%------ Positive definition of ssSkP665
fof(lit_def_021,axiom,
! [X0] :
( ssSkP665(X0)
<=> $true ) ).
%------ Positive definition of ssSkP667
fof(lit_def_022,axiom,
! [X0] :
( ssSkP667(X0)
<=> $true ) ).
%------ Positive definition of ssSkP669
fof(lit_def_023,axiom,
! [X0] :
( ssSkP669(X0)
<=> $true ) ).
%------ Positive definition of ssSkP671
fof(lit_def_024,axiom,
! [X0] :
( ssSkP671(X0)
<=> $true ) ).
%------ Positive definition of ssSkP673
fof(lit_def_025,axiom,
! [X0] :
( ssSkP673(X0)
<=> $true ) ).
%------ Positive definition of ssRr
fof(lit_def_026,axiom,
! [X0,X1] :
( ssRr(X0,X1)
<=> $true ) ).
%------ Positive definition of ssSkP590
fof(lit_def_027,axiom,
! [X0,X1] :
( ssSkP590(X0,X1)
<=> $true ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_028,axiom,
! [X0] :
( sP0_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_029,axiom,
! [X0] :
( sP1_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_030,axiom,
! [X0] :
( sP2_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_031,axiom,
! [X0] :
( sP3_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_032,axiom,
! [X0] :
( sP4_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_033,axiom,
! [X0] :
( sP5_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_034,axiom,
! [X0] :
( sP6_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_035,axiom,
! [X0] :
( sP7_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_036,axiom,
! [X0] :
( sP8_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_037,axiom,
! [X0] :
( sP9_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_038,axiom,
! [X0] :
( sP10_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_039,axiom,
! [X0] :
( sP11_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP12_iProver_split
fof(lit_def_040,axiom,
! [X0] :
( sP12_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP13_iProver_split
fof(lit_def_041,axiom,
! [X0] :
( sP13_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP14_iProver_split
fof(lit_def_042,axiom,
! [X0] :
( sP14_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP15_iProver_split
fof(lit_def_043,axiom,
! [X0] :
( sP15_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP16_iProver_split
fof(lit_def_044,axiom,
! [X0] :
( sP16_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP17_iProver_split
fof(lit_def_045,axiom,
! [X0] :
( sP17_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP18_iProver_split
fof(lit_def_046,axiom,
! [X0] :
( sP18_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP19_iProver_split
fof(lit_def_047,axiom,
! [X0] :
( sP19_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP20_iProver_split
fof(lit_def_048,axiom,
! [X0] :
( sP20_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP21_iProver_split
fof(lit_def_049,axiom,
! [X0] :
( sP21_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP22_iProver_split
fof(lit_def_050,axiom,
! [X0] :
( sP22_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP23_iProver_split
fof(lit_def_051,axiom,
! [X0] :
( sP23_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP24_iProver_split
fof(lit_def_052,axiom,
! [X0] :
( sP24_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP25_iProver_split
fof(lit_def_053,axiom,
! [X0] :
( sP25_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP26_iProver_split
fof(lit_def_054,axiom,
! [X0] :
( sP26_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP27_iProver_split
fof(lit_def_055,axiom,
! [X0] :
( sP27_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP28_iProver_split
fof(lit_def_056,axiom,
! [X0] :
( sP28_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP29_iProver_split
fof(lit_def_057,axiom,
! [X0] :
( sP29_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP30_iProver_split
fof(lit_def_058,axiom,
! [X0] :
( sP30_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP31_iProver_split
fof(lit_def_059,axiom,
! [X0] :
( sP31_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP32_iProver_split
fof(lit_def_060,axiom,
! [X0] :
( sP32_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP33_iProver_split
fof(lit_def_061,axiom,
! [X0] :
( sP33_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP34_iProver_split
fof(lit_def_062,axiom,
! [X0] :
( sP34_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP35_iProver_split
fof(lit_def_063,axiom,
! [X0] :
( sP35_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP36_iProver_split
fof(lit_def_064,axiom,
! [X0] :
( sP36_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP37_iProver_split
fof(lit_def_065,axiom,
! [X0] :
( sP37_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP38_iProver_split
fof(lit_def_066,axiom,
! [X0] :
( sP38_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP39_iProver_split
fof(lit_def_067,axiom,
! [X0] :
( sP39_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP40_iProver_split
fof(lit_def_068,axiom,
! [X0] :
( sP40_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP41_iProver_split
fof(lit_def_069,axiom,
! [X0] :
( sP41_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP42_iProver_split
fof(lit_def_070,axiom,
! [X0] :
( sP42_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP43_iProver_split
fof(lit_def_071,axiom,
! [X0] :
( sP43_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP44_iProver_split
fof(lit_def_072,axiom,
! [X0] :
( sP44_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP45_iProver_split
fof(lit_def_073,axiom,
! [X0] :
( sP45_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP46_iProver_split
fof(lit_def_074,axiom,
! [X0] :
( sP46_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP47_iProver_split
fof(lit_def_075,axiom,
! [X0] :
( sP47_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP48_iProver_split
fof(lit_def_076,axiom,
! [X0] :
( sP48_iProver_split(X0)
<=> $true ) ).
%------ Positive definition of sP49_iProver_split
fof(lit_def_077,axiom,
! [X0] :
( sP49_iProver_split(X0)
<=> $false ) ).
%------ Positive definition of sP50_iProver_split
fof(lit_def_078,axiom,
! [X0,X1] :
( sP50_iProver_split(X0,X1)
<=> $true ) ).
%------ Negative definition of iProver_Flat_skc41
fof(lit_def_079,axiom,
! [X0] :
( ~ iProver_Flat_skc41(X0)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf61
fof(lit_def_080,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf61(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf62
fof(lit_def_081,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf62(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf63
fof(lit_def_082,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf63(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf64
fof(lit_def_083,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf64(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf65
fof(lit_def_084,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf65(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf66
fof(lit_def_085,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf66(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf67
fof(lit_def_086,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf67(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf68
fof(lit_def_087,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf68(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf69
fof(lit_def_088,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf69(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf70
fof(lit_def_089,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf70(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf71
fof(lit_def_090,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf71(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf72
fof(lit_def_091,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf72(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf73
fof(lit_def_092,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf73(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf74
fof(lit_def_093,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf74(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf75
fof(lit_def_094,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf75(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf76
fof(lit_def_095,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf76(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf77
fof(lit_def_096,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf77(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf78
fof(lit_def_097,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf78(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf79
fof(lit_def_098,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf79(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf80
fof(lit_def_099,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf80(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf81
fof(lit_def_100,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf81(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf82
fof(lit_def_101,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf82(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf49
fof(lit_def_102,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf49(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf50
fof(lit_def_103,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf50(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf51
fof(lit_def_104,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf51(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf52
fof(lit_def_105,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf52(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf53
fof(lit_def_106,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf53(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf54
fof(lit_def_107,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf54(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf55
fof(lit_def_108,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf55(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf56
fof(lit_def_109,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf56(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf57
fof(lit_def_110,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf57(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf58
fof(lit_def_111,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf58(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf59
fof(lit_def_112,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf59(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf60
fof(lit_def_113,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf60(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf83
fof(lit_def_114,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf83(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf84
fof(lit_def_115,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf84(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf85
fof(lit_def_116,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf85(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf86
fof(lit_def_117,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf86(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf87
fof(lit_def_118,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf87(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf88
fof(lit_def_119,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf88(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf89
fof(lit_def_120,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf89(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf90
fof(lit_def_121,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf90(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf91
fof(lit_def_122,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf91(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf92
fof(lit_def_123,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf92(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf93
fof(lit_def_124,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf93(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf94
fof(lit_def_125,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf94(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf95
fof(lit_def_126,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf95(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf96
fof(lit_def_127,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf96(X0,X1)
<=> $false ) ).
%------ Negative definition of iProver_Flat_skf97
fof(lit_def_128,axiom,
! [X0,X1] :
( ~ iProver_Flat_skf97(X0,X1)
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN907-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.11 % Command : run_iprover %s %d SAT
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sat Aug 26 19:17:44 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running model finding
% 0.14/0.39 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.12/1.03 % SZS status Started for theBenchmark.p
% 2.12/1.03 % SZS status Satisfiable for theBenchmark.p
% 2.12/1.03
% 2.12/1.03 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.12/1.03
% 2.12/1.03 ------ iProver source info
% 2.12/1.03
% 2.12/1.03 git: date: 2023-05-31 18:12:56 +0000
% 2.12/1.03 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.12/1.03 git: non_committed_changes: false
% 2.12/1.03 git: last_make_outside_of_git: false
% 2.12/1.03
% 2.12/1.03 ------ Parsing...successful
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03 ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe:64:0s pe:128:0s pe:256:0s pe:512:0s pe_e pe_s pe_e
% 2.12/1.03
% 2.12/1.03 ------ Preprocessing... scvd_s sp: 51 0s scvd_e snvd_s sp: 0 0s snvd_e
% 2.12/1.03 ------ Proving...
% 2.12/1.03 ------ Problem Properties
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03 clauses 128
% 2.12/1.03 conjectures 15
% 2.12/1.03 EPR 79
% 2.12/1.03 Horn 103
% 2.12/1.03 unary 1
% 2.12/1.03 binary 49
% 2.12/1.03 lits 333
% 2.12/1.03 lits eq 0
% 2.12/1.03 fd_pure 0
% 2.12/1.03 fd_pseudo 0
% 2.12/1.03 fd_cond 0
% 2.12/1.03 fd_pseudo_cond 0
% 2.12/1.03 AC symbols 0
% 2.12/1.03
% 2.12/1.03 ------ Input Options Time Limit: Unbounded
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03 ------ Finite Models:
% 2.12/1.03
% 2.12/1.03 ------ lit_activity_flag true
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03 ------ Trying domains of size >= : 1
% 2.12/1.03 ------
% 2.12/1.03 Current options:
% 2.12/1.03 ------
% 2.12/1.03
% 2.12/1.03 ------ Input Options
% 2.12/1.03
% 2.12/1.03 --out_options all
% 2.12/1.03 --tptp_safe_out true
% 2.12/1.03 --problem_path ""
% 2.12/1.03 --include_path ""
% 2.12/1.03 --clausifier res/vclausify_rel
% 2.12/1.03 --clausifier_options --mode clausify -t 300.00
% 2.12/1.03 --stdin false
% 2.12/1.03 --proof_out true
% 2.12/1.03 --proof_dot_file ""
% 2.12/1.03 --proof_reduce_dot []
% 2.12/1.03 --suppress_sat_res false
% 2.12/1.03 --suppress_unsat_res true
% 2.12/1.03 --stats_out all
% 2.12/1.03 --stats_mem false
% 2.12/1.03 --theory_stats_out false
% 2.12/1.03
% 2.12/1.03 ------ General Options
% 2.12/1.03
% 2.12/1.03 --fof false
% 2.12/1.03 --time_out_real 300.
% 2.12/1.03 --time_out_virtual -1.
% 2.12/1.03 --rnd_seed 13
% 2.12/1.03 --symbol_type_check false
% 2.12/1.03 --clausify_out false
% 2.12/1.03 --sig_cnt_out false
% 2.12/1.03 --trig_cnt_out false
% 2.12/1.03 --trig_cnt_out_tolerance 1.
% 2.12/1.03 --trig_cnt_out_sk_spl false
% 2.12/1.03 --abstr_cl_out false
% 2.12/1.03
% 2.12/1.03 ------ Interactive Mode
% 2.12/1.03
% 2.12/1.03 --interactive_mode false
% 2.12/1.03 --external_ip_address ""
% 2.12/1.03 --external_port 0
% 2.12/1.03
% 2.12/1.03 ------ Global Options
% 2.12/1.03
% 2.12/1.03 --schedule none
% 2.12/1.03 --add_important_lit false
% 2.12/1.03 --prop_solver_per_cl 500
% 2.12/1.03 --subs_bck_mult 8
% 2.12/1.03 --min_unsat_core false
% 2.12/1.03 --soft_assumptions false
% 2.12/1.03 --soft_lemma_size 3
% 2.12/1.03 --prop_impl_unit_size 0
% 2.12/1.03 --prop_impl_unit []
% 2.12/1.03 --share_sel_clauses true
% 2.12/1.03 --reset_solvers false
% 2.12/1.03 --bc_imp_inh [conj_cone]
% 2.12/1.03 --conj_cone_tolerance 3.
% 2.12/1.03 --extra_neg_conj all_pos_neg
% 2.12/1.03 --large_theory_mode true
% 2.12/1.03 --prolific_symb_bound 500
% 2.12/1.03 --lt_threshold 2000
% 2.12/1.03 --clause_weak_htbl true
% 2.12/1.03 --gc_record_bc_elim false
% 2.12/1.03
% 2.12/1.03 ------ Preprocessing Options
% 2.12/1.03
% 2.12/1.03 --preprocessing_flag true
% 2.12/1.03 --time_out_prep_mult 0.2
% 2.12/1.03 --splitting_mode input
% 2.12/1.03 --splitting_grd false
% 2.12/1.03 --splitting_cvd true
% 2.12/1.03 --splitting_cvd_svl true
% 2.12/1.03 --splitting_nvd 256
% 2.12/1.03 --sub_typing false
% 2.12/1.03 --prep_gs_sim false
% 2.12/1.03 --prep_unflatten true
% 2.12/1.03 --prep_res_sim true
% 2.12/1.03 --prep_sup_sim_all true
% 2.12/1.03 --prep_sup_sim_sup false
% 2.12/1.03 --prep_upred true
% 2.12/1.03 --prep_well_definedness true
% 2.12/1.03 --prep_sem_filter none
% 2.12/1.03 --prep_sem_filter_out false
% 2.12/1.03 --pred_elim true
% 2.12/1.03 --res_sim_input false
% 2.12/1.03 --eq_ax_congr_red true
% 2.12/1.03 --pure_diseq_elim false
% 2.12/1.03 --brand_transform false
% 2.12/1.03 --non_eq_to_eq false
% 2.12/1.03 --prep_def_merge false
% 2.12/1.03 --prep_def_merge_prop_impl false
% 2.12/1.03 --prep_def_merge_mbd true
% 2.12/1.03 --prep_def_merge_tr_red false
% 2.12/1.03 --prep_def_merge_tr_cl false
% 2.12/1.03 --smt_preprocessing false
% 2.12/1.03 --smt_ac_axioms fast
% 2.12/1.03 --preprocessed_out false
% 2.12/1.03 --preprocessed_stats false
% 2.12/1.03
% 2.12/1.03 ------ Abstraction refinement Options
% 2.12/1.03
% 2.12/1.03 --abstr_ref []
% 2.12/1.03 --abstr_ref_prep false
% 2.12/1.03 --abstr_ref_until_sat false
% 2.12/1.03 --abstr_ref_sig_restrict funpre
% 2.12/1.03 --abstr_ref_af_restrict_to_split_sk false
% 2.12/1.03 --abstr_ref_under []
% 2.12/1.03
% 2.12/1.03 ------ SAT Options
% 2.12/1.03
% 2.12/1.03 --sat_mode true
% 2.12/1.03 --sat_fm_restart_options ""
% 2.12/1.03 --sat_gr_def false
% 2.12/1.03 --sat_epr_types false
% 2.12/1.03 --sat_non_cyclic_types true
% 2.12/1.03 --sat_finite_models true
% 2.12/1.03 --sat_fm_lemmas false
% 2.12/1.03 --sat_fm_prep false
% 2.12/1.03 --sat_fm_uc_incr true
% 2.12/1.03 --sat_out_model small
% 2.12/1.03 --sat_out_clauses false
% 2.12/1.03
% 2.12/1.03 ------ QBF Options
% 2.12/1.03
% 2.12/1.03 --qbf_mode false
% 2.12/1.03 --qbf_elim_univ false
% 2.12/1.03 --qbf_dom_inst none
% 2.12/1.03 --qbf_dom_pre_inst false
% 2.12/1.03 --qbf_sk_in false
% 2.12/1.03 --qbf_pred_elim true
% 2.12/1.03 --qbf_split 512
% 2.12/1.03
% 2.12/1.03 ------ BMC1 Options
% 2.12/1.03
% 2.12/1.03 --bmc1_incremental false
% 2.12/1.03 --bmc1_axioms reachable_all
% 2.12/1.03 --bmc1_min_bound 0
% 2.12/1.03 --bmc1_max_bound -1
% 2.12/1.03 --bmc1_max_bound_default -1
% 2.12/1.03 --bmc1_symbol_reachability false
% 2.12/1.03 --bmc1_property_lemmas false
% 2.12/1.03 --bmc1_k_induction false
% 2.12/1.03 --bmc1_non_equiv_states false
% 2.12/1.03 --bmc1_deadlock false
% 2.12/1.03 --bmc1_ucm false
% 2.12/1.03 --bmc1_add_unsat_core none
% 2.12/1.03 --bmc1_unsat_core_children false
% 2.12/1.03 --bmc1_unsat_core_extrapolate_axioms false
% 2.12/1.03 --bmc1_out_stat full
% 2.12/1.03 --bmc1_ground_init false
% 2.12/1.03 --bmc1_pre_inst_next_state false
% 2.12/1.03 --bmc1_pre_inst_state false
% 2.12/1.03 --bmc1_pre_inst_reach_state false
% 2.12/1.03 --bmc1_out_unsat_core false
% 2.12/1.03 --bmc1_aig_witness_out false
% 2.12/1.03 --bmc1_verbose false
% 2.12/1.03 --bmc1_dump_clauses_tptp false
% 2.12/1.03 --bmc1_dump_unsat_core_tptp false
% 2.12/1.03 --bmc1_dump_file -
% 2.12/1.03 --bmc1_ucm_expand_uc_limit 128
% 2.12/1.03 --bmc1_ucm_n_expand_iterations 6
% 2.12/1.03 --bmc1_ucm_extend_mode 1
% 2.12/1.03 --bmc1_ucm_init_mode 2
% 2.12/1.03 --bmc1_ucm_cone_mode none
% 2.12/1.03 --bmc1_ucm_reduced_relation_type 0
% 2.12/1.03 --bmc1_ucm_relax_model 4
% 2.12/1.03 --bmc1_ucm_full_tr_after_sat true
% 2.12/1.03 --bmc1_ucm_expand_neg_assumptions false
% 2.12/1.03 --bmc1_ucm_layered_model none
% 2.12/1.03 --bmc1_ucm_max_lemma_size 10
% 2.12/1.03
% 2.12/1.03 ------ AIG Options
% 2.12/1.03
% 2.12/1.03 --aig_mode false
% 2.12/1.03
% 2.12/1.03 ------ Instantiation Options
% 2.12/1.03
% 2.12/1.03 --instantiation_flag true
% 2.12/1.03 --inst_sos_flag false
% 2.12/1.03 --inst_sos_phase true
% 2.12/1.03 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.12/1.03 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 2.12/1.03 --inst_lit_sel_side num_lit
% 2.12/1.03 --inst_solver_per_active 1400
% 2.12/1.03 --inst_solver_calls_frac 0.01
% 2.12/1.03 --inst_to_smt_solver true
% 2.12/1.03 --inst_passive_queue_type priority_queues
% 2.12/1.03 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 2.12/1.03 --inst_passive_queues_freq [512;64]
% 2.12/1.03 --inst_dismatching true
% 2.12/1.03 --inst_eager_unprocessed_to_passive false
% 2.12/1.03 --inst_unprocessed_bound 1000
% 2.12/1.03 --inst_prop_sim_given true
% 2.12/1.03 --inst_prop_sim_new true
% 2.12/1.03 --inst_subs_new false
% 2.12/1.03 --inst_eq_res_simp false
% 2.12/1.03 --inst_subs_given true
% 2.12/1.03 --inst_orphan_elimination false
% 2.12/1.03 --inst_learning_loop_flag true
% 2.12/1.03 --inst_learning_start 5
% 2.12/1.03 --inst_learning_factor 8
% 2.12/1.03 --inst_start_prop_sim_after_learn 0
% 2.12/1.03 --inst_sel_renew solver
% 2.12/1.03 --inst_lit_activity_flag true
% 2.12/1.03 --inst_restr_to_given false
% 2.12/1.03 --inst_activity_threshold 10000
% 2.12/1.03
% 2.12/1.03 ------ Resolution Options
% 2.12/1.03
% 2.12/1.03 --resolution_flag false
% 2.12/1.03 --res_lit_sel neg_max
% 2.12/1.03 --res_lit_sel_side num_lit
% 2.12/1.03 --res_ordering kbo
% 2.12/1.03 --res_to_prop_solver passive
% 2.12/1.03 --res_prop_simpl_new true
% 2.12/1.03 --res_prop_simpl_given true
% 2.12/1.03 --res_to_smt_solver true
% 2.12/1.03 --res_passive_queue_type priority_queues
% 2.12/1.03 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 2.12/1.03 --res_passive_queues_freq [1024;32]
% 2.12/1.03 --res_forward_subs subset_subsumption
% 2.12/1.03 --res_backward_subs subset_subsumption
% 2.12/1.03 --res_forward_subs_resolution true
% 2.12/1.03 --res_backward_subs_resolution false
% 2.12/1.03 --res_orphan_elimination false
% 2.12/1.03 --res_time_limit 10.
% 2.12/1.03
% 2.12/1.03 ------ Superposition Options
% 2.12/1.03
% 2.12/1.03 --superposition_flag false
% 2.12/1.03 --sup_passive_queue_type priority_queues
% 2.12/1.03 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 2.12/1.03 --sup_passive_queues_freq [8;1;4;4]
% 2.12/1.03 --demod_completeness_check fast
% 2.12/1.03 --demod_use_ground true
% 2.12/1.03 --sup_unprocessed_bound 0
% 2.12/1.03 --sup_to_prop_solver passive
% 2.12/1.03 --sup_prop_simpl_new true
% 2.12/1.03 --sup_prop_simpl_given true
% 2.12/1.03 --sup_fun_splitting false
% 2.12/1.03 --sup_iter_deepening 2
% 2.12/1.03 --sup_restarts_mult 12
% 2.12/1.03 --sup_score sim_d_gen
% 2.12/1.03 --sup_share_score_frac 0.2
% 2.12/1.03 --sup_share_max_num_cl 500
% 2.12/1.03 --sup_ordering kbo
% 2.12/1.03 --sup_symb_ordering invfreq
% 2.12/1.03 --sup_term_weight default
% 2.12/1.03
% 2.12/1.03 ------ Superposition Simplification Setup
% 2.12/1.03
% 2.12/1.03 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.12/1.03 --sup_full_triv [SMTSimplify;PropSubs]
% 2.12/1.03 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.12/1.03 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.12/1.03 --sup_immed_triv []
% 2.12/1.03 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.12/1.03 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.12/1.03 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.12/1.03 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.12/1.03 --sup_input_triv [Unflattening;SMTSimplify]
% 2.12/1.03 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.12/1.03 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.12/1.03 --sup_full_fixpoint true
% 2.12/1.03 --sup_main_fixpoint true
% 2.12/1.03 --sup_immed_fixpoint false
% 2.12/1.03 --sup_input_fixpoint true
% 2.12/1.03 --sup_cache_sim none
% 2.12/1.03 --sup_smt_interval 500
% 2.12/1.03 --sup_bw_gjoin_interval 0
% 2.12/1.03
% 2.12/1.03 ------ Combination Options
% 2.12/1.03
% 2.12/1.03 --comb_mode clause_based
% 2.12/1.03 --comb_inst_mult 1000
% 2.12/1.03 --comb_res_mult 10
% 2.12/1.03 --comb_sup_mult 8
% 2.12/1.03 --comb_sup_deep_mult 2
% 2.12/1.03
% 2.12/1.03 ------ Debug Options
% 2.12/1.03
% 2.12/1.03 --dbg_backtrace false
% 2.12/1.03 --dbg_dump_prop_clauses false
% 2.12/1.03 --dbg_dump_prop_clauses_file -
% 2.12/1.03 --dbg_out_stat false
% 2.12/1.03 --dbg_just_parse false
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03 ------ Proving...
% 2.12/1.03
% 2.12/1.03
% 2.12/1.03 % SZS status Satisfiable for theBenchmark.p
% 2.12/1.03
% 2.12/1.03 ------ Building Model...Done
% 2.12/1.03
% 2.12/1.03 %------ The model is defined over ground terms (initial term algebra).
% 2.12/1.03 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.12/1.03 %------ where \phi is a formula over the term algebra.
% 2.12/1.03 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.12/1.03 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.12/1.03 %------ See help for --sat_out_model for different model outputs.
% 2.12/1.03 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.12/1.03 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.12/1.03 % SZS output start Model for theBenchmark.p
% See solution above
% 2.12/1.03 ------ Statistics
% 2.12/1.03
% 2.12/1.03 ------ Problem properties
% 2.12/1.03
% 2.12/1.03 clauses: 128
% 2.12/1.03 conjectures: 15
% 2.12/1.03 epr: 79
% 2.12/1.03 horn: 103
% 2.12/1.03 ground: 1
% 2.12/1.03 unary: 1
% 2.12/1.03 binary: 49
% 2.12/1.03 lits: 333
% 2.12/1.03 lits_eq: 0
% 2.12/1.03 fd_pure: 0
% 2.12/1.03 fd_pseudo: 0
% 2.12/1.03 fd_cond: 0
% 2.12/1.03 fd_pseudo_cond: 0
% 2.12/1.03 ac_symbols: 0
% 2.12/1.03
% 2.12/1.03 ------ General
% 2.12/1.03
% 2.12/1.03 abstr_ref_over_cycles: 0
% 2.12/1.03 abstr_ref_under_cycles: 0
% 2.12/1.03 gc_basic_clause_elim: 0
% 2.12/1.03 num_of_symbols: 1045
% 2.12/1.03 num_of_terms: 6396
% 2.12/1.03
% 2.12/1.03 parsing_time: 0.019
% 2.12/1.03 unif_index_cands_time: 0.
% 2.12/1.03 unif_index_add_time: 0.
% 2.12/1.03 orderings_time: 0.
% 2.12/1.03 out_proof_time: 0.
% 2.12/1.03 total_time: 0.249
% 2.12/1.03
% 2.12/1.03 ------ Preprocessing
% 2.12/1.03
% 2.12/1.03 num_of_splits: 51
% 2.12/1.03 num_of_split_atoms: 51
% 2.12/1.03 num_of_reused_defs: 0
% 2.12/1.03 num_eq_ax_congr_red: 0
% 2.12/1.03 num_of_sem_filtered_clauses: 0
% 2.12/1.03 num_of_subtypes: 0
% 2.12/1.03 monotx_restored_types: 0
% 2.12/1.03 sat_num_of_epr_types: 0
% 2.12/1.03 sat_num_of_non_cyclic_types: 0
% 2.12/1.03 sat_guarded_non_collapsed_types: 0
% 2.12/1.03 num_pure_diseq_elim: 0
% 2.12/1.03 simp_replaced_by: 0
% 2.12/1.03 res_preprocessed: 0
% 2.12/1.03 sup_preprocessed: 0
% 2.12/1.03 prep_upred: 0
% 2.12/1.03 prep_unflattend: 0
% 2.12/1.03 prep_well_definedness: 0
% 2.12/1.03 smt_new_axioms: 0
% 2.12/1.03 pred_elim_cands: 28
% 2.12/1.03 pred_elim: 699
% 2.12/1.03 pred_elim_cl: 714
% 2.12/1.03 pred_elim_cycles: 751
% 2.12/1.03 merged_defs: 0
% 2.12/1.03 merged_defs_ncl: 0
% 2.12/1.03 bin_hyper_res: 0
% 2.12/1.03 prep_cycles: 2
% 2.12/1.03
% 2.12/1.03 splitting_time: 0.002
% 2.12/1.03 sem_filter_time: 0.
% 2.12/1.03 monotx_time: 0.
% 2.12/1.03 subtype_inf_time: 0.
% 2.12/1.03 res_prep_time: 0.078
% 2.12/1.03 sup_prep_time: 0.
% 2.12/1.03 pred_elim_time: 0.072
% 2.12/1.03 bin_hyper_res_time: 0.
% 2.12/1.03 prep_time_total: 0.182
% 2.12/1.03
% 2.12/1.03 ------ Propositional Solver
% 2.12/1.03
% 2.12/1.03 prop_solver_calls: 16
% 2.12/1.03 prop_fast_solver_calls: 7858
% 2.12/1.03 smt_solver_calls: 0
% 2.12/1.03 smt_fast_solver_calls: 0
% 2.12/1.03 prop_num_of_clauses: 2287
% 2.12/1.03 prop_preprocess_simplified: 14769
% 2.12/1.03 prop_fo_subsumed: 21
% 2.12/1.03
% 2.12/1.03 prop_solver_time: 0.003
% 2.12/1.03 prop_fast_solver_time: 0.007
% 2.12/1.03 prop_unsat_core_time: 0.
% 2.12/1.03 smt_solver_time: 0.
% 2.12/1.03 smt_fast_solver_time: 0.
% 2.12/1.03
% 2.12/1.03 ------ QBF
% 2.12/1.03
% 2.12/1.03 qbf_q_res: 0
% 2.12/1.03 qbf_num_tautologies: 0
% 2.12/1.03 qbf_prep_cycles: 0
% 2.12/1.03
% 2.12/1.03 ------ BMC1
% 2.12/1.03
% 2.12/1.03 bmc1_current_bound: -1
% 2.12/1.03 bmc1_last_solved_bound: -1
% 2.12/1.03 bmc1_unsat_core_size: -1
% 2.12/1.03 bmc1_unsat_core_parents_size: -1
% 2.12/1.03 bmc1_merge_next_fun: 0
% 2.12/1.03
% 2.12/1.03 bmc1_unsat_core_clauses_time: 0.
% 2.12/1.03
% 2.12/1.03 ------ Instantiation
% 2.12/1.03
% 2.12/1.03 inst_num_of_clauses: 178
% 2.12/1.03 inst_num_in_passive: 0
% 2.12/1.03 inst_num_in_active: 221
% 2.12/1.03 inst_num_of_loops: 225
% 2.12/1.03 inst_num_in_unprocessed: 0
% 2.12/1.03 inst_num_of_learning_restarts: 2
% 2.12/1.03 inst_num_moves_active_passive: 0
% 2.12/1.03 inst_lit_activity: 0
% 2.12/1.03 inst_lit_activity_moves: 0
% 2.12/1.03 inst_num_tautologies: 0
% 2.12/1.03 inst_num_prop_implied: 0
% 2.12/1.03 inst_num_existing_simplified: 0
% 2.12/1.03 inst_num_eq_res_simplified: 0
% 2.12/1.03 inst_num_child_elim: 0
% 2.12/1.03 inst_num_of_dismatching_blockings: 0
% 2.12/1.03 inst_num_of_non_proper_insts: 0
% 2.12/1.03 inst_num_of_duplicates: 0
% 2.12/1.03 inst_inst_num_from_inst_to_res: 0
% 2.12/1.03
% 2.12/1.03 inst_time_sim_new: 0.009
% 2.12/1.03 inst_time_sim_given: 0.002
% 2.12/1.03 inst_time_dismatching_checking: 0.
% 2.12/1.03 inst_time_total: 0.013
% 2.12/1.03
% 2.12/1.03 ------ Resolution
% 2.12/1.03
% 2.12/1.03 res_num_of_clauses: 77
% 2.12/1.03 res_num_in_passive: 0
% 2.12/1.03 res_num_in_active: 0
% 2.12/1.03 res_num_of_loops: 870
% 2.12/1.03 res_forward_subset_subsumed: 0
% 2.12/1.03 res_backward_subset_subsumed: 0
% 2.12/1.03 res_forward_subsumed: 0
% 2.12/1.03 res_backward_subsumed: 0
% 2.12/1.03 res_forward_subsumption_resolution: 0
% 2.12/1.03 res_backward_subsumption_resolution: 0
% 2.12/1.03 res_clause_to_clause_subsumption: 3851
% 2.12/1.03 res_subs_bck_cnt: 9
% 2.12/1.03 res_orphan_elimination: 0
% 2.12/1.03 res_tautology_del: 0
% 2.12/1.03 res_num_eq_res_simplified: 0
% 2.12/1.03 res_num_sel_changes: 0
% 2.12/1.03 res_moves_from_active_to_pass: 0
% 2.12/1.03
% 2.12/1.03 res_time_sim_new: 0.017
% 2.12/1.03 res_time_sim_fw_given: 0.033
% 2.12/1.03 res_time_sim_bw_given: 0.02
% 2.12/1.03 res_time_total: 0.018
% 2.12/1.03
% 2.12/1.03 ------ Superposition
% 2.12/1.03
% 2.12/1.03 sup_num_of_clauses: undef
% 2.12/1.03 sup_num_in_active: undef
% 2.12/1.03 sup_num_in_passive: undef
% 2.12/1.03 sup_num_of_loops: 0
% 2.12/1.03 sup_fw_superposition: 0
% 2.12/1.03 sup_bw_superposition: 0
% 2.12/1.03 sup_eq_factoring: 0
% 2.12/1.03 sup_eq_resolution: 0
% 2.12/1.03 sup_immediate_simplified: 0
% 2.12/1.03 sup_given_eliminated: 0
% 2.12/1.03 comparisons_done: 0
% 2.12/1.03 comparisons_avoided: 0
% 2.12/1.03 comparisons_inc_criteria: 0
% 2.12/1.03 sup_deep_cl_discarded: 0
% 2.12/1.03 sup_num_of_deepenings: 0
% 2.12/1.03 sup_num_of_restarts: 0
% 2.12/1.03
% 2.12/1.03 sup_time_generating: 0.
% 2.12/1.03 sup_time_sim_fw_full: 0.
% 2.12/1.03 sup_time_sim_bw_full: 0.
% 2.12/1.03 sup_time_sim_fw_immed: 0.
% 2.12/1.03 sup_time_sim_bw_immed: 0.
% 2.12/1.03 sup_time_prep_sim_fw_input: 0.
% 2.12/1.03 sup_time_prep_sim_bw_input: 0.
% 2.12/1.03 sup_time_total: 0.
% 2.12/1.03
% 2.12/1.03 ------ Simplifications
% 2.12/1.03
% 2.12/1.03 sim_repeated: 0
% 2.12/1.03 sim_fw_subset_subsumed: 0
% 2.12/1.03 sim_bw_subset_subsumed: 0
% 2.12/1.03 sim_fw_subsumed: 0
% 2.12/1.03 sim_bw_subsumed: 0
% 2.12/1.03 sim_fw_subsumption_res: 0
% 2.12/1.03 sim_bw_subsumption_res: 0
% 2.12/1.03 sim_fw_unit_subs: 0
% 2.12/1.03 sim_bw_unit_subs: 0
% 2.12/1.03 sim_tautology_del: 0
% 2.12/1.03 sim_eq_tautology_del: 0
% 2.12/1.03 sim_eq_res_simp: 0
% 2.12/1.03 sim_fw_demodulated: 0
% 2.12/1.03 sim_bw_demodulated: 0
% 2.12/1.03 sim_encompassment_demod: 0
% 2.12/1.03 sim_light_normalised: 0
% 2.12/1.03 sim_ac_normalised: 0
% 2.12/1.03 sim_joinable_taut: 0
% 2.12/1.03 sim_joinable_simp: 0
% 2.12/1.03 sim_fw_ac_demod: 0
% 2.12/1.03 sim_bw_ac_demod: 0
% 2.12/1.03 sim_smt_subsumption: 0
% 2.12/1.03 sim_smt_simplified: 0
% 2.12/1.03 sim_ground_joinable: 0
% 2.12/1.03 sim_bw_ground_joinable: 0
% 2.12/1.03 sim_connectedness: 0
% 2.12/1.03
% 2.12/1.03 sim_time_fw_subset_subs: 0.
% 2.12/1.03 sim_time_bw_subset_subs: 0.
% 2.12/1.03 sim_time_fw_subs: 0.
% 2.12/1.03 sim_time_bw_subs: 0.
% 2.12/1.03 sim_time_fw_subs_res: 0.
% 2.12/1.03 sim_time_bw_subs_res: 0.
% 2.12/1.03 sim_time_fw_unit_subs: 0.
% 2.12/1.03 sim_time_bw_unit_subs: 0.
% 2.12/1.03 sim_time_tautology_del: 0.
% 2.12/1.03 sim_time_eq_tautology_del: 0.
% 2.12/1.03 sim_time_eq_res_simp: 0.
% 2.12/1.03 sim_time_fw_demod: 0.
% 2.12/1.03 sim_time_bw_demod: 0.
% 2.12/1.03 sim_time_light_norm: 0.
% 2.12/1.03 sim_time_joinable: 0.
% 2.12/1.03 sim_time_ac_norm: 0.
% 2.12/1.03 sim_time_fw_ac_demod: 0.
% 2.12/1.03 sim_time_bw_ac_demod: 0.
% 2.12/1.03 sim_time_smt_subs: 0.
% 2.12/1.03 sim_time_fw_gjoin: 0.
% 2.12/1.03 sim_time_fw_connected: 0.
% 2.12/1.03
% 2.12/1.03
%------------------------------------------------------------------------------