TSTP Solution File: SYN518-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SYN518-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n011.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:08:09 EDT 2023

% Result   : Satisfiable 3.78s 1.16s
% Output   : Model 3.78s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
%------ Positive definition of ndr1_0 
fof(lit_def,axiom,
    ( ndr1_0
  <=> $true ) ).

%------ Positive definition of c4_0 
fof(lit_def_001,axiom,
    ( c4_0
  <=> $false ) ).

%------ Positive definition of c1_0 
fof(lit_def_002,axiom,
    ( c1_0
  <=> $true ) ).

%------ Positive definition of c5_0 
fof(lit_def_003,axiom,
    ( c5_0
  <=> $false ) ).

%------ Positive definition of c3_0 
fof(lit_def_004,axiom,
    ( c3_0
  <=> $false ) ).

%------ Positive definition of ssSkC27 
fof(lit_def_005,axiom,
    ( ssSkC27
  <=> $true ) ).

%------ Positive definition of ssSkC26 
fof(lit_def_006,axiom,
    ( ssSkC26
  <=> $false ) ).

%------ Positive definition of ssSkC25 
fof(lit_def_007,axiom,
    ( ssSkC25
  <=> $true ) ).

%------ Positive definition of ssSkC24 
fof(lit_def_008,axiom,
    ( ssSkC24
  <=> $true ) ).

%------ Positive definition of ssSkC20 
fof(lit_def_009,axiom,
    ( ssSkC20
  <=> $true ) ).

%------ Positive definition of ssSkC19 
fof(lit_def_010,axiom,
    ( ssSkC19
  <=> $true ) ).

%------ Positive definition of ssSkC14 
fof(lit_def_011,axiom,
    ( ssSkC14
  <=> $false ) ).

%------ Positive definition of ssSkC13 
fof(lit_def_012,axiom,
    ( ssSkC13
  <=> $true ) ).

%------ Positive definition of ssSkC12 
fof(lit_def_013,axiom,
    ( ssSkC12
  <=> $true ) ).

%------ Positive definition of ssSkC11 
fof(lit_def_014,axiom,
    ( ssSkC11
  <=> $true ) ).

%------ Positive definition of ssSkC10 
fof(lit_def_015,axiom,
    ( ssSkC10
  <=> $false ) ).

%------ Positive definition of ssSkC9 
fof(lit_def_016,axiom,
    ( ssSkC9
  <=> $false ) ).

%------ Positive definition of ssSkC8 
fof(lit_def_017,axiom,
    ( ssSkC8
  <=> $true ) ).

%------ Positive definition of ssSkC6 
fof(lit_def_018,axiom,
    ( ssSkC6
  <=> $true ) ).

%------ Positive definition of ssSkC5 
fof(lit_def_019,axiom,
    ( ssSkC5
  <=> $true ) ).

%------ Positive definition of ssSkC4 
fof(lit_def_020,axiom,
    ( ssSkC4
  <=> $true ) ).

%------ Positive definition of ssSkC3 
fof(lit_def_021,axiom,
    ( ssSkC3
  <=> $false ) ).

%------ Positive definition of ssSkC2 
fof(lit_def_022,axiom,
    ( ssSkC2
  <=> $true ) ).

%------ Positive definition of ssSkC1 
fof(lit_def_023,axiom,
    ( ssSkC1
  <=> $true ) ).

%------ Negative definition of ndr1_1 
fof(lit_def_024,axiom,
    ! [X0] :
      ( ~ ndr1_1(X0)
    <=> ( X0 = a1110
        | X0 = a1042 ) ) ).

%------ Positive definition of c3_1 
fof(lit_def_025,axiom,
    ! [X0] :
      ( c3_1(X0)
    <=> ( X0 = a1121
        | X0 = a1000
        | X0 = a1110
        | X0 = a1053
        | X0 = a1042
        | X0 = a1005
        | X0 = a1054
        | X0 = a1033
        | X0 = a1080 ) ) ).

