↑ Up

iProver---3.9.4.SAT-Mod.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN434-1 : TPTP v9.3.1. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:40:11 PM UTC 2026

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------ Positive definition of c0_1 
fof(lit_def_046,axiom,
    ! [X0] :
      ( c0_1(X0)
    <=> ( X0 = a230
        | X0 = a238
        | X0 = a240
        | X0 = a255
        | X0 = a263
        | X0 = a264
        | X0 = a224
        | X0 = a235
        | X0 = a247
        | X0 = a250
        | X0 = a256
        | X0 = a257
        | X0 = a262
        | X0 = a266
        | X0 = a269
        | X0 = a279 ) ) ).

%------ Positive definition of c3_1 
fof(lit_def_047,axiom,
    ! [X0] :
      ( c3_1(X0)
    <=> ( X0 = a239
        | X0 = a268
        | X0 = a271
        | X0 = a226
        | X0 = a229
        | X0 = a230
        | X0 = a233
        | X0 = a238
        | X0 = a240
        | X0 = a249
        | X0 = a255
        | X0 = a263
        | X0 = a264
        | X0 = a277
        | X0 = a278
        | X0 = a224
        | X0 = a225
        | X0 = a231
        | X0 = a235
        | X0 = a237
        | X0 = a247
        | X0 = a250
        | X0 = a254
        | X0 = a256
        | X0 = a257
        | X0 = a260
        | X0 = a261
        | X0 = a262
        | X0 = a266
        | X0 = a269
        | X0 = a270
        | X0 = a272
        | X0 = a273
        | X0 = a279 ) ) ).

%------ Positive definition of c2_1 
fof(lit_def_048,axiom,
    ! [X0] :
      ( c2_1(X0)
    <=> ( X0 = a239
        | X0 = a268
        | X0 = a271
        | X0 = a226
        | X0 = a229
        | X0 = a230
        | X0 = a233
        | X0 = a238
        | X0 = a240
        | X0 = a249
        | X0 = a255
        | X0 = a263
        | X0 = a264
        | X0 = a277
        | X0 = a278
        | X0 = a224
        | X0 = a225
        | X0 = a231
        | X0 = a235
        | X0 = a237
        | X0 = a247
        | X0 = a250
        | X0 = a254
        | X0 = a256
        | X0 = a257
        | X0 = a260
        | X0 = a261
        | X0 = a262
        | X0 = a266
        | X0 = a269
        | X0 = a270
        | X0 = a272
        | X0 = a273
        | X0 = a279 ) ) ).

