TSTP Solution File: LCL912+1 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : LCL912+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n018.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 May 3 02:42:55 EDT 2024
% Result : Satisfiable 1.96s 1.20s
% Output : Model 2.07s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of equality_sorted
fof(lit_def,axiom,
! [X0_12,X0,X1] :
( equality_sorted(X0_12,X0,X1)
<=> X0_12 = $i ) ).
%------ Positive definition of modus_ponens
fof(lit_def_001,axiom,
( modus_ponens
<=> $true ) ).
%------ Positive definition of is_a_theorem
fof(lit_def_002,axiom,
! [X0] :
( is_a_theorem(X0)
<=> $true ) ).
%------ Positive definition of substitution_of_equivalents
fof(lit_def_003,axiom,
( substitution_of_equivalents
<=> $true ) ).
%------ Positive definition of modus_tollens
fof(lit_def_004,axiom,
( modus_tollens
<=> $true ) ).
%------ Positive definition of implies_1
fof(lit_def_005,axiom,
( implies_1
<=> $true ) ).
%------ Positive definition of implies_2
fof(lit_def_006,axiom,
( implies_2
<=> $true ) ).
%------ Positive definition of implies_3
fof(lit_def_007,axiom,
( implies_3
<=> $true ) ).
%------ Positive definition of and_1
fof(lit_def_008,axiom,
( and_1
<=> $true ) ).
%------ Positive definition of and_2
fof(lit_def_009,axiom,
( and_2
<=> $true ) ).
%------ Positive definition of and_3
fof(lit_def_010,axiom,
( and_3
<=> $true ) ).
%------ Positive definition of or_1
fof(lit_def_011,axiom,
( or_1
<=> $true ) ).
%------ Positive definition of or_2
fof(lit_def_012,axiom,
( or_2
<=> $true ) ).
%------ Positive definition of or_3
fof(lit_def_013,axiom,
( or_3
<=> $true ) ).
%------ Positive definition of equivalence_1
fof(lit_def_014,axiom,
( equivalence_1
<=> $true ) ).
%------ Positive definition of equivalence_2
fof(lit_def_015,axiom,
( equivalence_2
<=> $true ) ).
%------ Positive definition of equivalence_3
fof(lit_def_016,axiom,
( equivalence_3
<=> $true ) ).
%------ Positive definition of kn1
fof(lit_def_017,axiom,
( kn1
<=> $true ) ).
%------ Positive definition of kn2
fof(lit_def_018,axiom,
( kn2
<=> $true ) ).
%------ Positive definition of kn3
fof(lit_def_019,axiom,
( kn3
<=> $true ) ).
%------ Positive definition of cn1
fof(lit_def_020,axiom,
( cn1
<=> $true ) ).
%------ Positive definition of cn2
fof(lit_def_021,axiom,
( cn2
<=> $true ) ).
%------ Positive definition of cn3
fof(lit_def_022,axiom,
( cn3
<=> $true ) ).
%------ Positive definition of r1
fof(lit_def_023,axiom,
( r1
<=> $true ) ).
%------ Positive definition of r2
fof(lit_def_024,axiom,
( r2
<=> $true ) ).
%------ Positive definition of r3
fof(lit_def_025,axiom,
( r3
<=> $true ) ).
%------ Positive definition of r4
fof(lit_def_026,axiom,
( r4
<=> $true ) ).
%------ Positive definition of r5
fof(lit_def_027,axiom,
( r5
<=> $true ) ).
%------ Positive definition of op_or
fof(lit_def_028,axiom,
( op_or
<=> $true ) ).
%------ Positive definition of op_and
fof(lit_def_029,axiom,
( op_and
<=> $false ) ).
%------ Positive definition of op_implies_and
fof(lit_def_030,axiom,
( op_implies_and
<=> $true ) ).
%------ Positive definition of op_implies_or
fof(lit_def_031,axiom,
( op_implies_or
<=> $false ) ).
%------ Positive definition of op_equiv
fof(lit_def_032,axiom,
( op_equiv
<=> $true ) ).
%------ Positive definition of necessitation
fof(lit_def_033,axiom,
( necessitation
<=> $true ) ).
%------ Positive definition of modus_ponens_strict_implies
fof(lit_def_034,axiom,
( modus_ponens_strict_implies
<=> $true ) ).
%------ Positive definition of adjunction
fof(lit_def_035,axiom,
( adjunction
<=> $true ) ).
%------ Positive definition of substitution_strict_equiv
fof(lit_def_036,axiom,
( substitution_strict_equiv
<=> $true ) ).
%------ Positive definition of axiom_K
fof(lit_def_037,axiom,
( axiom_K
<=> $true ) ).
%------ Positive definition of axiom_M
fof(lit_def_038,axiom,
( axiom_M
<=> $true ) ).
%------ Positive definition of axiom_4
fof(lit_def_039,axiom,
( axiom_4
<=> $true ) ).
%------ Positive definition of axiom_B
fof(lit_def_040,axiom,
( axiom_B
<=> $true ) ).
%------ Positive definition of axiom_5
fof(lit_def_041,axiom,
( axiom_5
<=> $true ) ).
%------ Positive definition of axiom_s1
fof(lit_def_042,axiom,
( axiom_s1
<=> $true ) ).
%------ Positive definition of axiom_s2
fof(lit_def_043,axiom,
( axiom_s2
<=> $true ) ).
%------ Positive definition of axiom_s3
fof(lit_def_044,axiom,
( axiom_s3
<=> $true ) ).
%------ Positive definition of axiom_s4
fof(lit_def_045,axiom,
( axiom_s4
<=> $true ) ).
%------ Positive definition of axiom_m1
fof(lit_def_046,axiom,
( axiom_m1
<=> $true ) ).
%------ Positive definition of axiom_m2
fof(lit_def_047,axiom,
( axiom_m2
<=> $true ) ).
%------ Positive definition of axiom_m3
fof(lit_def_048,axiom,
( axiom_m3
<=> $true ) ).
%------ Positive definition of axiom_m4
fof(lit_def_049,axiom,
( axiom_m4
<=> $true ) ).
%------ Positive definition of axiom_m5
fof(lit_def_050,axiom,
( axiom_m5
<=> $true ) ).
%------ Positive definition of axiom_m6
fof(lit_def_051,axiom,
( axiom_m6
<=> $true ) ).
%------ Positive definition of axiom_m7
fof(lit_def_052,axiom,
( axiom_m7
<=> $true ) ).
%------ Positive definition of axiom_m8
fof(lit_def_053,axiom,
( axiom_m8
<=> $true ) ).
%------ Positive definition of axiom_m9
fof(lit_def_054,axiom,
( axiom_m9
<=> $true ) ).
%------ Positive definition of axiom_m10
fof(lit_def_055,axiom,
( axiom_m10
<=> $true ) ).
%------ Positive definition of op_possibly
fof(lit_def_056,axiom,
( op_possibly
<=> $true ) ).
%------ Positive definition of op_necessarily
fof(lit_def_057,axiom,
( op_necessarily
<=> $false ) ).
%------ Positive definition of op_strict_implies
fof(lit_def_058,axiom,
( op_strict_implies
<=> $false ) ).
%------ Positive definition of op_strict_equiv
fof(lit_def_059,axiom,
( op_strict_equiv
<=> $false ) ).
%------ Positive definition of iProver_Flat_sK1
fof(lit_def_060,axiom,
! [X0] :
( iProver_Flat_sK1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK0
fof(lit_def_061,axiom,
! [X0] :
( iProver_Flat_sK0(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_implies
fof(lit_def_062,axiom,
! [X0,X1,X2] :
( iProver_Flat_implies(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK2
fof(lit_def_063,axiom,
! [X0] :
( iProver_Flat_sK2(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK3
fof(lit_def_064,axiom,
! [X0] :
( iProver_Flat_sK3(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_equiv
fof(lit_def_065,axiom,
! [X0,X1,X2] :
( iProver_Flat_equiv(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK5
fof(lit_def_066,axiom,
! [X0] :
( iProver_Flat_sK5(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_not
fof(lit_def_067,axiom,
! [X0,X1] :
( iProver_Flat_not(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK4
fof(lit_def_068,axiom,
! [X0] :
( iProver_Flat_sK4(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK6
fof(lit_def_069,axiom,
! [X0] :
( iProver_Flat_sK6(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK7
fof(lit_def_070,axiom,
! [X0] :
( iProver_Flat_sK7(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK8
fof(lit_def_071,axiom,
! [X0] :
( iProver_Flat_sK8(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK9
fof(lit_def_072,axiom,
! [X0] :
( iProver_Flat_sK9(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK10
fof(lit_def_073,axiom,
! [X0] :
( iProver_Flat_sK10(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK11
fof(lit_def_074,axiom,
! [X0] :
( iProver_Flat_sK11(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK12
fof(lit_def_075,axiom,
! [X0] :
( iProver_Flat_sK12(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK13
fof(lit_def_076,axiom,
! [X0] :
( iProver_Flat_sK13(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK14
fof(lit_def_077,axiom,
! [X0] :
( iProver_Flat_sK14(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_and
fof(lit_def_078,axiom,
! [X0,X1,X2] :
( iProver_Flat_and(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK15
fof(lit_def_079,axiom,
! [X0] :
( iProver_Flat_sK15(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK16
fof(lit_def_080,axiom,
! [X0] :
( iProver_Flat_sK16(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK17
fof(lit_def_081,axiom,
! [X0] :
( iProver_Flat_sK17(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK18
fof(lit_def_082,axiom,
! [X0] :
( iProver_Flat_sK18(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK19
fof(lit_def_083,axiom,
! [X0] :
( iProver_Flat_sK19(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK20
fof(lit_def_084,axiom,
! [X0] :
( iProver_Flat_sK20(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_or
fof(lit_def_085,axiom,
! [X0,X1,X2] :
( iProver_Flat_or(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK22
fof(lit_def_086,axiom,
! [X0] :
( iProver_Flat_sK22(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK21
fof(lit_def_087,axiom,
! [X0] :
( iProver_Flat_sK21(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK23
fof(lit_def_088,axiom,
! [X0] :
( iProver_Flat_sK23(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK25
fof(lit_def_089,axiom,
! [X0] :
( iProver_Flat_sK25(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK24
fof(lit_def_090,axiom,
! [X0] :
( iProver_Flat_sK24(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK26
fof(lit_def_091,axiom,
! [X0] :
( iProver_Flat_sK26(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK27
fof(lit_def_092,axiom,
! [X0] :
( iProver_Flat_sK27(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK28
fof(lit_def_093,axiom,
! [X0] :
( iProver_Flat_sK28(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK29
fof(lit_def_094,axiom,
! [X0] :
( iProver_Flat_sK29(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK30
fof(lit_def_095,axiom,
! [X0] :
( iProver_Flat_sK30(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK31
fof(lit_def_096,axiom,
! [X0] :
( iProver_Flat_sK31(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK32
fof(lit_def_097,axiom,
! [X0] :
( iProver_Flat_sK32(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK33
fof(lit_def_098,axiom,
! [X0] :
( iProver_Flat_sK33(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK34
fof(lit_def_099,axiom,
! [X0] :
( iProver_Flat_sK34(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK35
fof(lit_def_100,axiom,
! [X0] :
( iProver_Flat_sK35(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK36
fof(lit_def_101,axiom,
! [X0] :
( iProver_Flat_sK36(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK37
fof(lit_def_102,axiom,
! [X0] :
( iProver_Flat_sK37(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK38
fof(lit_def_103,axiom,
! [X0] :
( iProver_Flat_sK38(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK39
fof(lit_def_104,axiom,
! [X0] :
( iProver_Flat_sK39(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK40
fof(lit_def_105,axiom,
! [X0] :
( iProver_Flat_sK40(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK41
fof(lit_def_106,axiom,
! [X0] :
( iProver_Flat_sK41(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK42
fof(lit_def_107,axiom,
! [X0] :
( iProver_Flat_sK42(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK43
fof(lit_def_108,axiom,
! [X0] :
( iProver_Flat_sK43(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK44
fof(lit_def_109,axiom,
! [X0] :
( iProver_Flat_sK44(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK46
fof(lit_def_110,axiom,
! [X0] :
( iProver_Flat_sK46(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK45
fof(lit_def_111,axiom,
! [X0] :
( iProver_Flat_sK45(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK47
fof(lit_def_112,axiom,
! [X0] :
( iProver_Flat_sK47(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK48
fof(lit_def_113,axiom,
! [X0] :
( iProver_Flat_sK48(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK49
fof(lit_def_114,axiom,
! [X0] :
( iProver_Flat_sK49(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK50
fof(lit_def_115,axiom,
! [X0] :
( iProver_Flat_sK50(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK51
fof(lit_def_116,axiom,
! [X0] :
( iProver_Flat_sK51(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK53
fof(lit_def_117,axiom,
! [X0] :
( iProver_Flat_sK53(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK54
fof(lit_def_118,axiom,
! [X0] :
( iProver_Flat_sK54(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK52
fof(lit_def_119,axiom,
! [X0] :
( iProver_Flat_sK52(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK55
fof(lit_def_120,axiom,
! [X0] :
( iProver_Flat_sK55(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_necessarily
fof(lit_def_121,axiom,
! [X0,X1] :
( iProver_Flat_necessarily(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK57
fof(lit_def_122,axiom,
! [X0] :
( iProver_Flat_sK57(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK56
fof(lit_def_123,axiom,
! [X0] :
( iProver_Flat_sK56(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_strict_implies
fof(lit_def_124,axiom,
! [X0,X1,X2] :
( iProver_Flat_strict_implies(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK58
fof(lit_def_125,axiom,
! [X0] :
( iProver_Flat_sK58(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK59
fof(lit_def_126,axiom,
! [X0] :
( iProver_Flat_sK59(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK60
fof(lit_def_127,axiom,
! [X0] :
( iProver_Flat_sK60(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK61
fof(lit_def_128,axiom,
! [X0] :
( iProver_Flat_sK61(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_strict_equiv
fof(lit_def_129,axiom,
! [X0,X1,X2] :
( iProver_Flat_strict_equiv(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK62
fof(lit_def_130,axiom,
! [X0] :
( iProver_Flat_sK62(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK63
fof(lit_def_131,axiom,
! [X0] :
( iProver_Flat_sK63(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK64
fof(lit_def_132,axiom,
! [X0] :
( iProver_Flat_sK64(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK65
fof(lit_def_133,axiom,
! [X0] :
( iProver_Flat_sK65(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK66
fof(lit_def_134,axiom,
! [X0] :
( iProver_Flat_sK66(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_possibly
fof(lit_def_135,axiom,
! [X0,X1] :
( iProver_Flat_possibly(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK67
fof(lit_def_136,axiom,
! [X0] :
( iProver_Flat_sK67(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK68
fof(lit_def_137,axiom,
! [X0] :
( iProver_Flat_sK68(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK69
fof(lit_def_138,axiom,
! [X0] :
( iProver_Flat_sK69(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK70
fof(lit_def_139,axiom,
! [X0] :
( iProver_Flat_sK70(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK71
fof(lit_def_140,axiom,
! [X0] :
( iProver_Flat_sK71(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK72
fof(lit_def_141,axiom,
! [X0] :
( iProver_Flat_sK72(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK73
fof(lit_def_142,axiom,
! [X0] :
( iProver_Flat_sK73(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK74
fof(lit_def_143,axiom,
! [X0] :
( iProver_Flat_sK74(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK75
fof(lit_def_144,axiom,
! [X0] :
( iProver_Flat_sK75(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK76
fof(lit_def_145,axiom,
! [X0] :
( iProver_Flat_sK76(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK77
fof(lit_def_146,axiom,
! [X0] :
( iProver_Flat_sK77(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK78
fof(lit_def_147,axiom,
! [X0] :
( iProver_Flat_sK78(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK79
fof(lit_def_148,axiom,
! [X0] :
( iProver_Flat_sK79(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK80
fof(lit_def_149,axiom,
! [X0] :
( iProver_Flat_sK80(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK81
fof(lit_def_150,axiom,
! [X0] :
( iProver_Flat_sK81(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK82
fof(lit_def_151,axiom,
! [X0] :
( iProver_Flat_sK82(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK83
fof(lit_def_152,axiom,
! [X0] :
( iProver_Flat_sK83(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK84
fof(lit_def_153,axiom,
! [X0] :
( iProver_Flat_sK84(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK85
fof(lit_def_154,axiom,
! [X0] :
( iProver_Flat_sK85(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK86
fof(lit_def_155,axiom,
! [X0] :
( iProver_Flat_sK86(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK87
fof(lit_def_156,axiom,
! [X0] :
( iProver_Flat_sK87(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK88
fof(lit_def_157,axiom,
! [X0] :
( iProver_Flat_sK88(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK89
fof(lit_def_158,axiom,
! [X0] :
( iProver_Flat_sK89(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK90
fof(lit_def_159,axiom,
! [X0] :
( iProver_Flat_sK90(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK91
fof(lit_def_160,axiom,
! [X0] :
( iProver_Flat_sK91(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK92
fof(lit_def_161,axiom,
! [X0] :
( iProver_Flat_sK92(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK93
fof(lit_def_162,axiom,
! [X0] :
( iProver_Flat_sK93(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL912+1 : TPTP v8.1.2. Released v6.4.0.
% 0.07/0.14 % Command : run_iprover %s %d SAT
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:26:31 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.49/0.66 WARNING - Could not infer the problem pformat. Setting FOF as default
% 1.96/1.20 % SZS status Started for theBenchmark.p
% 1.96/1.20 % SZS status Satisfiable for theBenchmark.p
% 1.96/1.20
% 1.96/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.96/1.20
% 1.96/1.20 ------ iProver source info
% 1.96/1.20
% 1.96/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.96/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.96/1.20 git: non_committed_changes: false
% 1.96/1.20
% 1.96/1.20 ------ Parsing...
% 1.96/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.96/1.20 ------ Proving...
% 1.96/1.20 ------ Problem Properties
% 1.96/1.20
% 1.96/1.20
% 1.96/1.20 clauses 140
% 1.96/1.20 conjectures 33
% 1.96/1.20 EPR 33
% 1.96/1.20 Horn 131
% 1.96/1.20 unary 24
% 1.96/1.20 binary 110
% 1.96/1.20 lits 265
% 1.96/1.20 lits eq 13
% 1.96/1.20 fd_pure 0
% 1.96/1.20 fd_pseudo 0
% 1.96/1.20 fd_cond 0
% 1.96/1.20 fd_pseudo_cond 2
% 1.96/1.20 AC symbols 0
% 1.96/1.20
% 1.96/1.20 ------ Input Options Time Limit: Unbounded
% 1.96/1.20
% 1.96/1.20
% 1.96/1.20 ------ Finite Models:
% 1.96/1.20
% 1.96/1.20 ------ lit_activity_flag true
% 1.96/1.20
% 1.96/1.20
% 1.96/1.20 ------ Trying domains of size >= : 1
% 1.96/1.20 ------
% 1.96/1.20 Current options:
% 1.96/1.20 ------
% 1.96/1.20
% 1.96/1.20 ------ Input Options
% 1.96/1.20
% 1.96/1.20 --out_options all
% 1.96/1.20 --tptp_safe_out true
% 1.96/1.20 --problem_path ""
% 1.96/1.20 --include_path ""
% 1.96/1.20 --clausifier res/vclausify_rel
% 1.96/1.20 --clausifier_options --mode clausify -t 300.00 -updr off
% 1.96/1.20 --stdin false
% 1.96/1.20 --proof_out true
% 1.96/1.20 --proof_dot_file ""
% 1.96/1.20 --proof_reduce_dot []
% 1.96/1.20 --suppress_sat_res false
% 1.96/1.20 --suppress_unsat_res true
% 1.96/1.20 --stats_out none
% 1.96/1.20 --stats_mem false
% 1.96/1.20 --theory_stats_out false
% 1.96/1.20
% 1.96/1.20 ------ General Options
% 1.96/1.20
% 1.96/1.20 --fof false
% 1.96/1.20 --time_out_real 300.
% 1.96/1.20 --time_out_virtual -1.
% 1.96/1.20 --rnd_seed 13
% 1.96/1.20 --symbol_type_check false
% 1.96/1.20 --clausify_out false
% 1.96/1.20 --sig_cnt_out false
% 1.96/1.20 --trig_cnt_out false
% 1.96/1.20 --trig_cnt_out_tolerance 1.
% 1.96/1.20 --trig_cnt_out_sk_spl false
% 1.96/1.20 --abstr_cl_out false
% 1.96/1.20
% 1.96/1.20 ------ Interactive Mode
% 1.96/1.20
% 1.96/1.20 --interactive_mode false
% 1.96/1.20 --external_ip_address ""
% 1.96/1.20 --external_port 0
% 1.96/1.20
% 1.96/1.20 ------ Global Options
% 1.96/1.20
% 1.96/1.20 --schedule none
% 1.96/1.20 --add_important_lit false
% 1.96/1.20 --prop_solver_per_cl 500
% 1.96/1.20 --subs_bck_mult 8
% 1.96/1.20 --min_unsat_core false
% 1.96/1.20 --soft_assumptions false
% 1.96/1.20 --soft_lemma_size 3
% 1.96/1.20 --prop_impl_unit_size 0
% 1.96/1.20 --prop_impl_unit []
% 1.96/1.20 --share_sel_clauses true
% 1.96/1.20 --reset_solvers false
% 1.96/1.20 --bc_imp_inh [conj_cone]
% 1.96/1.20 --conj_cone_tolerance 3.
% 1.96/1.20 --extra_neg_conj all_pos_neg
% 1.96/1.20 --large_theory_mode true
% 1.96/1.20 --prolific_symb_bound 500
% 1.96/1.20 --lt_threshold 2000
% 1.96/1.20 --clause_weak_htbl true
% 1.96/1.20 --gc_record_bc_elim false
% 1.96/1.20
% 1.96/1.20 ------ Preprocessing Options
% 1.96/1.20
% 1.96/1.20 --preprocessing_flag false
% 1.96/1.20 --time_out_prep_mult 0.2
% 1.96/1.20 --splitting_mode input
% 1.96/1.20 --splitting_grd false
% 1.96/1.20 --splitting_cvd true
% 1.96/1.20 --splitting_cvd_svl true
% 1.96/1.20 --splitting_nvd 256
% 1.96/1.20 --sub_typing false
% 1.96/1.20 --prep_eq_flat_conj false
% 1.96/1.20 --prep_eq_flat_all_gr false
% 1.96/1.20 --prep_gs_sim false
% 1.96/1.20 --prep_unflatten true
% 1.96/1.20 --prep_res_sim true
% 1.96/1.20 --prep_sup_sim_all true
% 1.96/1.20 --prep_sup_sim_sup false
% 1.96/1.20 --prep_upred true
% 1.96/1.20 --prep_well_definedness true
% 1.96/1.20 --prep_sem_filter none
% 1.96/1.20 --prep_sem_filter_out false
% 1.96/1.20 --pred_elim true
% 1.96/1.20 --res_sim_input false
% 1.96/1.20 --eq_ax_congr_red true
% 1.96/1.20 --pure_diseq_elim false
% 1.96/1.20 --brand_transform false
% 1.96/1.20 --non_eq_to_eq false
% 1.96/1.20 --prep_def_merge false
% 1.96/1.20 --prep_def_merge_prop_impl false
% 1.96/1.20 --prep_def_merge_mbd true
% 1.96/1.20 --prep_def_merge_tr_red false
% 1.96/1.20 --prep_def_merge_tr_cl false
% 1.96/1.20 --smt_preprocessing false
% 1.96/1.20 --smt_ac_axioms fast
% 1.96/1.20 --preprocessed_out false
% 1.96/1.20 --preprocessed_stats false
% 1.96/1.20
% 1.96/1.20 ------ Abstraction refinement Options
% 1.96/1.20
% 1.96/1.20 --abstr_ref []
% 1.96/1.20 --abstr_ref_prep false
% 1.96/1.20 --abstr_ref_until_sat false
% 1.96/1.20 --abstr_ref_sig_restrict funpre
% 1.96/1.20 --abstr_ref_af_restrict_to_split_sk false
% 1.96/1.20 --abstr_ref_under []
% 1.96/1.20
% 1.96/1.20 ------ SAT Options
% 1.96/1.20
% 1.96/1.20 --sat_mode true
% 1.96/1.20 --sat_fm_restart_options ""
% 1.96/1.20 --sat_gr_def false
% 1.96/1.20 --sat_epr_types false
% 1.96/1.20 --sat_non_cyclic_types true
% 1.96/1.20 --sat_finite_models true
% 1.96/1.20 --sat_fm_lemmas false
% 1.96/1.20 --sat_fm_prep false
% 1.96/1.20 --sat_fm_uc_incr true
% 1.96/1.20 --sat_out_model pos
% 1.96/1.20 --sat_out_clauses false
% 1.96/1.20
% 1.96/1.20 ------ QBF Options
% 1.96/1.20
% 1.96/1.20 --qbf_mode false
% 1.96/1.20 --qbf_elim_univ false
% 1.96/1.20 --qbf_dom_inst none
% 1.96/1.20 --qbf_dom_pre_inst false
% 1.96/1.20 --qbf_sk_in false
% 1.96/1.20 --qbf_pred_elim true
% 1.96/1.20 --qbf_split 512
% 1.96/1.20
% 1.96/1.20 ------ BMC1 Options
% 1.96/1.20
% 1.96/1.20 --bmc1_incremental false
% 1.96/1.20 --bmc1_axioms reachable_all
% 1.96/1.20 --bmc1_min_bound 0
% 1.96/1.20 --bmc1_max_bound -1
% 1.96/1.20 --bmc1_max_bound_default -1
% 1.96/1.20 --bmc1_symbol_reachability false
% 1.96/1.20 --bmc1_property_lemmas false
% 1.96/1.20 --bmc1_k_induction false
% 1.96/1.20 --bmc1_non_equiv_states false
% 1.96/1.20 --bmc1_deadlock false
% 1.96/1.20 --bmc1_ucm false
% 1.96/1.20 --bmc1_add_unsat_core none
% 1.96/1.20 --bmc1_unsat_core_children false
% 1.96/1.20 --bmc1_unsat_core_extrapolate_axioms false
% 1.96/1.20 --bmc1_out_stat full
% 1.96/1.20 --bmc1_ground_init false
% 1.96/1.20 --bmc1_pre_inst_next_state false
% 1.96/1.20 --bmc1_pre_inst_state false
% 1.96/1.20 --bmc1_pre_inst_reach_state false
% 1.96/1.20 --bmc1_out_unsat_core false
% 1.96/1.20 --bmc1_aig_witness_out false
% 1.96/1.20 --bmc1_verbose false
% 1.96/1.20 --bmc1_dump_clauses_tptp false
% 1.96/1.20 --bmc1_dump_unsat_core_tptp false
% 1.96/1.20 --bmc1_dump_file -
% 1.96/1.20 --bmc1_ucm_expand_uc_limit 128
% 1.96/1.20 --bmc1_ucm_n_expand_iterations 6
% 1.96/1.20 --bmc1_ucm_extend_mode 1
% 1.96/1.20 --bmc1_ucm_init_mode 2
% 1.96/1.20 --bmc1_ucm_cone_mode none
% 1.96/1.20 --bmc1_ucm_reduced_relation_type 0
% 1.96/1.20 --bmc1_ucm_relax_model 4
% 1.96/1.20 --bmc1_ucm_full_tr_after_sat true
% 1.96/1.20 --bmc1_ucm_expand_neg_assumptions false
% 1.96/1.20 --bmc1_ucm_layered_model none
% 1.96/1.20 --bmc1_ucm_max_lemma_size 10
% 1.96/1.20
% 1.96/1.20 ------ AIG Options
% 1.96/1.20
% 1.96/1.20 --aig_mode false
% 1.96/1.20
% 1.96/1.20 ------ Instantiation Options
% 1.96/1.20
% 1.96/1.20 --instantiation_flag true
% 1.96/1.20 --inst_sos_flag false
% 1.96/1.20 --inst_sos_phase true
% 1.96/1.20 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 1.96/1.20 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 1.96/1.20 --inst_lit_sel_side num_lit
% 1.96/1.20 --inst_solver_per_active 1400
% 1.96/1.20 --inst_solver_calls_frac 0.01
% 1.96/1.20 --inst_to_smt_solver true
% 1.96/1.20 --inst_passive_queue_type priority_queues
% 1.96/1.20 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 1.96/1.20 --inst_passive_queues_freq [512;64]
% 1.96/1.20 --inst_dismatching true
% 1.96/1.20 --inst_eager_unprocessed_to_passive false
% 1.96/1.20 --inst_unprocessed_bound 1000
% 1.96/1.20 --inst_prop_sim_given true
% 1.96/1.20 --inst_prop_sim_new true
% 1.96/1.20 --inst_subs_new false
% 1.96/1.20 --inst_eq_res_simp false
% 1.96/1.20 --inst_subs_given true
% 1.96/1.20 --inst_orphan_elimination false
% 1.96/1.20 --inst_learning_loop_flag true
% 1.96/1.20 --inst_learning_start 5
% 1.96/1.20 --inst_learning_factor 8
% 1.96/1.20 --inst_start_prop_sim_after_learn 0
% 1.96/1.20 --inst_sel_renew solver
% 1.96/1.20 --inst_lit_activity_flag true
% 1.96/1.20 --inst_restr_to_given false
% 1.96/1.20 --inst_activity_threshold 10000
% 1.96/1.20
% 1.96/1.20 ------ Resolution Options
% 1.96/1.20
% 1.96/1.20 --resolution_flag false
% 1.96/1.20 --res_lit_sel neg_max
% 1.96/1.20 --res_lit_sel_side num_lit
% 1.96/1.20 --res_ordering kbo
% 1.96/1.20 --res_to_prop_solver passive
% 1.96/1.20 --res_prop_simpl_new true
% 1.96/1.20 --res_prop_simpl_given true
% 1.96/1.20 --res_to_smt_solver true
% 1.96/1.20 --res_passive_queue_type priority_queues
% 1.96/1.20 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 1.96/1.20 --res_passive_queues_freq [1024;32]
% 1.96/1.20 --res_forward_subs subset_subsumption
% 1.96/1.20 --res_backward_subs subset_subsumption
% 1.96/1.20 --res_forward_subs_resolution true
% 1.96/1.20 --res_backward_subs_resolution false
% 1.96/1.20 --res_orphan_elimination false
% 1.96/1.20 --res_time_limit 10.
% 1.96/1.20
% 1.96/1.20 ------ Superposition Options
% 1.96/1.20
% 1.96/1.20 --superposition_flag false
% 1.96/1.20 --sup_passive_queue_type priority_queues
% 1.96/1.20 --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]]
% 1.96/1.20 --sup_passive_queues_freq [8;1;4;4]
% 1.96/1.20 --demod_completeness_check fast
% 1.96/1.20 --demod_use_ground true
% 1.96/1.20 --sup_unprocessed_bound 0
% 1.96/1.20 --sup_to_prop_solver passive
% 1.96/1.20 --sup_prop_simpl_new true
% 1.96/1.20 --sup_prop_simpl_given true
% 1.96/1.20 --sup_fun_splitting false
% 1.96/1.20 --sup_iter_deepening 2
% 1.96/1.20 --sup_restarts_mult 12
% 1.96/1.20 --sup_score sim_d_gen
% 1.96/1.20 --sup_share_score_frac 0.2
% 1.96/1.20 --sup_share_max_num_cl 500
% 1.96/1.20 --sup_ordering kbo
% 1.96/1.20 --sup_symb_ordering invfreq
% 1.96/1.20 --sup_term_weight default
% 1.96/1.20
% 1.96/1.20 ------ Superposition Simplification Setup
% 1.96/1.20
% 1.96/1.20 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 1.96/1.20 --sup_full_triv [SMTSimplify;PropSubs]
% 1.96/1.20 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 1.96/1.20 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.96/1.20 --sup_immed_triv []
% 1.96/1.20 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 1.96/1.20 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 1.96/1.20 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 1.96/1.20 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.96/1.20 --sup_input_triv [Unflattening;SMTSimplify]
% 1.96/1.20 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.07/1.20 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.07/1.20 --sup_full_fixpoint true
% 2.07/1.20 --sup_main_fixpoint true
% 2.07/1.20 --sup_immed_fixpoint false
% 2.07/1.20 --sup_input_fixpoint true
% 2.07/1.20 --sup_cache_sim none
% 2.07/1.20 --sup_smt_interval 500
% 2.07/1.20 --sup_bw_gjoin_interval 0
% 2.07/1.20
% 2.07/1.20 ------ Combination Options
% 2.07/1.20
% 2.07/1.20 --comb_mode clause_based
% 2.07/1.20 --comb_inst_mult 1000
% 2.07/1.20 --comb_res_mult 10
% 2.07/1.20 --comb_sup_mult 8
% 2.07/1.20 --comb_sup_deep_mult 2
% 2.07/1.20
% 2.07/1.20 ------ Debug Options
% 2.07/1.20
% 2.07/1.20 --dbg_backtrace false
% 2.07/1.20 --dbg_dump_prop_clauses false
% 2.07/1.20 --dbg_dump_prop_clauses_file -
% 2.07/1.20 --dbg_out_stat false
% 2.07/1.20 --dbg_just_parse false
% 2.07/1.20
% 2.07/1.20
% 2.07/1.20
% 2.07/1.20
% 2.07/1.20 ------ Proving...
% 2.07/1.20
% 2.07/1.20
% 2.07/1.20 % SZS status Satisfiable for theBenchmark.p
% 2.07/1.20
% 2.07/1.20 ------ Building Model...Done
% 2.07/1.20
% 2.07/1.20 %------ The model is defined over ground terms (initial term algebra).
% 2.07/1.20 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.07/1.20 %------ where \phi is a formula over the term algebra.
% 2.07/1.20 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.07/1.20 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.07/1.20 %------ See help for --sat_out_model for different model outputs.
% 2.07/1.20 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.07/1.20 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.07/1.20 % SZS output start Model for theBenchmark.p
% See solution above
% 2.07/1.21
%------------------------------------------------------------------------------