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

View Problem - Process Solution

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

% Computer : n031.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:07:30 EDT 2023

% Result   : Satisfiable 0.48s 1.18s
% Output   : Model 3.53s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------ Positive definition of c0_1 
fof(lit_def_031,axiom,
    ! [X0] :
      ( c0_1(X0)
    <=> ( X0 = a1280
        | X0 = a1263 ) ) ).

%------ Negative definition of c2_1 
fof(lit_def_032,axiom,
    ! [X0] :
      ( ~ c2_1(X0)
    <=> ( X0 = a1300
        | X0 = a1277
        | X0 = a1268
        | X0 = a1262
        | X0 = a1261 ) ) ).

%------ Negative definition of c3_1 
fof(lit_def_033,axiom,
    ! [X0] :
      ( ~ c3_1(X0)
    <=> ( X0 = a1253
        | X0 = a1301
        | X0 = a1287
        | X0 = a1283
        | X0 = a1274
        | X0 = a1266
        | X0 = a1265
        | X0 = a1260
        | X0 = a1255
        | X0 = a1303 ) ) ).

%------ Negative definition of c1_1 
fof(lit_def_034,axiom,
    ! [X0] :
      ( ~ c1_1(X0)
    <=> ( X0 = a1280
        | X0 = a1253
        | X0 = a1301
        | X0 = a1287
        | X0 = a1283
        | X0 = a1274
        | X0 = a1266
        | X0 = a1265
        | X0 = a1263
        | X0 = a1260
        | X0 = a1257
        | X0 = a1255
        | X0 = a1303 ) ) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN463-1 : TPTP v8.1.2. Released v2.1.0.
% 0.00/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n031.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 19:16:53 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.18  % SZS status Started for theBenchmark.p
% 0.48/1.18  % SZS status Satisfiable for theBenchmark.p
% 0.48/1.18  
% 0.48/1.18  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.18  
% 0.48/1.18  ------  iProver source info
% 0.48/1.18  
% 0.48/1.18  git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.18  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.18  git: non_committed_changes: false
% 0.48/1.18  git: last_make_outside_of_git: false
% 0.48/1.18  
% 0.48/1.18  ------ Parsing...successful
% 0.48/1.18  
% 0.48/1.18  ------  preprocesses with Option_epr_non_horn_non_eq
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.48/1.18  
% 0.48/1.18  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_non_eq
% 0.48/1.18   gs_s  sp: 88 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.48/1.18  ------ Proving...
% 0.48/1.18  ------ Problem Properties 
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  clauses                                 179
% 0.48/1.18  conjectures                             179
% 0.48/1.18  EPR                                     179
% 0.48/1.18  Horn                                    103
% 0.48/1.18  unary                                   0
% 0.48/1.18  binary                                  90
% 0.48/1.18  lits                                    477
% 0.48/1.18  lits eq                                 0
% 0.48/1.18  fd_pure                                 0
% 0.48/1.18  fd_pseudo                               0
% 0.48/1.18  fd_cond                                 0
% 0.48/1.18  fd_pseudo_cond                          0
% 0.48/1.18  AC symbols                              0
% 0.48/1.18  
% 0.48/1.18  ------ Schedule EPR non Horn non eq is on
% 0.48/1.18  
% 0.48/1.18  ------ no equalities: superposition off 
% 0.48/1.18  
% 0.48/1.18  ------ Input Options "--resolution_flag false" Time Limit: 70.
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  ------ 
% 0.48/1.18  Current options:
% 0.48/1.18  ------ 
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  ------ Proving...
% 0.48/1.18  
% 0.48/1.18  
% 0.48/1.18  % SZS status Satisfiable for theBenchmark.p
% 0.48/1.18  
% 0.48/1.18  ------ Building Model...Done
% 0.48/1.18  
% 0.48/1.18  %------ The model is defined over ground terms (initial term algebra).
% 0.48/1.18  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 0.48/1.18  %------ where \phi is a formula over the term algebra.
% 0.48/1.18  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 0.48/1.18  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.48/1.18  %------ See help for --sat_out_model for different model outputs.
% 0.48/1.18  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.48/1.18  %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.48/1.18  % SZS output start Model for theBenchmark.p
% See solution above
% 3.53/1.19  
%------------------------------------------------------------------------------