%------ Negative definition of c1_1 
fof(lit_def_026,axiom,
    ! [X0] :
      ( ~ c1_1(X0)
    <=> ( X0 = a1121
        | X0 = a1000
        | X0 = a1110
        | X0 = a1083
        | X0 = a1042
        | X0 = a1129
        | X0 = a1084
        | X0 = a1075
        | X0 = a1149
        | X0 = a1079
        | X0 = a1063
        | X0 = a1051 ) ) ).

%------ Positive definition of c2_1 
fof(lit_def_027,axiom,
    ! [X0] :
      ( c2_1(X0)
    <=> ( X0 = a1113
        | X0 = a1110
        | X0 = a1083
        | X0 = a1031
        | X0 = a1112
        | X0 = a1054
        | X0 = a1046 ) ) ).

%------ Positive definition of c2_0 
fof(lit_def_028,axiom,
    ( c2_0
  <=> $false ) ).

%------ Positive definition of ssSkC16 
fof(lit_def_029,axiom,
    ( ssSkC16
  <=> $false ) ).

%------ Positive definition of ssSkC17 
fof(lit_def_030,axiom,
    ( ssSkC17
  <=> $true ) ).

%------ Positive definition of c5_1 
fof(lit_def_031,axiom,
    ! [X0] :
      ( c5_1(X0)
    <=> ( X0 = a1151
        | X0 = a1103
        | X0 = a1067
        | X0 = a1049
        | X0 = a1149 ) ) ).

%------ Positive definition of c4_1 
fof(lit_def_032,axiom,
    ! [X0] :
      ( c4_1(X0)
    <=> ( X0 = a1110
        | X0 = a1053
        | X0 = a1005
        | X0 = a1080 ) ) ).

%------ Positive definition of ssSkP6 
fof(lit_def_033,axiom,
    ! [X0] :
      ( ssSkP6(X0)
    <=> ( X0 = a1110
        | X0 = a1053
        | X0 = a1042 ) ) ).

%------ Negative definition of ssSkP5 
fof(lit_def_034,axiom,
    ! [X0] :
      ( ~ ssSkP5(X0)
    <=> X0 = a1149 ) ).

%------ Negative definition of ssSkP4 
fof(lit_def_035,axiom,
    ! [X0] :
      ( ~ ssSkP4(X0)
    <=> $false ) ).

%------ Negative definition of ssSkP3 
fof(lit_def_036,axiom,
    ! [X0] :
      ( ~ ssSkP3(X0)
    <=> X0 = a1075 ) ).

%------ Positive definition of ssSkP2 
fof(lit_def_037,axiom,
    ! [X0] :
      ( ssSkP2(X0)
    <=> $true ) ).

%------ Positive definition of ssSkP1 
fof(lit_def_038,axiom,
    ! [X0] :
      ( ssSkP1(X0)
    <=> $true ) ).

%------ Positive definition of ssSkP0 
fof(lit_def_039,axiom,
    ! [X0] :
      ( ssSkP0(X0)
    <=> $true ) ).

%------ Positive definition of c4_2 
fof(lit_def_040,axiom,
    ! [X0,X1] :
      ( c4_2(X0,X1)
    <=> ( ( X0 = a1141
          & X1 = a1143 )
        | ( X0 = a1110
          & X1 = a1108 )
        | ( X0 = a1053
          & X1 = a1120 )
        | ( X0 = a1097
          & X1 = a1108 )
        | ( X0 = a1075
          & X1 != a1127
          & X1 != a1107
          & X1 != a1090
          & X1 != a1076
          & X1 != a1128
          & X1 != a1006
          & X1 != a1137
          & X1 != a1034
          & X1 != a1091
          & X1 != a1093
          & X1 != a1038
          & X1 != a1130 )
        | ( X0 = a1075
          & X1 = a1128 )
        | ( X0 = a1075
          & X1 = a1006 )
        | ( X0 = a1075
          & X1 = a1093 )
        | ( X0 = a1075
          & X1 = a1038 )
        | ( X0 = a1054
          & X1 = a1056 )
        | ( X0 = a1054
          & X1 = a1108 )
        | ( X0 = a1149
          & X1 = a1150 ) ) ) ).

