TSTP Solution File: GRP654+3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP654+3 : TPTP v8.1.2. Released v4.0.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 : Thu Aug 31 01:01:08 EDT 2023

% Result   : CounterSatisfiable 196.13s 26.86s
% Output   : Saturation 196.13s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

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

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

fof(f6,conjecture,
    ! [X3,X4] :
      ( mult(ld(X4,X4),X3) = X3
      & mult(X3,ld(X4,X4)) = X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f7,negated_conjecture,
    ~ ! [X3,X4] :
        ( mult(ld(X4,X4),X3) = X3
        & mult(X3,ld(X4,X4)) = X3 ),
    inference(negated_conjecture,[],[f6]) ).

fof(f8,plain,
    ! [X0,X1,X2] : mult(X2,mult(X1,mult(X2,X0))) = mult(mult(mult(X2,X1),X2),X0),
    inference(rectify,[],[f5]) ).

fof(f9,plain,
    ~ ! [X0,X1] :
        ( mult(ld(X1,X1),X0) = X0
        & mult(X0,ld(X1,X1)) = X0 ),
    inference(rectify,[],[f7]) ).

fof(f10,plain,
    ? [X0,X1] :
      ( mult(ld(X1,X1),X0) != X0
      | mult(X0,ld(X1,X1)) != X0 ),
    inference(ennf_transformation,[],[f9]) ).

fof(f11,plain,
    ( ? [X0,X1] :
        ( mult(ld(X1,X1),X0) != X0
        | mult(X0,ld(X1,X1)) != X0 )
   => ( sK0 != mult(ld(sK1,sK1),sK0)
      | sK0 != mult(sK0,ld(sK1,sK1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ( sK0 != mult(ld(sK1,sK1),sK0)
    | sK0 != mult(sK0,ld(sK1,sK1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f11]) ).

fof(f13,plain,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    inference(cnf_transformation,[],[f1]) ).

fof(f14,plain,
    ! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
    inference(cnf_transformation,[],[f2]) ).

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

fof(f16,plain,
    ! [X0,X1] : rd(mult(X1,X0),X0) = X1,
    inference(cnf_transformation,[],[f4]) ).

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

fof(f18,plain,
    ( sK0 != mult(ld(sK1,sK1),sK0)
    | sK0 != mult(sK0,ld(sK1,sK1)) ),
    inference(cnf_transformation,[],[f12]) ).

cnf(c_49,plain,
    mult(X0,ld(X0,X1)) = X1,
    inference(cnf_transformation,[],[f13]) ).

cnf(c_50,plain,
    ld(X0,mult(X0,X1)) = X1,
    inference(cnf_transformation,[],[f14]) ).

cnf(c_51,plain,
    mult(rd(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f15]) ).

cnf(c_52,plain,
    rd(mult(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f16]) ).

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

cnf(c_54,negated_conjecture,
    ( mult(ld(sK1,sK1),sK0) != sK0
    | mult(sK0,ld(sK1,sK1)) != sK0 ),
    inference(cnf_transformation,[],[f18]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP654+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n021.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:35:14 EDT 2023
% 0.13/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
% 196.13/26.86  % SZS status Started for theBenchmark.p
% 196.13/26.86  % SZS status CounterSatisfiable for theBenchmark.p
% 196.13/26.86  
% 196.13/26.86  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 196.13/26.86  
% 196.13/26.86  ------  iProver source info
% 196.13/26.86  
% 196.13/26.86  git: date: 2023-05-31 18:12:56 +0000
% 196.13/26.86  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 196.13/26.86  git: non_committed_changes: false
% 196.13/26.86  git: last_make_outside_of_git: false
% 196.13/26.86  
% 196.13/26.86  ------ Parsing...
% 196.13/26.86  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 196.13/26.86  
% 196.13/26.86  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 196.13/26.86  
% 196.13/26.86  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 196.13/26.86  
% 196.13/26.86  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 196.13/26.86  ------ Proving...
% 196.13/26.86  ------ Problem Properties 
% 196.13/26.86  
% 196.13/26.86  
% 196.13/26.86  clauses                                 6
% 196.13/26.86  conjectures                             1
% 196.13/26.86  EPR                                     0
% 196.13/26.86  Horn                                    6
% 196.13/26.86  unary                                   5
% 196.13/26.86  binary                                  1
% 196.13/26.86  lits                                    7
% 196.13/26.86  lits eq                                 7
% 196.13/26.86  fd_pure                                 0
% 196.13/26.86  fd_pseudo                               0
% 196.13/26.86  fd_cond                                 0
% 196.13/26.86  fd_pseudo_cond                          0
% 196.13/26.86  AC symbols                              0
% 196.13/26.86  
% 196.13/26.86  ------ Input Options Time Limit: Unbounded
% 196.13/26.86  
% 196.13/26.86  
% 196.13/26.86  ------ 
% 196.13/26.86  Current options:
% 196.13/26.86  ------ 
% 196.13/26.86  
% 196.13/26.86  
% 196.13/26.86  
% 196.13/26.86  
% 196.13/26.86  ------ Proving...
% 196.13/26.86  
% 196.13/26.86  
% 196.13/26.86  % SZS status CounterSatisfiable for theBenchmark.p
% 196.13/26.86  
% 196.13/26.86  % SZS output start Saturation for theBenchmark.p
% See solution above
% 196.13/26.86  
% 196.13/26.86  
%------------------------------------------------------------------------------