TSTP Solution File: GRP012-1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n007.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:56:35 EDT 2023

% Result   : Unsatisfiable 0.45s 1.16s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  22 unt;   0 nHn;  13 RR)
%            Number of literals    :   30 (  19 equ;   9 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    product(a,b,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_multiply_b_is_c) ).

cnf(c_50,plain,
    product(inverse(b),inverse(a),d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_b_multiply_inverse_a_is_d) ).

cnf(c_51,negated_conjecture,
    ~ product(c,d,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_multiply_d_is_identity) ).

cnf(c_52,plain,
    product(identity,X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).

cnf(c_54,plain,
    product(inverse(X0),X0,identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_inverse) ).

cnf(c_55,plain,
    product(X0,inverse(X0),identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).

cnf(c_59,plain,
    ( ~ product(X0,X1,X2)
    | ~ product(X0,X3,X4)
    | ~ product(X1,X5,X3)
    | product(X2,X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity2) ).

cnf(c_65,plain,
    multiply(a,b) = c,
    inference(well_definedness,[status(thm)],[c_49]) ).

cnf(c_66,plain,
    multiply(inverse(b),inverse(a)) = d,
    inference(well_definedness,[status(thm)],[c_50]) ).

cnf(c_67,plain,
    multiply(c,d) != identity,
    inference(well_definedness,[status(thm)],[c_51]) ).

cnf(c_68,plain,
    multiply(identity,X0) = X0,
    inference(well_definedness,[status(thm)],[c_52]) ).

cnf(c_70,plain,
    multiply(inverse(X0),X0) = identity,
    inference(well_definedness,[status(thm)],[c_54]) ).

cnf(c_71,plain,
    multiply(X0,inverse(X0)) = identity,
    inference(well_definedness,[status(thm)],[c_55]) ).

cnf(c_77,plain,
    ( multiply(X0,X1) != X2
    | multiply(X0,X3) != X4
    | multiply(X1,X5) != X3
    | multiply(X2,X5) = X4 ),
    inference(well_definedness,[status(thm)],[c_59]) ).

cnf(c_123,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(unflattening,[status(thm)],[c_77]) ).

cnf(c_198,plain,
    multiply(a,multiply(b,X0)) = multiply(c,X0),
    inference(superposition,[status(thm)],[c_65,c_123]) ).

cnf(c_202,plain,
    multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
    inference(superposition,[status(thm)],[c_70,c_123]) ).

cnf(c_217,plain,
    multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(demodulation,[status(thm)],[c_202,c_68]) ).

cnf(c_220,plain,
    multiply(inverse(inverse(b)),d) = inverse(a),
    inference(superposition,[status(thm)],[c_66,c_217]) ).

cnf(c_229,plain,
    multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
    inference(superposition,[status(thm)],[c_217,c_217]) ).

cnf(c_238,plain,
    multiply(b,d) = inverse(a),
    inference(demodulation,[status(thm)],[c_220,c_229]) ).

cnf(c_241,plain,
    multiply(a,inverse(a)) = multiply(c,d),
    inference(superposition,[status(thm)],[c_238,c_198]) ).

cnf(c_242,plain,
    multiply(a,inverse(a)) != identity,
    inference(demodulation,[status(thm)],[c_67,c_241]) ).

cnf(c_243,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_242,c_71]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP012-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n007.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 00:24:58 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
% 0.45/1.16  % SZS status Started for theBenchmark.p
% 0.45/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.16  
% 0.45/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.16  
% 0.45/1.16  ------  iProver source info
% 0.45/1.16  
% 0.45/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.16  git: non_committed_changes: false
% 0.45/1.16  git: last_make_outside_of_git: false
% 0.45/1.16  
% 0.45/1.16  ------ Parsing...successful
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  ------ Preprocessing... sup_sim: 4  sf_s  rm: 0 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.45/1.16  
% 0.45/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.45/1.16  
% 0.45/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.45/1.16  ------ Proving...
% 0.45/1.16  ------ Problem Properties 
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  clauses                                 8
% 0.45/1.16  conjectures                             0
% 0.45/1.16  EPR                                     0
% 0.45/1.16  Horn                                    8
% 0.45/1.16  unary                                   8
% 0.45/1.16  binary                                  0
% 0.45/1.16  lits                                    8
% 0.45/1.16  lits eq                                 8
% 0.45/1.16  fd_pure                                 0
% 0.45/1.16  fd_pseudo                               0
% 0.45/1.16  fd_cond                                 0
% 0.45/1.16  fd_pseudo_cond                          0
% 0.45/1.16  AC symbols                              0
% 0.45/1.16  
% 0.45/1.16  ------ Schedule UEQ
% 0.45/1.16  
% 0.45/1.16  ------ Option_UEQ Time Limit: 10.
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  ------ 
% 0.45/1.16  Current options:
% 0.45/1.16  ------ 
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  ------ Proving...
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.16  
% 0.45/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.16  
% 0.45/1.16  
%------------------------------------------------------------------------------