%------ Positive definition of c1_2 
fof(lit_def_041,axiom,
    ! [X0,X1] :
      ( c1_2(X0,X1)
    <=> ( ( X0 = a1141
          & X1 = a1143 )
        | ( X0 = a1141
          & X1 = a1142 )
        | ( X0 = a1000
          & X1 = a1127 )
        | ( X0 = a1110
          & X1 = a1127 )
        | ( X0 = a1110
          & X1 = a1111 )
        | ( X0 = a1083
          & X1 != a1092
          & X1 != a1090
          & X1 != a1003
          & X1 != a1101
          & X1 != a1130 )
        | ( X0 = a1083
          & X1 = a1092 )
        | ( X0 = a1083
          & X1 = a1137 )
        | ( X0 = a1042
          & X1 = a1045 )
        | ( X0 = a1023
          & X1 = a1024 )
        | ( X0 = a1103
          & X1 != a1092
          & X1 != a1090
          & X1 != a1003
          & X1 != a1101
          & X1 != a1130 )
        | ( X0 = a1103
          & X1 = a1003 )
        | ( X0 = a1103
          & X1 = a1130 )
        | ( X0 = a1097
          & X1 = a1098 )
        | ( X0 = a1097
          & X1 = a1108 )
        | ( X0 = a1084
          & X1 = a1085 )
        | ( X0 = a1075
          & X1 = a1127 )
        | ( X0 = a1075
          & X1 = a1107 )
        | ( X0 = a1075
          & X1 = a1137 )
        | ( X0 = a1075
          & X1 = a1034 )
        | ( X0 = a1075
          & X1 = a1091 )
        | ( X0 = a1054
          & X1 != a1092
          & X1 != a1090
          & X1 != a1003
          & X1 != a1056
          & X1 != a1101
          & X1 != a1130 )
        | ( X0 = a1054
          & X1 = a1056 )
        | ( X0 = a1054
          & X1 = a1091 )
        | ( X0 = a1010
          & X1 = a1127 )
        | ( X0 = a1149
          & X1 = a1127 )
        | ( X0 = a1149
          & X1 = a1107 )
        | ( X0 = a1149
          & X1 = a1150 )
        | ( X0 = a1149
          & X1 = a1034 )
        | ( X0 = a1051
          & X1 != a1092
          & X1 != a1090
          & X1 != a1003
          & X1 != a1101
          & X1 != a1130 )
        | ( X0 = a1051
          & X1 = a1052 )
        | ( X1 = a1127
          & X0 != a1000
          & X0 != a1110
          & X0 != a1053
          & X0 != a1075
          & X0 != a1010
          & X0 != a1149 ) ) ) ).

%------ Positive definition of ssSkC22 
fof(lit_def_042,axiom,
    ( ssSkC22
  <=> $false ) ).

%------ Positive definition of ssSkC21 
fof(lit_def_043,axiom,
    ( ssSkC21
  <=> $true ) ).

%------ Positive definition of c3_2 
fof(lit_def_044,axiom,
    ! [X0,X1] :
      ( c3_2(X0,X1)
    <=> ( ( X0 = a1000
          & X1 = a1001 )
        | ( X0 = a1057
          & X1 = a1058 )
        | ( X0 = a1023
          & X1 = a1024 )
        | ( X0 = a1103
          & X1 = a1092 )
        | ( X0 = a1103
          & X1 = a1090 )
        | ( X0 = a1103
          & X1 = a1101 )
        | ( X0 = a1097
          & X1 = a1098 )
        | ( X0 = a1084
          & X1 = a1086 )
        | ( X0 = a1084
          & X1 = a1085 )
        | ( X0 = a1067
          & X1 = a1068 )
        | ( X0 = a1054
          & X1 = a1130 )
        | ( X0 = a1149
          & X1 = a1150 )
        | ( X0 = a1104
          & X1 = a1105 )
        | ( X0 = a1051
          & X1 = a1130 ) ) ) ).

