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

View Problem - Process Solution

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

% Computer : n004.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 01:01:44 EDT 2023

% Result   : Satisfiable 198.99s 26.88s
% Output   : Saturation 198.99s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : mult(X0,i(X0)) = e,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

fof(f2,axiom,
    ! [X0] : mult(X0,e) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

fof(f3,axiom,
    ! [X0,X1,X2] : mult(X0,mult(X1,X2)) = mult(mult(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).

fof(f4,axiom,
    ! [X0] : o(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( ( o(X0,X1)
        & X0 != X1 )
     => ~ o(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( ( o(X1,X2)
        & o(X0,X1) )
     => o(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).

fof(f7,axiom,
    ! [X0,X1,X2,X3] :
      ( ( o(X2,X3)
        & o(X0,X1) )
     => o(mult(X0,X2),mult(X1,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).

fof(f8,axiom,
    ( o(e,a)
    & e != a ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ~ o(X1,X0)
      | ~ o(X0,X1)
      | X0 = X1 ),
    inference(ennf_transformation,[],[f5]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ o(X1,X0)
      | ~ o(X0,X1)
      | X0 = X1 ),
    inference(flattening,[],[f9]) ).

fof(f11,plain,
    ! [X0,X1,X2] :
      ( o(X0,X2)
      | ~ o(X1,X2)
      | ~ o(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( o(X0,X2)
      | ~ o(X1,X2)
      | ~ o(X0,X1) ),
    inference(flattening,[],[f11]) ).

fof(f13,plain,
    ! [X0,X1,X2,X3] :
      ( o(mult(X0,X2),mult(X1,X3))
      | ~ o(X2,X3)
      | ~ o(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f14,plain,
    ! [X0,X1,X2,X3] :
      ( o(mult(X0,X2),mult(X1,X3))
      | ~ o(X2,X3)
      | ~ o(X0,X1) ),
    inference(flattening,[],[f13]) ).

fof(f15,plain,
    ! [X0] : mult(X0,i(X0)) = e,
    inference(cnf_transformation,[],[f1]) ).

fof(f16,plain,
    ! [X0] : mult(X0,e) = X0,
    inference(cnf_transformation,[],[f2]) ).

fof(f17,plain,
    ! [X2,X0,X1] : mult(X0,mult(X1,X2)) = mult(mult(X0,X1),X2),
    inference(cnf_transformation,[],[f3]) ).

fof(f18,plain,
    ! [X0] : o(X0,X0),
    inference(cnf_transformation,[],[f4]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ o(X1,X0)
      | ~ o(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f10]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( o(X0,X2)
      | ~ o(X1,X2)
      | ~ o(X0,X1) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f21,plain,
    ! [X2,X3,X0,X1] :
      ( o(mult(X0,X2),mult(X1,X3))
      | ~ o(X2,X3)
      | ~ o(X0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f22,plain,
    e != a,
    inference(cnf_transformation,[],[f8]) ).

fof(f23,plain,
    o(e,a),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_49,plain,
    mult(X0,i(X0)) = e,
    inference(cnf_transformation,[],[f15]) ).

cnf(c_50,plain,
    mult(X0,e) = X0,
    inference(cnf_transformation,[],[f16]) ).

cnf(c_51,plain,
    mult(mult(X0,X1),X2) = mult(X0,mult(X1,X2)),
    inference(cnf_transformation,[],[f17]) ).

cnf(c_52,plain,
    o(X0,X0),
    inference(cnf_transformation,[],[f18]) ).

cnf(c_53,plain,
    ( ~ o(X0,X1)
    | ~ o(X1,X0)
    | X0 = X1 ),
    inference(cnf_transformation,[],[f19]) ).

cnf(c_54,plain,
    ( ~ o(X0,X1)
    | ~ o(X1,X2)
    | o(X0,X2) ),
    inference(cnf_transformation,[],[f20]) ).

cnf(c_55,plain,
    ( ~ o(X0,X1)
    | ~ o(X2,X3)
    | o(mult(X0,X2),mult(X1,X3)) ),
    inference(cnf_transformation,[],[f21]) ).

cnf(c_56,plain,
    o(e,a),
    inference(cnf_transformation,[],[f23]) ).

cnf(c_57,plain,
    e != a,
    inference(cnf_transformation,[],[f22]) ).

cnf(c_95,plain,
    X0_1 = X0_1,
    theory(equality) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP761+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 01:33:07 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 198.99/26.88  % SZS status Started for theBenchmark.p
% 198.99/26.88  % SZS status Satisfiable for theBenchmark.p
% 198.99/26.88  
% 198.99/26.88  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 198.99/26.88  
% 198.99/26.88  ------  iProver source info
% 198.99/26.88  
% 198.99/26.88  git: date: 2023-05-31 18:12:56 +0000
% 198.99/26.88  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 198.99/26.88  git: non_committed_changes: false
% 198.99/26.88  git: last_make_outside_of_git: false
% 198.99/26.88  
% 198.99/26.88  ------ Parsing...
% 198.99/26.88  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 198.99/26.88  
% 198.99/26.88  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 198.99/26.88  
% 198.99/26.88  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 198.99/26.88  
% 198.99/26.88  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 198.99/26.88  ------ Proving...
% 198.99/26.88  ------ Problem Properties 
% 198.99/26.88  
% 198.99/26.88  
% 198.99/26.88  clauses                                 9
% 198.99/26.88  conjectures                             0
% 198.99/26.88  EPR                                     5
% 198.99/26.88  Horn                                    9
% 198.99/26.88  unary                                   6
% 198.99/26.88  binary                                  0
% 198.99/26.88  lits                                    15
% 198.99/26.88  lits eq                                 5
% 198.99/26.88  fd_pure                                 0
% 198.99/26.88  fd_pseudo                               0
% 198.99/26.88  fd_cond                                 0
% 198.99/26.88  fd_pseudo_cond                          1
% 198.99/26.88  AC symbols                              0
% 198.99/26.88  
% 198.99/26.88  ------ Input Options Time Limit: Unbounded
% 198.99/26.88  
% 198.99/26.88  
% 198.99/26.88  ------ 
% 198.99/26.88  Current options:
% 198.99/26.88  ------ 
% 198.99/26.88  
% 198.99/26.88  
% 198.99/26.88  
% 198.99/26.88  
% 198.99/26.88  ------ Proving...
% 198.99/26.88  
% 198.99/26.88  
% 198.99/26.88  % SZS status Satisfiable for theBenchmark.p
% 198.99/26.88  
% 198.99/26.88  % SZS output start Saturation for theBenchmark.p
% See solution above
% 198.99/26.88  
% 198.99/26.88  
%------------------------------------------------------------------------------