TSTP Solution File: GRP130-4.004 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP130-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.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 : Thu Aug 31 00:58:08 EDT 2023

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

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

%------ Positive definition of product 
fof(lit_def_001,axiom,
    ! [X0,X1,X2] :
      ( product(X0,X1,X2)
    <=> ( ( ( X0 != e_1
            | X2 != e_4 )
          & X0 != e_2
          & ( X0 != e_2
            | X1 != e_2 )
          & ( X0 != e_2
            | X1 != e_2
            | X2 != e_3 )
          & ( X0 != e_2
            | X1 != e_2
            | X2 != e_4 )
          & ( X0 != e_2
            | X1 != e_3 )
          & ( X0 != e_2
            | X1 != e_3
            | X2 != e_2 )
          & ( X0 != e_2
            | X1 != e_3
            | X2 != e_3 )
          & ( X0 != e_2
            | X2 != e_2 )
          & ( X0 != e_2
            | X2 != e_3 )
          & ( X0 != e_2
            | X2 != e_4 )
          & X0 != e_3
          & ( X0 != e_3
            | X1 != e_2 )
          & ( X0 != e_3
            | X1 != e_2
            | X2 != e_4 )
          & ( X0 != e_3
            | X1 != e_3 )
          & ( X0 != e_3
            | X1 != e_3
            | X2 != e_2 )
          & ( X0 != e_3
            | X1 != e_3
            | X2 != e_4 )
          & ( X0 != e_3
            | X1 != e_4 )
          & ( X0 != e_3
            | X2 != e_2 )
          & ( X0 != e_3
            | X2 != e_3 )
          & X0 != e_4
          & ( X0 != e_4
            | X1 != e_1 )
          & ( X0 != e_4
            | X1 != e_2 )
          & ( X0 != e_4
            | X1 != e_4 )
          & ( X0 != e_4
            | X2 != e_1 )
          & ( X0 != e_4
            | X2 != e_2 )
          & ( X0 != e_4
            | X2 != e_3 )
          & X1 != e_2
          & ( X1 != e_2
            | X2 != e_2 )
          & ( X1 != e_2
            | X2 != e_3 )
          & ( X1 != e_2
            | X2 != e_4 )
          & X1 != e_3
          & ( X1 != e_3
            | X2 != e_2 )
          & ( X1 != e_3
            | X2 != e_4 )
          & X1 != e_4
          & ( X1 != e_4
            | X2 != e_2 )
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X0 = e_1
          & X1 != e_1
          & ( X1 != e_1
            | X2 != e_2 )
          & ( X1 != e_1
            | X2 != e_3 )
          & ( X1 != e_1
            | X2 != e_4 )
          & X1 != e_2
          & ( X1 != e_2
            | X2 != e_1 )
          & ( X1 != e_2
            | X2 != e_2 )
          & ( X1 != e_2
            | X2 != e_3 )
          & ( X1 != e_2
            | X2 != e_4 )
          & X1 != e_3
          & ( X1 != e_3
            | X2 != e_1 )
          & ( X1 != e_3
            | X2 != e_2 )
          & ( X1 != e_3
            | X2 != e_3 )
          & ( X1 != e_3
            | X2 != e_4 )
          & X1 != e_4
          & ( X1 != e_4
            | X2 != e_1 )
          & ( X1 != e_4
            | X2 != e_2 )
          & ( X1 != e_4
            | X2 != e_4 )
          & X2 != e_1
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X0 = e_1
          & X1 = e_1
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X0 = e_1
          & X1 = e_2
          & X2 = e_4 )
        | ( X0 = e_1
          & X1 = e_3
          & X2 = e_2 )
        | ( X0 = e_1
          & X1 = e_4
          & X2 = e_3 )
        | ( X0 = e_1
          & X2 = e_1
          & X1 != e_2
          & X1 != e_3
          & X1 != e_4 )
        | ( X0 = e_2
          & X1 = e_1
          & X2 = e_3 )
        | ( X0 = e_2
          & X1 = e_2
          & X2 = e_2 )
        | ( X0 = e_2
          & X1 = e_3
          & X2 = e_4 )
        | ( X0 = e_2
          & X1 = e_4
          & X2 != e_1
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X0 = e_2
          & X1 = e_4
          & X2 = e_1 )
        | ( X0 = e_2
          & X2 = e_3
          & X1 != e_1
          & X1 != e_2
          & X1 != e_3
          & X1 != e_4 )
        | ( X0 = e_3
          & X1 = e_1
          & X2 = e_4 )
        | ( X0 = e_3
          & X1 = e_2
          & X2 != e_1
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X0 = e_3
          & X1 = e_2
          & X2 = e_1 )
        | ( X0 = e_3
          & X1 = e_3
          & X2 = e_3 )
        | ( X0 = e_3
          & X1 = e_4
          & X2 = e_2 )
        | ( X0 = e_3
          & X2 = e_4
          & X1 != e_1
          & X1 != e_2
          & X1 != e_3
          & X1 != e_4 )
        | ( X0 = e_4
          & X1 = e_1
          & X2 = e_2 )
        | ( X0 = e_4
          & X1 = e_2
          & X2 = e_3 )
        | ( X0 = e_4
          & X1 = e_3
          & X2 != e_1
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X0 = e_4
          & X1 = e_3
          & X2 = e_1 )
        | ( X0 = e_4
          & X1 = e_4
          & X2 = e_4 )
        | ( X0 = e_4
          & X2 = e_2
          & X1 != e_1
          & X1 != e_2
          & X1 != e_3
          & X1 != e_4 )
        | ( X1 = e_1
          & X0 != e_1
          & ( X0 != e_1
            | X2 != e_2 )
          & ( X0 != e_1
            | X2 != e_3 )
          & ( X0 != e_1
            | X2 != e_4 )
          & X0 != e_2
          & ( X0 != e_2
            | X2 != e_1 )
          & ( X0 != e_2
            | X2 != e_2 )
          & ( X0 != e_2
            | X2 != e_3 )
          & ( X0 != e_2
            | X2 != e_4 )
          & X0 != e_3
          & ( X0 != e_3
            | X2 != e_1 )
          & ( X0 != e_3
            | X2 != e_2 )
          & ( X0 != e_3
            | X2 != e_3 )
          & X0 != e_4
          & ( X0 != e_4
            | X2 != e_1 )
          & ( X0 != e_4
            | X2 != e_2 )
          & ( X0 != e_4
            | X2 != e_3 )
          & ( X0 != e_4
            | X2 != e_4 )
          & X2 != e_1
          & X2 != e_2
          & X2 != e_3
          & X2 != e_4 )
        | ( X1 = e_1
          & X2 = e_1
          & X0 != e_2
          & X0 != e_3
          & X0 != e_4 )
        | ( X1 = e_2
          & X2 = e_4
          & X0 != e_1
          & X0 != e_2
          & X0 != e_3
          & X0 != e_4 )
        | ( X1 = e_3
          & X2 = e_2
          & X0 != e_1
          & X0 != e_2
          & X0 != e_3
          & X0 != e_4 )
        | ( X1 = e_4
          & X2 = e_3
          & X0 != e_1
          & X0 != e_2
          & X0 != e_3
          & X0 != e_4 )
        | ( X2 = e_1
          & X0 != e_1
          & ( X0 != e_1
            | X1 != e_2 )
          & ( X0 != e_1
            | X1 != e_3 )
          & ( X0 != e_1
            | X1 != e_4 )
          & X0 != e_2
          & ( X0 != e_2
            | X1 != e_1 )
          & ( X0 != e_2
            | X1 != e_2 )
          & ( X0 != e_2
            | X1 != e_3 )
          & X0 != e_3
          & ( X0 != e_3
            | X1 != e_1 )
          & ( X0 != e_3
            | X1 != e_2 )
          & ( X0 != e_3
            | X1 != e_3 )
          & ( X0 != e_3
            | X1 != e_4 )
          & X0 != e_4
          & ( X0 != e_4
            | X1 != e_1 )
          & ( X0 != e_4
            | X1 != e_2 )
          & ( X0 != e_4
            | X1 != e_3 )
          & ( X0 != e_4
            | X1 != e_4 )
          & X1 != e_1
          & X1 != e_2
          & X1 != e_3
          & X1 != e_4 ) ) ) ).

%------ Negative definition of equalish 
fof(lit_def_002,axiom,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
    <=> ( ( X0 = e_1
          & X1 = e_2 )
        | ( X0 = e_1
          & X1 = e_3 )
        | ( X0 = e_1
          & X1 = e_4 )
        | ( X0 = e_2
          & X1 = e_1 )
        | ( X0 = e_2
          & X1 = e_3 )
        | ( X0 = e_2
          & X1 = e_4 )
        | ( X0 = e_3
          & X1 = e_1 )
        | ( X0 = e_3
          & X1 = e_2 )
        | ( X0 = e_3
          & X1 = e_4 )
        | ( X0 = e_4
          & X1 = e_1 )
        | ( X0 = e_4
          & X1 = e_2 )
        | ( X0 = e_4
          & X1 = e_3 ) ) ) ).

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