%------ Positive definition of c5_2 
fof(lit_def_045,axiom,
    ! [X0,X1] :
      ( c5_2(X0,X1)
    <=> ( ( X0 = a1110
          & X1 = a1111 )
        | ( X0 = a1083
          & X1 = a1090 )
        | ( X0 = a1083
          & X1 = a1003 )
        | ( X0 = a1083
          & X1 = a1101 )
        | ( X0 = a1083
          & X1 = a1130 )
        | ( X0 = a1042
          & X1 = a1043 )
        | ( X0 = a1103
          & X1 = a1003 )
        | ( X0 = a1097
          & X1 = a1098 )
        | ( X0 = a1075
          & X1 = a1090 )
        | ( X0 = a1075
          & X1 = a1076 )
        | ( X0 = a1075
          & X1 = a1130 )
        | ( X0 = a1054
          & X1 = a1091 )
        | ( X0 = a1051
          & X1 = a1052 ) ) ) ).

%------ Positive definition of c2_2 
fof(lit_def_046,axiom,
    ! [X0,X1] :
      ( c2_2(X0,X1)
    <=> ( ( X0 = a1000
          & X1 = a1127 )
        | ( X0 = a1147
          & X1 = a1148 )
        | ( X0 = a1072
          & X1 = a1073 )
        | ( X0 = a1075
          & X1 != a1127
          & X1 != a1107
          & X1 != a1076
          & X1 != a1137
          & X1 != a1034
          & X1 != a1091
          & X1 != a1038 )
        | ( X0 = a1075
          & X1 = a1090 )
        | ( X0 = a1075
          & X1 = a1038 )
        | ( X0 = a1067
          & X1 = a1068 )
        | ( X0 = a1010
          & X1 = a1012 )
        | ( X0 = a1010
          & X1 = a1011 )
        | ( X0 = a1149
          & X1 = a1090 )
        | ( X0 = a1051
          & X1 = a1092 ) ) ) ).

%------ Positive definition of ssSkC15 
fof(lit_def_047,axiom,
    ( ssSkC15
  <=> $true ) ).

%------ Positive definition of ssSkC7 
fof(lit_def_048,axiom,
    ( ssSkC7
  <=> $true ) ).

%------ Positive definition of ssSkC0 
fof(lit_def_049,axiom,
    ( ssSkC0
  <=> $true ) ).

%------ Positive definition of ssSkC23 
fof(lit_def_050,axiom,
    ( ssSkC23
  <=> $false ) ).

%------ Positive definition of ssSkC18 
fof(lit_def_051,axiom,
    ( ssSkC18
  <=> $false ) ).

%------ Positive definition of sP0_iProver_split 
fof(lit_def_052,axiom,
    ( sP0_iProver_split
  <=> $false ) ).

%------ Positive definition of sP1_iProver_split 
fof(lit_def_053,axiom,
    ( sP1_iProver_split
  <=> $true ) ).

%------ Positive definition of sP2_iProver_split 
fof(lit_def_054,axiom,
    ( sP2_iProver_split
  <=> $false ) ).

%------ Positive definition of sP3_iProver_split 
fof(lit_def_055,axiom,
    ( sP3_iProver_split
  <=> $true ) ).

%------ Positive definition of sP4_iProver_split 
fof(lit_def_056,axiom,
    ( sP4_iProver_split
  <=> $false ) ).

