TSTP Solution File: GRP700+1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n026.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 May  3 02:23:29 EDT 2024

% Result   : Theorem 7.73s 1.68s
% Output   : CNFRefutation 7.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  37 unt;   0 def)
%            Number of atoms       :   57 (  56 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   28 (  17   ~;   7   |;   3   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   76 (   0 sgn  39   !;   5   ?)

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

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

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

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

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

fof(f6,axiom,
    ! [X1] : mult(unit,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).

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

fof(f9,conjecture,
    ! [X3] :
    ? [X4] :
      ( unit = mult(X3,X4)
      & unit = mult(X4,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f10,negated_conjecture,
    ~ ! [X3] :
      ? [X4] :
        ( unit = mult(X3,X4)
        & unit = mult(X4,X3) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f11,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(rectify,[],[f5]) ).

fof(f12,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(rectify,[],[f6]) ).

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

fof(f15,plain,
    ~ ! [X0] :
      ? [X1] :
        ( unit = mult(X0,X1)
        & mult(X1,X0) = unit ),
    inference(rectify,[],[f10]) ).

fof(f16,plain,
    ? [X0] :
    ! [X1] :
      ( unit != mult(X0,X1)
      | mult(X1,X0) != unit ),
    inference(ennf_transformation,[],[f15]) ).

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

fof(f18,plain,
    ! [X1] :
      ( unit != mult(sK0,X1)
      | unit != mult(X1,sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f16,f17]) ).

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

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

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

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

fof(f23,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f11]) ).

fof(f24,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f12]) ).

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

fof(f27,plain,
    ! [X1] :
      ( unit != mult(sK0,X1)
      | unit != mult(X1,sK0) ),
    inference(cnf_transformation,[],[f18]) ).

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

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

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

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

cnf(c_53,plain,
    mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f23]) ).

cnf(c_54,plain,
    mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f24]) ).

cnf(c_55,plain,
    mult(mult(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(mult(mult(X1,X0),X0),X2)),
    inference(cnf_transformation,[],[f25]) ).

cnf(c_57,negated_conjecture,
    ( mult(X0,sK0) != unit
    | mult(sK0,X0) != unit ),
    inference(cnf_transformation,[],[f27]) ).

cnf(c_93,negated_conjecture,
    ( mult(X0,sK0) != unit
    | mult(sK0,X0) != unit ),
    inference(demodulation,[status(thm)],[c_57]) ).

cnf(c_161,plain,
    ld(rd(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c_51,c_50]) ).

cnf(c_171,plain,
    rd(X0,X0) = unit,
    inference(superposition,[status(thm)],[c_54,c_52]) ).

cnf(c_175,plain,
    mult(X0,mult(mult(mult(ld(X0,X1),X0),X0),X2)) = mult(mult(X1,X0),mult(X0,X2)),
    inference(superposition,[status(thm)],[c_49,c_55]) ).

cnf(c_595,plain,
    mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),mult(X0,unit)),
    inference(superposition,[status(thm)],[c_53,c_175]) ).

cnf(c_625,plain,
    mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),X0),
    inference(light_normalisation,[status(thm)],[c_595,c_53]) ).

cnf(c_1599,plain,
    rd(mult(mult(X0,X1),X1),mult(mult(ld(X1,X0),X1),X1)) = X1,
    inference(superposition,[status(thm)],[c_625,c_52]) ).

cnf(c_4439,plain,
    rd(mult(X0,X0),mult(mult(ld(X0,unit),X0),X0)) = X0,
    inference(superposition,[status(thm)],[c_54,c_1599]) ).

cnf(c_4607,plain,
    mult(mult(ld(X0,unit),X0),X0) = ld(X0,mult(X0,X0)),
    inference(superposition,[status(thm)],[c_4439,c_161]) ).

cnf(c_5218,plain,
    mult(mult(ld(X0,unit),X0),X0) = X0,
    inference(demodulation,[status(thm)],[c_4607,c_50]) ).

cnf(c_5233,plain,
    mult(ld(X0,unit),X0) = rd(X0,X0),
    inference(superposition,[status(thm)],[c_5218,c_52]) ).

cnf(c_5286,plain,
    mult(ld(X0,unit),X0) = unit,
    inference(light_normalisation,[status(thm)],[c_5233,c_171]) ).

cnf(c_6058,plain,
    mult(sK0,ld(sK0,unit)) != unit,
    inference(superposition,[status(thm)],[c_5286,c_93]) ).

cnf(c_6079,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_6058,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : GRP700+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n026.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Fri May  3 00:16:36 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.73/1.68  % SZS status Started for theBenchmark.p
% 7.73/1.68  % SZS status Theorem for theBenchmark.p
% 7.73/1.68  
% 7.73/1.68  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.73/1.68  
% 7.73/1.68  ------  iProver source info
% 7.73/1.68  
% 7.73/1.68  git: date: 2024-05-02 19:28:25 +0000
% 7.73/1.68  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.73/1.68  git: non_committed_changes: false
% 7.73/1.68  
% 7.73/1.68  ------ Parsing...
% 7.73/1.68  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.73/1.68  
% 7.73/1.68  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 7.73/1.68  
% 7.73/1.68  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.73/1.68  
% 7.73/1.68  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 7.73/1.68  ------ Proving...
% 7.73/1.68  ------ Problem Properties 
% 7.73/1.68  
% 7.73/1.68  
% 7.73/1.68  clauses                                 9
% 7.73/1.68  conjectures                             1
% 7.73/1.68  EPR                                     0
% 7.73/1.68  Horn                                    9
% 7.73/1.68  unary                                   8
% 7.73/1.68  binary                                  1
% 7.73/1.68  lits                                    10
% 7.73/1.68  lits eq                                 10
% 7.73/1.68  fd_pure                                 0
% 7.73/1.68  fd_pseudo                               0
% 7.73/1.68  fd_cond                                 0
% 7.73/1.68  fd_pseudo_cond                          0
% 7.73/1.68  AC symbols                              0
% 7.73/1.68  
% 7.73/1.68  ------ Schedule dynamic 5 is on 
% 7.73/1.68  
% 7.73/1.68  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.73/1.68  
% 7.73/1.68  
% 7.73/1.68  ------ 
% 7.73/1.68  Current options:
% 7.73/1.68  ------ 
% 7.73/1.68  
% 7.73/1.68  
% 7.73/1.68  
% 7.73/1.68  
% 7.73/1.68  ------ Proving...
% 7.73/1.68  
% 7.73/1.68  
% 7.73/1.68  % SZS status Theorem for theBenchmark.p
% 7.73/1.68  
% 7.73/1.68  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.73/1.68  
% 7.73/1.68  
%------------------------------------------------------------------------------