TSTP Solution File: SYN544-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : SYN544-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n017.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:17:39 EDT 2023
% Result : Satisfiable 3.99s 1.15s
% Output : Model 3.99s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ndr1_0
fof(lit_def,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of c6_0
fof(lit_def_001,axiom,
( c6_0
<=> $true ) ).
%------ Positive definition of c4_0
fof(lit_def_002,axiom,
( c4_0
<=> $true ) ).
%------ Negative definition of ndr1_1
fof(lit_def_003,axiom,
! [X0] :
( ~ ndr1_1(X0)
<=> ( X0 = a32
| X0 = a59
| X0 = a120
| X0 = a113
| X0 = a64
| X0 = a93
| X0 = a104 ) ) ).
%------ Positive definition of c5_1
fof(lit_def_004,axiom,
! [X0] :
( c5_1(X0)
<=> ( X0 = a136
| X0 = a52
| X0 = a51
| X0 = a53 ) ) ).
%------ Positive definition of c2_0
fof(lit_def_005,axiom,
( c2_0
<=> $false ) ).
%------ Positive definition of c3_0
fof(lit_def_006,axiom,
( c3_0
<=> $false ) ).
%------ Positive definition of c1_2
fof(lit_def_007,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> ( ( X0 = a136
& X1 = a137 )
| ( X0 = a24
& X1 = a25 )
| ( X0 = a53
& X1 = a55 )
| ( X0 = a53
& X1 = a54 ) ) ) ).
%------ Positive definition of c3_2
fof(lit_def_008,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> ( ( X0 = a136
& X1 != a71
& X1 != a4
& X1 != a115 )
| ( X0 = a136
& X1 = a137 )
| ( X0 = a136
& X1 = a115 )
| ( X0 = a83
& X1 = a84 )
| ( X0 = a24
& X1 = a25 )
| ( X0 = a53
& X1 = a56 ) ) ) ).
%------ Negative definition of c5_2
fof(lit_def_009,axiom,
! [X0,X1] :
( ~ c5_2(X0,X1)
<=> ( ( X0 = a47
& X1 = a48 )
| X0 = a51
| X1 = a94
| X1 = a108 ) ) ).
%------ Positive definition of c8_1
fof(lit_def_010,axiom,
! [X0] :
( c8_1(X0)
<=> ( X0 = a122
| X0 = a117
| X0 = a27
| X0 = a53 ) ) ).
%------ Positive definition of ssSkC21
fof(lit_def_011,axiom,
( ssSkC21
<=> $false ) ).
%------ Positive definition of c3_1
fof(lit_def_012,axiom,
! [X0] :
( c3_1(X0)
<=> X0 = a59 ) ).
%------ Positive definition of c8_0
fof(lit_def_013,axiom,
( c8_0
<=> $false ) ).
%------ Positive definition of ssSkC23
fof(lit_def_014,axiom,
( ssSkC23
<=> $true ) ).
%------ Positive definition of ssSkP9
fof(lit_def_015,axiom,
! [X0] :
( ssSkP9(X0)
<=> $true ) ).
%------ Positive definition of ssSkP8
fof(lit_def_016,axiom,
! [X0] :
( ssSkP8(X0)
<=> $true ) ).
%------ Positive definition of ssSkC17
fof(lit_def_017,axiom,
( ssSkC17
<=> $true ) ).
%------ Positive definition of ssSkP7
fof(lit_def_018,axiom,
! [X0] :
( ssSkP7(X0)
<=> $true ) ).
%------ Positive definition of ssSkC15
fof(lit_def_019,axiom,
( ssSkC15
<=> $false ) ).
%------ Positive definition of ssSkP6
fof(lit_def_020,axiom,
! [X0] :
( ssSkP6(X0)
<=> $true ) ).
%------ Positive definition of ssSkP5
fof(lit_def_021,axiom,
! [X0] :
( ssSkP5(X0)
<=> $true ) ).
%------ Positive definition of ssSkC13
fof(lit_def_022,axiom,
( ssSkC13
<=> $true ) ).
%------ Negative definition of c6_1
fof(lit_def_023,axiom,
! [X0] :
( ~ c6_1(X0)
<=> X0 = a47 ) ).
%------ Positive definition of ssSkP4
fof(lit_def_024,axiom,
! [X0] :
( ssSkP4(X0)
<=> $true ) ).
%------ Positive definition of ssSkC10
fof(lit_def_025,axiom,
( ssSkC10
<=> $true ) ).
%------ Positive definition of ssSkC9
fof(lit_def_026,axiom,
( ssSkC9
<=> $false ) ).
%------ Positive definition of ssSkC8
fof(lit_def_027,axiom,
( ssSkC8
<=> $true ) ).
%------ Positive definition of ssSkC7
fof(lit_def_028,axiom,
( ssSkC7
<=> $false ) ).
%------ Positive definition of c2_1
fof(lit_def_029,axiom,
! [X0] :
( c2_1(X0)
<=> ( X0 = a27
| X0 = a53 ) ) ).
%------ Positive definition of ssSkC6
fof(lit_def_030,axiom,
( ssSkC6
<=> $true ) ).
%------ Positive definition of ssSkC5
fof(lit_def_031,axiom,
( ssSkC5
<=> $false ) ).
%------ Positive definition of ssSkC4
fof(lit_def_032,axiom,
( ssSkC4
<=> $true ) ).
%------ Positive definition of ssSkP3
fof(lit_def_033,axiom,
! [X0] :
( ssSkP3(X0)
<=> ( X0 = a32
| X0 = a59
| X0 = a120
| X0 = a113
| X0 = a64
| X0 = a93
| X0 = a104 ) ) ).
%------ Negative definition of ssSkP2
fof(lit_def_034,axiom,
! [X0] :
( ~ ssSkP2(X0)
<=> $false ) ).
%------ Positive definition of ssSkP1
fof(lit_def_035,axiom,
! [X0] :
( ssSkP1(X0)
<=> $true ) ).
%------ Negative definition of ssSkP0
fof(lit_def_036,axiom,
! [X0] :
( ~ ssSkP0(X0)
<=> $false ) ).
%------ Positive definition of c1_1
fof(lit_def_037,axiom,
! [X0] :
( c1_1(X0)
<=> X0 = a53 ) ).
%------ Positive definition of c1_0
fof(lit_def_038,axiom,
( c1_0
<=> $false ) ).
%------ Positive definition of c7_1
fof(lit_def_039,axiom,
! [X0] :
( c7_1(X0)
<=> ( X0 = a122
| X0 = a117
| X0 = a27
| X0 = a53 ) ) ).
%------ Positive definition of c7_2
fof(lit_def_040,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( ( X0 = a136
& X1 = a71 )
| ( X0 = a47
& X1 = a49 ) ) ) ).
%------ Positive definition of c8_2
fof(lit_def_041,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X0 = a136
& X1 = a4 )
| ( X0 = a47
& X1 = a48 ) ) ) ).
%------ Positive definition of ssSkC2
fof(lit_def_042,axiom,
( ssSkC2
<=> $true ) ).
%------ Positive definition of c7_0
fof(lit_def_043,axiom,
( c7_0
<=> $true ) ).
%------ Positive definition of c4_1
fof(lit_def_044,axiom,
! [X0] :
( c4_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkC20
fof(lit_def_045,axiom,
( ssSkC20
<=> $false ) ).
%------ Positive definition of c4_2
fof(lit_def_046,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( X0 = a53
& X1 = a54 ) ) ).
%------ Positive definition of c6_2
fof(lit_def_047,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( ( X0 = a136
& X1 = a108 )
| ( X0 = a53
& X1 = a55 ) ) ) ).
%------ Positive definition of c2_2
fof(lit_def_048,axiom,
! [X0,X1] :
( c2_2(X0,X1)
<=> ( ( X0 = a27
& X1 = a28 )
| ( X0 = a53
& X1 = a55 ) ) ) ).
%------ Positive definition of ssSkC22
fof(lit_def_049,axiom,
( ssSkC22
<=> $false ) ).
%------ Positive definition of c5_0
fof(lit_def_050,axiom,
( c5_0
<=> $true ) ).
%------ Positive definition of ssSkC14
fof(lit_def_051,axiom,
( ssSkC14
<=> $false ) ).
%------ Positive definition of ssSkC12
fof(lit_def_052,axiom,
( ssSkC12
<=> $true ) ).
%------ Positive definition of ssSkC16
fof(lit_def_053,axiom,
( ssSkC16
<=> $true ) ).
%------ Positive definition of ssSkC1
fof(lit_def_054,axiom,
( ssSkC1
<=> $true ) ).
%------ Positive definition of ssSkC19
fof(lit_def_055,axiom,
( ssSkC19
<=> $true ) ).
%------ Positive definition of ssSkC11
fof(lit_def_056,axiom,
( ssSkC11
<=> $false ) ).
%------ Positive definition of ssSkC0
fof(lit_def_057,axiom,
( ssSkC0
<=> $false ) ).
%------ Positive definition of ssSkC3
fof(lit_def_058,axiom,
( ssSkC3
<=> $true ) ).
%------ Positive definition of ssSkC18
fof(lit_def_059,axiom,
( ssSkC18
<=> $false ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_060,axiom,
( sP0_iProver_split
<=> $true ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_061,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_062,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_063,axiom,
( sP3_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_064,axiom,
( sP4_iProver_split
<=> $true ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_065,axiom,
( sP5_iProver_split
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_066,axiom,
( sP6_iProver_split
<=> $true ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_067,axiom,
( sP7_iProver_split
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_068,axiom,
( sP8_iProver_split
<=> $false ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_069,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_070,axiom,
( sP10_iProver_split
<=> $true ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_071,axiom,
( sP11_iProver_split
<=> $false ) ).
%------ Positive definition of sP12_iProver_split
fof(lit_def_072,axiom,
( sP12_iProver_split
<=> $false ) ).
%------ Positive definition of sP13_iProver_split
fof(lit_def_073,axiom,
( sP13_iProver_split
<=> $false ) ).
%------ Positive definition of sP14_iProver_split
fof(lit_def_074,axiom,
( sP14_iProver_split
<=> $false ) ).
%------ Positive definition of sP15_iProver_split
fof(lit_def_075,axiom,
( sP15_iProver_split
<=> $false ) ).
%------ Positive definition of sP16_iProver_split
fof(lit_def_076,axiom,
( sP16_iProver_split
<=> $false ) ).
%------ Positive definition of sP17_iProver_split
fof(lit_def_077,axiom,
( sP17_iProver_split
<=> $false ) ).
%------ Positive definition of sP18_iProver_split
fof(lit_def_078,axiom,
( sP18_iProver_split
<=> $false ) ).
%------ Positive definition of sP19_iProver_split
fof(lit_def_079,axiom,
( sP19_iProver_split
<=> $false ) ).
%------ Positive definition of sP20_iProver_split
fof(lit_def_080,axiom,
( sP20_iProver_split
<=> $false ) ).
%------ Positive definition of sP21_iProver_split
fof(lit_def_081,axiom,
( sP21_iProver_split
<=> $false ) ).
%------ Positive definition of sP22_iProver_split
fof(lit_def_082,axiom,
( sP22_iProver_split
<=> $false ) ).
%------ Positive definition of sP23_iProver_split
fof(lit_def_083,axiom,
( sP23_iProver_split
<=> $false ) ).
%------ Positive definition of sP24_iProver_split
fof(lit_def_084,axiom,
( sP24_iProver_split
<=> $false ) ).
%------ Positive definition of sP25_iProver_split
fof(lit_def_085,axiom,
( sP25_iProver_split
<=> $true ) ).
%------ Positive definition of sP26_iProver_split
fof(lit_def_086,axiom,
( sP26_iProver_split
<=> $false ) ).
%------ Positive definition of sP27_iProver_split
fof(lit_def_087,axiom,
( sP27_iProver_split
<=> $false ) ).
%------ Positive definition of sP28_iProver_split
fof(lit_def_088,axiom,
( sP28_iProver_split
<=> $false ) ).
%------ Positive definition of sP29_iProver_split
fof(lit_def_089,axiom,
( sP29_iProver_split
<=> $false ) ).
%------ Positive definition of sP30_iProver_split
fof(lit_def_090,axiom,
( sP30_iProver_split
<=> $false ) ).
%------ Positive definition of sP31_iProver_split
fof(lit_def_091,axiom,
( sP31_iProver_split
<=> $false ) ).
%------ Positive definition of sP32_iProver_split
fof(lit_def_092,axiom,
( sP32_iProver_split
<=> $false ) ).
%------ Positive definition of sP33_iProver_split
fof(lit_def_093,axiom,
( sP33_iProver_split
<=> $true ) ).
%------ Positive definition of sP34_iProver_split
fof(lit_def_094,axiom,
( sP34_iProver_split
<=> $false ) ).
%------ Positive definition of sP35_iProver_split
fof(lit_def_095,axiom,
( sP35_iProver_split
<=> $false ) ).
%------ Positive definition of sP36_iProver_split
fof(lit_def_096,axiom,
( sP36_iProver_split
<=> $false ) ).
%------ Positive definition of sP37_iProver_split
fof(lit_def_097,axiom,
( sP37_iProver_split
<=> $false ) ).
%------ Positive definition of sP38_iProver_split
fof(lit_def_098,axiom,
( sP38_iProver_split
<=> $true ) ).
%------ Positive definition of sP39_iProver_split
fof(lit_def_099,axiom,
( sP39_iProver_split
<=> $true ) ).
%------ Positive definition of sP40_iProver_split
fof(lit_def_100,axiom,
( sP40_iProver_split
<=> $true ) ).
%------ Positive definition of sP41_iProver_split
fof(lit_def_101,axiom,
( sP41_iProver_split
<=> $false ) ).
%------ Positive definition of sP42_iProver_split
fof(lit_def_102,axiom,
( sP42_iProver_split
<=> $false ) ).
%------ Positive definition of sP43_iProver_split
fof(lit_def_103,axiom,
( sP43_iProver_split
<=> $false ) ).
%------ Positive definition of sP44_iProver_split
fof(lit_def_104,axiom,
( sP44_iProver_split
<=> $false ) ).
%------ Positive definition of sP45_iProver_split
fof(lit_def_105,axiom,
( sP45_iProver_split
<=> $false ) ).
%------ Positive definition of sP46_iProver_split
fof(lit_def_106,axiom,
( sP46_iProver_split
<=> $false ) ).
%------ Positive definition of sP47_iProver_split
fof(lit_def_107,axiom,
( sP47_iProver_split
<=> $false ) ).
%------ Positive definition of sP48_iProver_split
fof(lit_def_108,axiom,
( sP48_iProver_split
<=> $false ) ).
%------ Positive definition of sP49_iProver_split
fof(lit_def_109,axiom,
( sP49_iProver_split
<=> $false ) ).
%------ Positive definition of sP50_iProver_split
fof(lit_def_110,axiom,
( sP50_iProver_split
<=> $false ) ).
%------ Positive definition of sP51_iProver_split
fof(lit_def_111,axiom,
( sP51_iProver_split
<=> $false ) ).
%------ Positive definition of sP52_iProver_split
fof(lit_def_112,axiom,
( sP52_iProver_split
<=> $false ) ).
%------ Positive definition of sP53_iProver_split
fof(lit_def_113,axiom,
( sP53_iProver_split
<=> $false ) ).
%------ Positive definition of sP54_iProver_split
fof(lit_def_114,axiom,
( sP54_iProver_split
<=> $false ) ).
%------ Positive definition of sP55_iProver_split
fof(lit_def_115,axiom,
( sP55_iProver_split
<=> $true ) ).
%------ Positive definition of sP56_iProver_split
fof(lit_def_116,axiom,
( sP56_iProver_split
<=> $false ) ).
%------ Positive definition of sP57_iProver_split
fof(lit_def_117,axiom,
( sP57_iProver_split
<=> $false ) ).
%------ Positive definition of sP58_iProver_split
fof(lit_def_118,axiom,
( sP58_iProver_split
<=> $false ) ).
%------ Positive definition of sP59_iProver_split
fof(lit_def_119,axiom,
( sP59_iProver_split
<=> $false ) ).
%------ Positive definition of sP60_iProver_split
fof(lit_def_120,axiom,
( sP60_iProver_split
<=> $false ) ).
%------ Positive definition of sP61_iProver_split
fof(lit_def_121,axiom,
( sP61_iProver_split
<=> $false ) ).
%------ Positive definition of sP62_iProver_split
fof(lit_def_122,axiom,
( sP62_iProver_split
<=> $false ) ).
%------ Positive definition of sP63_iProver_split
fof(lit_def_123,axiom,
( sP63_iProver_split
<=> $false ) ).
%------ Positive definition of sP64_iProver_split
fof(lit_def_124,axiom,
( sP64_iProver_split
<=> $false ) ).
%------ Positive definition of sP65_iProver_split
fof(lit_def_125,axiom,
( sP65_iProver_split
<=> $false ) ).
%------ Positive definition of sP66_iProver_split
fof(lit_def_126,axiom,
( sP66_iProver_split
<=> $false ) ).
%------ Positive definition of sP67_iProver_split
fof(lit_def_127,axiom,
( sP67_iProver_split
<=> $false ) ).
%------ Positive definition of sP68_iProver_split
fof(lit_def_128,axiom,
( sP68_iProver_split
<=> $false ) ).
%------ Positive definition of sP69_iProver_split
fof(lit_def_129,axiom,
( sP69_iProver_split
<=> $false ) ).
%------ Positive definition of sP70_iProver_split
fof(lit_def_130,axiom,
( sP70_iProver_split
<=> $false ) ).
%------ Positive definition of sP71_iProver_split
fof(lit_def_131,axiom,
( sP71_iProver_split
<=> $false ) ).
%------ Positive definition of sP72_iProver_split
fof(lit_def_132,axiom,
( sP72_iProver_split
<=> $false ) ).
%------ Positive definition of sP73_iProver_split
fof(lit_def_133,axiom,
( sP73_iProver_split
<=> $false ) ).
%------ Positive definition of sP74_iProver_split
fof(lit_def_134,axiom,
( sP74_iProver_split
<=> $false ) ).
%------ Positive definition of sP75_iProver_split
fof(lit_def_135,axiom,
( sP75_iProver_split
<=> $false ) ).
%------ Positive definition of sP76_iProver_split
fof(lit_def_136,axiom,
( sP76_iProver_split
<=> $false ) ).
%------ Positive definition of sP77_iProver_split
fof(lit_def_137,axiom,
( sP77_iProver_split
<=> $false ) ).
%------ Positive definition of sP78_iProver_split
fof(lit_def_138,axiom,
( sP78_iProver_split
<=> $false ) ).
%------ Positive definition of sP79_iProver_split
fof(lit_def_139,axiom,
( sP79_iProver_split
<=> $false ) ).
%------ Positive definition of sP80_iProver_split
fof(lit_def_140,axiom,
( sP80_iProver_split
<=> $false ) ).
%------ Positive definition of sP81_iProver_split
fof(lit_def_141,axiom,
( sP81_iProver_split
<=> $false ) ).
%------ Positive definition of sP82_iProver_split
fof(lit_def_142,axiom,
( sP82_iProver_split
<=> $false ) ).
%------ Positive definition of sP83_iProver_split
fof(lit_def_143,axiom,
( sP83_iProver_split
<=> $false ) ).
%------ Positive definition of sP84_iProver_split
fof(lit_def_144,axiom,
( sP84_iProver_split
<=> $false ) ).
%------ Positive definition of sP85_iProver_split
fof(lit_def_145,axiom,
( sP85_iProver_split
<=> $false ) ).
%------ Positive definition of sP86_iProver_split
fof(lit_def_146,axiom,
( sP86_iProver_split
<=> $false ) ).
%------ Positive definition of sP87_iProver_split
fof(lit_def_147,axiom,
( sP87_iProver_split
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN544-1 : TPTP v8.1.2. Released v2.1.0.
% 0.10/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n017.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 : Sat Aug 26 19:57: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
% 3.99/1.15 % SZS status Started for theBenchmark.p
% 3.99/1.15 % SZS status Satisfiable for theBenchmark.p
% 3.99/1.15
% 3.99/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.99/1.15
% 3.99/1.15 ------ iProver source info
% 3.99/1.15
% 3.99/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.99/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.99/1.15 git: non_committed_changes: false
% 3.99/1.15 git: last_make_outside_of_git: false
% 3.99/1.15
% 3.99/1.15 ------ Parsing...successful
% 3.99/1.15
% 3.99/1.15 ------ preprocesses with Option_epr_non_horn_non_eq
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15 ------ Preprocessing... sf_s rm: 24 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.99/1.15
% 3.99/1.15 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 3.99/1.15 gs_s sp: 122 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.15 ------ Proving...
% 3.99/1.15 ------ Problem Properties
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15 clauses 404
% 3.99/1.15 conjectures 384
% 3.99/1.15 EPR 404
% 3.99/1.15 Horn 191
% 3.99/1.15 unary 17
% 3.99/1.15 binary 121
% 3.99/1.15 lits 1339
% 3.99/1.15 lits eq 0
% 3.99/1.15 fd_pure 0
% 3.99/1.15 fd_pseudo 0
% 3.99/1.15 fd_cond 0
% 3.99/1.15 fd_pseudo_cond 0
% 3.99/1.15 AC symbols 0
% 3.99/1.15
% 3.99/1.15 ------ Schedule EPR non Horn non eq is on
% 3.99/1.15
% 3.99/1.15 ------ no equalities: superposition off
% 3.99/1.15
% 3.99/1.15 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15 ------
% 3.99/1.15 Current options:
% 3.99/1.15 ------
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15 ------ Proving...
% 3.99/1.15
% 3.99/1.15
% 3.99/1.15 % SZS status Satisfiable for theBenchmark.p
% 3.99/1.15
% 3.99/1.15 ------ Building Model...Done
% 3.99/1.15
% 3.99/1.15 %------ The model is defined over ground terms (initial term algebra).
% 3.99/1.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.99/1.15 %------ where \phi is a formula over the term algebra.
% 3.99/1.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.99/1.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.99/1.15 %------ See help for --sat_out_model for different model outputs.
% 3.99/1.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.99/1.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.99/1.15 % SZS output start Model for theBenchmark.p
% See solution above
% 3.99/1.16 ------ Statistics
% 3.99/1.16
% 3.99/1.16 ------ Problem properties
% 3.99/1.16
% 3.99/1.16 clauses: 404
% 3.99/1.16 conjectures: 384
% 3.99/1.16 epr: 404
% 3.99/1.16 horn: 191
% 3.99/1.16 ground: 204
% 3.99/1.16 unary: 17
% 3.99/1.16 binary: 121
% 3.99/1.16 lits: 1339
% 3.99/1.16 lits_eq: 0
% 3.99/1.16 fd_pure: 0
% 3.99/1.16 fd_pseudo: 0
% 3.99/1.16 fd_cond: 0
% 3.99/1.16 fd_pseudo_cond: 0
% 3.99/1.16 ac_symbols: 0
% 3.99/1.16
% 3.99/1.16 ------ General
% 3.99/1.16
% 3.99/1.16 abstr_ref_over_cycles: 0
% 3.99/1.16 abstr_ref_under_cycles: 0
% 3.99/1.16 gc_basic_clause_elim: 0
% 3.99/1.16 num_of_symbols: 357
% 3.99/1.16 num_of_terms: 2520
% 3.99/1.16
% 3.99/1.16 parsing_time: 0.01
% 3.99/1.16 unif_index_cands_time: 0.
% 3.99/1.16 unif_index_add_time: 0.
% 3.99/1.16 orderings_time: 0.
% 3.99/1.16 out_proof_time: 0.
% 3.99/1.16 total_time: 0.396
% 3.99/1.16
% 3.99/1.16 ------ Preprocessing
% 3.99/1.16
% 3.99/1.16 num_of_splits: 122
% 3.99/1.16 num_of_split_atoms: 88
% 3.99/1.16 num_of_reused_defs: 34
% 3.99/1.16 num_eq_ax_congr_red: 0
% 3.99/1.16 num_of_sem_filtered_clauses: 24
% 3.99/1.16 num_of_subtypes: 0
% 3.99/1.16 monotx_restored_types: 0
% 3.99/1.16 sat_num_of_epr_types: 0
% 3.99/1.16 sat_num_of_non_cyclic_types: 0
% 3.99/1.16 sat_guarded_non_collapsed_types: 0
% 3.99/1.16 num_pure_diseq_elim: 0
% 3.99/1.16 simp_replaced_by: 0
% 3.99/1.16 res_preprocessed: 0
% 3.99/1.16 sup_preprocessed: 0
% 3.99/1.16 prep_upred: 0
% 3.99/1.16 prep_unflattend: 0
% 3.99/1.16 prep_well_definedness: 0
% 3.99/1.16 smt_new_axioms: 0
% 3.99/1.16 pred_elim_cands: 49
% 3.99/1.16 pred_elim: 0
% 3.99/1.16 pred_elim_cl: 0
% 3.99/1.16 pred_elim_cycles: 72
% 3.99/1.16 merged_defs: 0
% 3.99/1.16 merged_defs_ncl: 0
% 3.99/1.16 bin_hyper_res: 0
% 3.99/1.16 prep_cycles: 2
% 3.99/1.16
% 3.99/1.16 splitting_time: 0.001
% 3.99/1.16 sem_filter_time: 0.002
% 3.99/1.16 monotx_time: 0.
% 3.99/1.16 subtype_inf_time: 0.
% 3.99/1.16 res_prep_time: 0.088
% 3.99/1.16 sup_prep_time: 0.003
% 3.99/1.16 pred_elim_time: 0.216
% 3.99/1.16 bin_hyper_res_time: 0.001
% 3.99/1.16 prep_time_total: 0.337
% 3.99/1.16
% 3.99/1.16 ------ Propositional Solver
% 3.99/1.16
% 3.99/1.16 prop_solver_calls: 10
% 3.99/1.16 prop_fast_solver_calls: 15005
% 3.99/1.16 smt_solver_calls: 0
% 3.99/1.16 smt_fast_solver_calls: 0
% 3.99/1.16 prop_num_of_clauses: 2056
% 3.99/1.16 prop_preprocess_simplified: 13658
% 3.99/1.16 prop_fo_subsumed: 368
% 3.99/1.16
% 3.99/1.16 prop_solver_time: 0.
% 3.99/1.16 prop_fast_solver_time: 0.014
% 3.99/1.16 prop_unsat_core_time: 0.
% 3.99/1.16 smt_solver_time: 0.
% 3.99/1.16 smt_fast_solver_time: 0.
% 3.99/1.16
% 3.99/1.16 ------ QBF
% 3.99/1.16
% 3.99/1.16 qbf_q_res: 0
% 3.99/1.16 qbf_num_tautologies: 0
% 3.99/1.16 qbf_prep_cycles: 0
% 3.99/1.16
% 3.99/1.16 ------ BMC1
% 3.99/1.16
% 3.99/1.16 bmc1_current_bound: -1
% 3.99/1.16 bmc1_last_solved_bound: -1
% 3.99/1.16 bmc1_unsat_core_size: -1
% 3.99/1.16 bmc1_unsat_core_parents_size: -1
% 3.99/1.16 bmc1_merge_next_fun: 0
% 3.99/1.16
% 3.99/1.16 bmc1_unsat_core_clauses_time: 0.
% 3.99/1.16
% 3.99/1.16 ------ Instantiation
% 3.99/1.16
% 3.99/1.16 inst_num_of_clauses: 529
% 3.99/1.16 inst_num_in_passive: 0
% 3.99/1.16 inst_num_in_active: 529
% 3.99/1.16 inst_num_of_loops: 586
% 3.99/1.16 inst_num_in_unprocessed: 0
% 3.99/1.16 inst_num_of_learning_restarts: 0
% 3.99/1.16 inst_num_moves_active_passive: 50
% 3.99/1.16 inst_lit_activity: 0
% 3.99/1.16 inst_lit_activity_moves: 0
% 3.99/1.16 inst_num_tautologies: 0
% 3.99/1.16 inst_num_prop_implied: 0
% 3.99/1.16 inst_num_existing_simplified: 0
% 3.99/1.16 inst_num_eq_res_simplified: 0
% 3.99/1.16 inst_num_child_elim: 0
% 3.99/1.16 inst_num_of_dismatching_blockings: 0
% 3.99/1.16 inst_num_of_non_proper_insts: 106
% 3.99/1.16 inst_num_of_duplicates: 0
% 3.99/1.16 inst_inst_num_from_inst_to_res: 0
% 3.99/1.16
% 3.99/1.16 inst_time_sim_new: 0.008
% 3.99/1.16 inst_time_sim_given: 0.
% 3.99/1.16 inst_time_dismatching_checking: 0.
% 3.99/1.16 inst_time_total: 0.016
% 3.99/1.16
% 3.99/1.16 ------ Resolution
% 3.99/1.16
% 3.99/1.16 res_num_of_clauses: 316
% 3.99/1.16 res_num_in_passive: 0
% 3.99/1.16 res_num_in_active: 0
% 3.99/1.16 res_num_of_loops: 658
% 3.99/1.16 res_forward_subset_subsumed: 15
% 3.99/1.16 res_backward_subset_subsumed: 0
% 3.99/1.16 res_forward_subsumed: 34
% 3.99/1.16 res_backward_subsumed: 0
% 3.99/1.16 res_forward_subsumption_resolution: 0
% 3.99/1.16 res_backward_subsumption_resolution: 7
% 3.99/1.16 res_clause_to_clause_subsumption: 288
% 3.99/1.16 res_subs_bck_cnt: 1
% 3.99/1.16 res_orphan_elimination: 0
% 3.99/1.16 res_tautology_del: 12
% 3.99/1.16 res_num_eq_res_simplified: 0
% 3.99/1.16 res_num_sel_changes: 0
% 3.99/1.16 res_moves_from_active_to_pass: 0
% 3.99/1.16
% 3.99/1.16 res_time_sim_new: 0.014
% 3.99/1.16 res_time_sim_fw_given: 0.047
% 3.99/1.16 res_time_sim_bw_given: 0.019
% 3.99/1.16 res_time_total: 0.015
% 3.99/1.16
% 3.99/1.16 ------ Superposition
% 3.99/1.16
% 3.99/1.16 sup_num_of_clauses: 404
% 3.99/1.16 sup_num_in_active: 0
% 3.99/1.16 sup_num_in_passive: 404
% 3.99/1.16 sup_num_of_loops: 0
% 3.99/1.16 sup_fw_superposition: 0
% 3.99/1.16 sup_bw_superposition: 0
% 3.99/1.16 sup_eq_factoring: 0
% 3.99/1.16 sup_eq_resolution: 0
% 3.99/1.16 sup_immediate_simplified: 0
% 3.99/1.16 sup_given_eliminated: 0
% 3.99/1.16 comparisons_done: 0
% 3.99/1.16 comparisons_avoided: 0
% 3.99/1.16 comparisons_inc_criteria: 0
% 3.99/1.16 sup_deep_cl_discarded: 0
% 3.99/1.16 sup_num_of_deepenings: 0
% 3.99/1.16 sup_num_of_restarts: 0
% 3.99/1.16
% 3.99/1.16 sup_time_generating: 0.
% 3.99/1.16 sup_time_sim_fw_full: 0.
% 3.99/1.16 sup_time_sim_bw_full: 0.
% 3.99/1.16 sup_time_sim_fw_immed: 0.
% 3.99/1.16 sup_time_sim_bw_immed: 0.
% 3.99/1.16 sup_time_prep_sim_fw_input: 0.
% 3.99/1.16 sup_time_prep_sim_bw_input: 0.001
% 3.99/1.16 sup_time_total: 0.008
% 3.99/1.16
% 3.99/1.16 ------ Simplifications
% 3.99/1.16
% 3.99/1.16 sim_repeated: 0
% 3.99/1.16 sim_fw_subset_subsumed: 0
% 3.99/1.16 sim_bw_subset_subsumed: 0
% 3.99/1.16 sim_fw_subsumed: 0
% 3.99/1.16 sim_bw_subsumed: 0
% 3.99/1.16 sim_fw_subsumption_res: 0
% 3.99/1.16 sim_bw_subsumption_res: 0
% 3.99/1.16 sim_fw_unit_subs: 0
% 3.99/1.16 sim_bw_unit_subs: 0
% 3.99/1.16 sim_tautology_del: 0
% 3.99/1.16 sim_eq_tautology_del: 0
% 3.99/1.16 sim_eq_res_simp: 0
% 3.99/1.16 sim_fw_demodulated: 0
% 3.99/1.16 sim_bw_demodulated: 0
% 3.99/1.16 sim_encompassment_demod: 0
% 3.99/1.16 sim_light_normalised: 0
% 3.99/1.16 sim_ac_normalised: 0
% 3.99/1.16 sim_joinable_taut: 0
% 3.99/1.16 sim_joinable_simp: 0
% 3.99/1.16 sim_fw_ac_demod: 0
% 3.99/1.16 sim_bw_ac_demod: 0
% 3.99/1.16 sim_smt_subsumption: 0
% 3.99/1.16 sim_smt_simplified: 0
% 3.99/1.16 sim_ground_joinable: 0
% 3.99/1.16 sim_bw_ground_joinable: 0
% 3.99/1.16 sim_connectedness: 0
% 3.99/1.16
% 3.99/1.16 sim_time_fw_subset_subs: 0.
% 3.99/1.16 sim_time_bw_subset_subs: 0.
% 3.99/1.16 sim_time_fw_subs: 0.
% 3.99/1.16 sim_time_bw_subs: 0.
% 3.99/1.16 sim_time_fw_subs_res: 0.
% 3.99/1.16 sim_time_bw_subs_res: 0.
% 3.99/1.16 sim_time_fw_unit_subs: 0.
% 3.99/1.16 sim_time_bw_unit_subs: 0.
% 3.99/1.16 sim_time_tautology_del: 0.
% 3.99/1.16 sim_time_eq_tautology_del: 0.
% 3.99/1.16 sim_time_eq_res_simp: 0.
% 3.99/1.16 sim_time_fw_demod: 0.
% 3.99/1.16 sim_time_bw_demod: 0.
% 3.99/1.16 sim_time_light_norm: 0.
% 3.99/1.16 sim_time_joinable: 0.
% 3.99/1.16 sim_time_ac_norm: 0.
% 3.99/1.16 sim_time_fw_ac_demod: 0.
% 3.99/1.16 sim_time_bw_ac_demod: 0.
% 3.99/1.16 sim_time_smt_subs: 0.
% 3.99/1.16 sim_time_fw_gjoin: 0.
% 3.99/1.16 sim_time_fw_connected: 0.
% 3.99/1.16
% 3.99/1.16
%------------------------------------------------------------------------------