%------ Positive definition of sP5_iProver_split 
fof(lit_def_057,axiom,
    ( sP5_iProver_split
  <=> $false ) ).

%------ Positive definition of sP6_iProver_split 
fof(lit_def_058,axiom,
    ( sP6_iProver_split
  <=> $true ) ).

%------ Positive definition of sP7_iProver_split 
fof(lit_def_059,axiom,
    ( sP7_iProver_split
  <=> $false ) ).

%------ Positive definition of sP8_iProver_split 
fof(lit_def_060,axiom,
    ( sP8_iProver_split
  <=> $false ) ).

%------ Positive definition of sP9_iProver_split 
fof(lit_def_061,axiom,
    ( sP9_iProver_split
  <=> $true ) ).

%------ Positive definition of sP10_iProver_split 
fof(lit_def_062,axiom,
    ( sP10_iProver_split
  <=> $true ) ).

%------ Positive definition of sP11_iProver_split 
fof(lit_def_063,axiom,
    ( sP11_iProver_split
  <=> $true ) ).

%------ Positive definition of sP12_iProver_split 
fof(lit_def_064,axiom,
    ( sP12_iProver_split
  <=> $false ) ).

%------ Positive definition of sP13_iProver_split 
fof(lit_def_065,axiom,
    ( sP13_iProver_split
  <=> $true ) ).

%------ Positive definition of sP14_iProver_split 
fof(lit_def_066,axiom,
    ( sP14_iProver_split
  <=> $true ) ).

%------ Positive definition of sP15_iProver_split 
fof(lit_def_067,axiom,
    ( sP15_iProver_split
  <=> $false ) ).

%------ Positive definition of sP16_iProver_split 
fof(lit_def_068,axiom,
    ( sP16_iProver_split
  <=> $false ) ).

%------ Positive definition of sP17_iProver_split 
fof(lit_def_069,axiom,
    ( sP17_iProver_split
  <=> $true ) ).

%------ Positive definition of sP18_iProver_split 
fof(lit_def_070,axiom,
    ( sP18_iProver_split
  <=> $false ) ).

%------ Positive definition of sP19_iProver_split 
fof(lit_def_071,axiom,
    ( sP19_iProver_split
  <=> $true ) ).

%------ Positive definition of sP20_iProver_split 
fof(lit_def_072,axiom,
    ( sP20_iProver_split
  <=> $false ) ).

%------ Positive definition of sP21_iProver_split 
fof(lit_def_073,axiom,
    ( sP21_iProver_split
  <=> $true ) ).

%------ Positive definition of sP22_iProver_split 
fof(lit_def_074,axiom,
    ( sP22_iProver_split
  <=> $false ) ).

%------ Positive definition of sP23_iProver_split 
fof(lit_def_075,axiom,
    ( sP23_iProver_split
  <=> $true ) ).

%------ Positive definition of sP24_iProver_split 
fof(lit_def_076,axiom,
    ( sP24_iProver_split
  <=> $false ) ).

%------ Positive definition of sP25_iProver_split 
fof(lit_def_077,axiom,
    ( sP25_iProver_split
  <=> $true ) ).

%------ Positive definition of sP26_iProver_split 
fof(lit_def_078,axiom,
    ( sP26_iProver_split
  <=> $true ) ).

%------ Positive definition of sP27_iProver_split 
fof(lit_def_079,axiom,
    ( sP27_iProver_split
  <=> $true ) ).

%------ Positive definition of sP28_iProver_split 
fof(lit_def_080,axiom,
    ( sP28_iProver_split
  <=> $false ) ).

%------ Positive definition of sP29_iProver_split 
fof(lit_def_081,axiom,
    ( sP29_iProver_split
  <=> $false ) ).

%------ Positive definition of sP30_iProver_split 
fof(lit_def_082,axiom,
    ( sP30_iProver_split
  <=> $false ) ).