%------ Positive definition of c1_1 
fof(lit_def_049,axiom,
    ! [X0] :
      ( c1_1(X0)
    <=> ( X0 = a239
        | X0 = a268
        | X0 = a271
        | X0 = a226
        | X0 = a227
        | X0 = a228
        | X0 = a229
        | X0 = a230
        | X0 = a233
        | X0 = a234
        | X0 = a238
        | X0 = a240
        | X0 = a243
        | X0 = a245
        | X0 = a246
        | X0 = a249
        | X0 = a252
        | X0 = a253
        | X0 = a255
        | X0 = a263
        | X0 = a264
        | X0 = a277
        | X0 = a278
        | X0 = a281
        | X0 = a224
        | X0 = a231
        | X0 = a235
        | X0 = a236
        | X0 = a237
        | X0 = a242
        | X0 = a247
        | X0 = a248
        | X0 = a250
        | X0 = a254
        | X0 = a256
        | X0 = a257
        | X0 = a258
        | X0 = a260
        | X0 = a261
        | X0 = a262
        | X0 = a266
        | X0 = a269
        | X0 = a272
        | X0 = a273
        | X0 = a276
        | X0 = a279
        | ( X0 != a239
          & X0 != a268
          & X0 != a271
          & X0 != a226
          & X0 != a227
          & X0 != a228
          & X0 != a229
          & X0 != a230
          & X0 != a233
          & X0 != a234
          & X0 != a238
          & X0 != a243
          & X0 != a245
          & X0 != a246
          & X0 != a249
          & X0 != a252
          & X0 != a253
          & X0 != a255
          & X0 != a263
          & X0 != a264
          & X0 != a277
          & X0 != a278
          & X0 != a281
          & X0 != a224
          & X0 != a231
          & X0 != a235
          & X0 != a236
          & X0 != a237
          & X0 != a242
          & X0 != a247
          & X0 != a248
          & X0 != a250
          & X0 != a254
          & X0 != a257
          & X0 != a258
          & X0 != a260
          & X0 != a261
          & X0 != a262
          & X0 != a269
          & X0 != a270
          & X0 != a272
          & X0 != a276 ) ) ) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN434-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41  % Computer : n026.cluster.edu
% 0.11/0.41  % Model    : x86_64 x86_64
% 0.11/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41  % Memory   : 8046.5625MB
% 0.11/0.41  % OS       : Linux 6.8.0-71-generic
% 0.11/0.41  % CPULimit : 300
% 0.11/0.41  % WCLimit  : 300
% 0.11/0.41  % DateTime : Fri Sep 25 01:13:09 UTC 2026
% 0.11/0.41  % CPUTime  : 
% 0.11/0.41  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.47  Running EPR theorem proving
% 0.11/0.47  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.49  
% 0.23/0.49  % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.49  
% 0.23/0.49  % Detected problem language: tptp
% 0.23/0.51  % Proving...
% 5.72/1.83  % SZS status Started for theBenchmark.p
% 5.72/1.83  % SZS status Satisfiable for theBenchmark.p
% 5.72/1.83  
% 5.72/1.83  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.72/1.83  
% 5.72/1.83  % ------  iProver source info
% 5.72/1.83  
% 5.72/1.83  % git: date: 2026-07-19 20:42:38 +0200
% 5.72/1.83  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.72/1.83  % git: non_committed_changes: false
% 5.72/1.83  
% 5.72/1.83  % ------ Parsing...% successful
% 5.72/1.83  
% 5.72/1.83  
% 5.72/1.83  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 5.72/1.83  % 
% 5.72/1.83  
% 5.72/1.83  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 5.72/1.83  
% 5.72/1.83  % ------ Preprocessing...% ------  preprocesses with Option_epr_non_horn_non_eq
% 5.72/1.83   gs_s  sp: 59 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 5.72/1.83  % ------ Proving...
% 5.72/1.83  % ------ Problem Properties 
% 5.72/1.83  
% 5.72/1.83  % 
% 5.72/1.83  % clauses                               218
% 5.72/1.83  % conjectures                           194
% 5.72/1.83  % EPR                                   218
% 5.72/1.83  % Horn                                  149
% 5.72/1.83  % unary                                 0
% 5.72/1.83  % binary                                135
% 5.72/1.83  % lits                                  547
% 5.72/1.83  % lits eq                               0
% 5.72/1.83  % fd_pure                               0
% 5.72/1.83  % fd_pseudo                             0
% 5.72/1.83  % fd_cond                               0
% 5.72/1.83  % fd_pseudo_cond                        0
% 5.72/1.83  % AC symbols                            0
% 5.72/1.83  
% 5.72/1.83  % ------ Schedule EPR non Horn non eq is on
% 5.72/1.83  
% 5.72/1.83  % ------ no equalities: superposition off 
% 5.72/1.83  
% 5.72/1.83  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 5.72/1.83  
% 5.72/1.83  
% 5.72/1.83  % ------ 
% 5.72/1.83  % Current options:
% 5.72/1.83  % ------ 
% 5.72/1.83  
% 5.72/1.83  
% 5.72/1.83  % 
% 5.72/1.83  
% 5.72/1.83  % ------ Proving...
% 5.72/1.83  % 
% 5.72/1.83  
% 5.72/1.83  % SZS status Satisfiable for theBenchmark.p
% 5.72/1.83  
% 5.72/1.83  ------ Building Model...Done
% 5.72/1.83  
% 5.72/1.83  %------ The model is defined over ground terms (initial term algebra).
% 5.72/1.83  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 5.72/1.83  %------ where \phi is a formula over the term algebra.
% 5.72/1.83  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 5.72/1.83  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 5.72/1.83  %------ See help for --sat_out_model for different model outputs.
% 5.72/1.83  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 5.72/1.83  %------ where the first argument stands for the sort ($i in the unsorted case)
% 5.72/1.83  % SZS output start Model for theBenchmark.p
% See solution above
% 5.72/1.84  
%------------------------------------------------------------------------------