TSTP Solution File: SYN539+1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n021.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:22 EDT 2023

% Result   : CounterSatisfiable 0.48s 1.19s
% Output   : Model 0.48s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
%------ Positive definition of c1_1 
fof(lit_def,axiom,
    ! [X0] :
      ( c1_1(X0)
    <=> ( X0 = a631
        | X0 = a619
        | X0 = a616 ) ) ).

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

%------ Positive definition of c3_2 
fof(lit_def_002,axiom,
    ! [X0,X1] :
      ( c3_2(X0,X1)
    <=> ( ( X0 = a624
          & X1 != a626
          & X1 != a600
          & X1 != a599 )
        | ( X0 = a624
          & X1 = a625 )
        | ( X0 = a596
          & X1 = a621 )
        | ( X0 = a588
          & X1 = a589 ) ) ) ).

%------ Positive definition of c1_2 
fof(lit_def_003,axiom,
    ! [X0,X1] :
      ( c1_2(X0,X1)
    <=> ( ( X0 = a596
          & X1 = a598 )
        | ( X0 = a588
          & X1 = a590 )
        | ( X0 = a637
          & X1 = a638 )
        | X1 = a621 ) ) ).

%------ Negative definition of ndr1_1 
fof(lit_def_004,axiom,
    ! [X0] :
      ( ~ ndr1_1(X0)
    <=> ( X0 = a633
        | X0 = a592
        | X0 = a605 ) ) ).

%------ Positive definition of c3_1 
fof(lit_def_005,axiom,
    ! [X0] :
      ( c3_1(X0)
    <=> X0 = a587 ) ).

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

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

%------ Negative definition of c2_1 
fof(lit_def_008,axiom,
    ! [X0] :
      ( ~ c2_1(X0)
    <=> ( X0 = a633
        | X0 = a592
        | X0 = a637
        | X0 = a634
        | X0 = a616
        | X0 = a605 ) ) ).

%------ Positive definition of c5_2 
fof(lit_def_009,axiom,
    ! [X0,X1] :
      ( c5_2(X0,X1)
    <=> ( ( X0 = a624
          & X1 = a626 )
        | ( X0 = a608
          & X1 = a609 )
        | ( X0 = a596
          & X1 = a597 )
        | ( X0 = a588
          & X1 = a591 ) ) ) ).

%------ Positive definition of c2_2 
fof(lit_def_010,axiom,
    ! [X0,X1] :
      ( c2_2(X0,X1)
    <=> ( ( X0 = a596
          & X1 = a598 )
        | ( X0 = a588
          & X1 = a590 )
        | ( X0 = a588
          & X1 = a589 ) ) ) ).

%------ Positive definition of c4_2 
fof(lit_def_011,axiom,
    ! [X0,X1] :
      ( c4_2(X0,X1)
    <=> ( ( X0 = a624
          & X1 = a626 )
        | ( X0 = a596
          & X1 = a621 )
        | ( X0 = a588
          & X1 = a589 )
        | ( X1 = a621
          & X0 != a596 ) ) ) ).

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

%------ Negative definition of sP9 
fof(lit_def_013,axiom,
    ! [X0] :
      ( ~ sP9(X0)
    <=> ( X0 = a633
        | X0 = a592
        | X0 = a605 ) ) ).

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

%------ Positive definition of sP7 
fof(lit_def_015,axiom,
    ! [X0] :
      ( sP7(X0)
    <=> $false ) ).

%------ Positive definition of sP6 
fof(lit_def_016,axiom,
    ! [X0] :
      ( sP6(X0)
    <=> $false ) ).

%------ Positive definition of sP4 
fof(lit_def_017,axiom,
    ! [X0] :
      ( sP4(X0)
    <=> $false ) ).

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

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

%------ Positive definition of c5_1 
fof(lit_def_020,axiom,
    ! [X0] :
      ( c5_1(X0)
    <=> ( X0 = a619
        | X0 = a587 ) ) ).

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

%------ Positive definition of c4_1 
fof(lit_def_022,axiom,
    ! [X0] :
      ( c4_1(X0)
    <=> X0 = a619 ) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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