%------ Positive definition of sP31_iProver_split 
fof(lit_def_083,axiom,
    ( sP31_iProver_split
  <=> $true ) ).

%------ Positive definition of sP32_iProver_split 
fof(lit_def_084,axiom,
    ( sP32_iProver_split
  <=> $true ) ).

%------ Positive definition of sP33_iProver_split 
fof(lit_def_085,axiom,
    ( sP33_iProver_split
  <=> $true ) ).

%------ Positive definition of sP34_iProver_split 
fof(lit_def_086,axiom,
    ( sP34_iProver_split
  <=> $false ) ).

%------ Positive definition of sP35_iProver_split 
fof(lit_def_087,axiom,
    ( sP35_iProver_split
  <=> $true ) ).

%------ Positive definition of sP36_iProver_split 
fof(lit_def_088,axiom,
    ( sP36_iProver_split
  <=> $false ) ).

%------ Positive definition of sP37_iProver_split 
fof(lit_def_089,axiom,
    ( sP37_iProver_split
  <=> $false ) ).

%------ Positive definition of sP38_iProver_split 
fof(lit_def_090,axiom,
    ( sP38_iProver_split
  <=> $true ) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN518-1 : TPTP v8.1.2. Released v2.1.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n011.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 21:03:39 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.78/1.16  % SZS status Started for theBenchmark.p
% 3.78/1.16  % SZS status Satisfiable for theBenchmark.p
% 3.78/1.16  
% 3.78/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.78/1.16  
% 3.78/1.16  ------  iProver source info
% 3.78/1.16  
% 3.78/1.16  git: date: 2023-05-31 18:12:56 +0000
% 3.78/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.78/1.16  git: non_committed_changes: false
% 3.78/1.16  git: last_make_outside_of_git: false
% 3.78/1.16  
% 3.78/1.16  ------ Parsing...successful
% 3.78/1.16  
% 3.78/1.16  ------  preprocesses with Option_epr_non_horn_non_eq
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  ------ Preprocessing... sf_s  rm: 34 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.78/1.16  
% 3.78/1.16  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_non_eq
% 3.78/1.16   gs_s  sp: 45 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.78/1.16  ------ Proving...
% 3.78/1.16  ------ Problem Properties 
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  clauses                                 322
% 3.78/1.16  conjectures                             319
% 3.78/1.16  EPR                                     322
% 3.78/1.16  Horn                                    170
% 3.78/1.16  unary                                   38
% 3.78/1.16  binary                                  141
% 3.78/1.16  lits                                    1004
% 3.78/1.16  lits eq                                 0
% 3.78/1.16  fd_pure                                 0
% 3.78/1.16  fd_pseudo                               0
% 3.78/1.16  fd_cond                                 0
% 3.78/1.16  fd_pseudo_cond                          0
% 3.78/1.16  AC symbols                              0
% 3.78/1.16  
% 3.78/1.16  ------ Schedule EPR non Horn non eq is on
% 3.78/1.16  
% 3.78/1.16  ------ no equalities: superposition off 
% 3.78/1.16  
% 3.78/1.16  ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  ------ 
% 3.78/1.16  Current options:
% 3.78/1.16  ------ 
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  ------ Proving...
% 3.78/1.16  
% 3.78/1.16  
% 3.78/1.16  % SZS status Satisfiable for theBenchmark.p
% 3.78/1.16  
% 3.78/1.16  ------ Building Model...Done
% 3.78/1.16  
% 3.78/1.16  %------ The model is defined over ground terms (initial term algebra).
% 3.78/1.16  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 3.78/1.16  %------ where \phi is a formula over the term algebra.
% 3.78/1.16  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 3.78/1.16  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.78/1.16  %------ See help for --sat_out_model for different model outputs.
% 3.78/1.16  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.78/1.16  %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.78/1.16  % SZS output start Model for theBenchmark.p
% See solution above
% 3.78/1.16  
%------------------------------------------------------------------------------