↑ Up

iProver---3.9.4.SAT-Mod.s

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

% Computer : n011.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 01:31:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%------ Positive definition of group_element 
fof(lit_def,axiom,
    ! [X0] :
      ( group_element(X0)
    <=> ( X0 = e_5
        | X0 = e_4
        | X0 = e_3
        | X0 = e_2
        | X0 = e_1 ) ) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP124-7.005 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 13:39:12 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.40  Running EPR theorem proving
% 0.02/0.40  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.02/0.41  
% 0.02/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.41  
% 0.02/0.41  % Detected problem language: tptp
% 0.02/0.42  % Proving...
% 3.46/1.15  % SZS status Started for theBenchmark.p
% 3.46/1.15  % SZS status Satisfiable for theBenchmark.p
% 3.46/1.15  
% 3.46/1.15  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.46/1.15  
% 3.46/1.15  % ------  iProver source info
% 3.46/1.15  
% 3.46/1.15  % git: date: 2026-07-19 20:42:38 +0200
% 3.46/1.15  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.46/1.15  % git: non_committed_changes: false
% 3.46/1.15  
% 3.46/1.15  % ------ Parsing...% successful
% 3.46/1.15  
% 3.46/1.15  
% 3.46/1.15  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.46/1.15  % ------ Proving...
% 3.46/1.15  % ------ Problem Properties 
% 3.46/1.15  
% 3.46/1.15  % 
% 3.46/1.15  % clauses                               36
% 3.46/1.15  % conjectures                           1
% 3.46/1.15  % EPR                                   36
% 3.46/1.15  % Horn                                  34
% 3.46/1.15  % unary                                 27
% 3.46/1.15  % binary                                0
% 3.46/1.15  % lits                                  62
% 3.46/1.15  % lits eq                               0
% 3.46/1.15  % fd_pure                               0
% 3.46/1.15  % fd_pseudo                             0
% 3.46/1.15  % fd_cond                               0
% 3.46/1.15  % fd_pseudo_cond                        0
% 3.46/1.15  % AC symbols                            0
% 3.46/1.15  
% 3.46/1.15  % ------ Input Options Time Limit: Unbounded
% 3.46/1.15  
% 3.46/1.15  
% 3.46/1.15  % ------ 
% 3.46/1.15  % Current options:
% 3.46/1.15  % ------ 
% 3.46/1.15  
% 3.46/1.15  
% 3.46/1.15  % 
% 3.46/1.15  
% 3.46/1.15  % ------ Proving...
% 3.46/1.15  % 
% 3.46/1.15  
% 3.46/1.15  % SZS status Satisfiable for theBenchmark.p
% 3.46/1.15  
% 3.46/1.15  ------ Building Model...Done
% 3.46/1.15  
% 3.46/1.15  %------ The model is defined over ground terms (initial term algebra).
% 3.46/1.15  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 3.46/1.15  %------ where \phi is a formula over the term algebra.
% 3.46/1.15  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 3.46/1.15  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.46/1.15  %------ See help for --sat_out_model for different model outputs.
% 3.46/1.15  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.46/1.15  %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.46/1.15  % SZS output start Model for theBenchmark.p
% See solution above
% 4.56/1.16  
%------------------------------------------------------------------------------