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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP601-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n009.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:00:40 EDT 2023

% Result   : Unsatisfiable 3.81s 1.13s
% Output   : CNFRefutation 3.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   49 (  49 unt;   0 nHn;   9 RR)
%            Number of literals    :   49 (  48 equ;   7 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   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   :  106 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    inverse(double_divide(inverse(double_divide(X0,inverse(double_divide(X1,double_divide(X0,X2))))),X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

cnf(c_50,plain,
    inverse(double_divide(X0,X1)) = multiply(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

cnf(c_51,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

cnf(c_60,plain,
    multiply(X0,multiply(multiply(double_divide(X1,X0),X2),X1)) = X2,
    inference(demodulation,[status(thm)],[c_49,c_50]) ).

cnf(c_97,plain,
    multiply(multiply(double_divide(X0,double_divide(X1,X2)),X3),X0) = multiply(X2,multiply(X3,X1)),
    inference(superposition,[status(thm)],[c_60,c_60]) ).

cnf(c_101,plain,
    multiply(double_divide(X0,X1),multiply(X1,multiply(X2,X0))) = X2,
    inference(superposition,[status(thm)],[c_97,c_60]) ).

cnf(c_106,plain,
    multiply(double_divide(multiply(multiply(double_divide(X0,X1),X2),X0),X3),multiply(X3,X2)) = X1,
    inference(superposition,[status(thm)],[c_60,c_101]) ).

cnf(c_110,plain,
    multiply(double_divide(multiply(X0,multiply(X1,X2)),X3),multiply(X3,X1)) = double_divide(X2,X0),
    inference(superposition,[status(thm)],[c_101,c_101]) ).

cnf(c_189,plain,
    double_divide(X0,multiply(double_divide(multiply(X1,X0),X2),X1)) = X2,
    inference(superposition,[status(thm)],[c_110,c_106]) ).

cnf(c_213,plain,
    double_divide(multiply(X0,X1),double_divide(X1,multiply(X2,X0))) = X2,
    inference(superposition,[status(thm)],[c_110,c_189]) ).

cnf(c_224,plain,
    multiply(multiply(double_divide(multiply(X0,X1),X2),X0),X1) = inverse(X2),
    inference(superposition,[status(thm)],[c_189,c_50]) ).

cnf(c_258,plain,
    multiply(double_divide(X0,multiply(X1,X2)),multiply(multiply(X1,X3),multiply(X2,X0))) = X3,
    inference(superposition,[status(thm)],[c_213,c_60]) ).

cnf(c_261,plain,
    multiply(double_divide(X0,multiply(X1,X2)),multiply(X2,X0)) = inverse(X1),
    inference(superposition,[status(thm)],[c_213,c_50]) ).

cnf(c_356,plain,
    multiply(double_divide(X0,double_divide(X0,multiply(X1,X2))),inverse(X1)) = X2,
    inference(superposition,[status(thm)],[c_261,c_101]) ).

cnf(c_524,plain,
    double_divide(multiply(inverse(X0),X1),multiply(X0,X2)) = double_divide(X1,X2),
    inference(superposition,[status(thm)],[c_356,c_189]) ).

cnf(c_581,plain,
    double_divide(X0,multiply(double_divide(X0,X1),inverse(X2))) = multiply(X2,X1),
    inference(superposition,[status(thm)],[c_524,c_189]) ).

cnf(c_615,plain,
    multiply(X0,double_divide(X1,multiply(X0,X2))) = double_divide(X1,X2),
    inference(superposition,[status(thm)],[c_356,c_581]) ).

cnf(c_650,plain,
    multiply(double_divide(multiply(X0,X1),X2),X2) = double_divide(X1,X0),
    inference(superposition,[status(thm)],[c_189,c_615]) ).

cnf(c_1015,plain,
    double_divide(multiply(X0,X1),double_divide(X1,multiply(X2,X0))) = multiply(double_divide(inverse(X2),X3),X3),
    inference(superposition,[status(thm)],[c_261,c_650]) ).

cnf(c_1045,plain,
    multiply(double_divide(X0,X1),X0) = inverse(X1),
    inference(superposition,[status(thm)],[c_650,c_224]) ).

cnf(c_1046,plain,
    double_divide(X0,double_divide(X0,X1)) = X1,
    inference(superposition,[status(thm)],[c_650,c_189]) ).

cnf(c_1049,plain,
    inverse(multiply(X0,X1)) = double_divide(X1,X0),
    inference(superposition,[status(thm)],[c_650,c_261]) ).

cnf(c_1051,plain,
    multiply(double_divide(inverse(X0),X1),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_1015,c_213]) ).

cnf(c_1054,plain,
    multiply(multiply(X0,X1),inverse(X0)) = X1,
    inference(demodulation,[status(thm)],[c_356,c_1046]) ).

cnf(c_1169,plain,
    double_divide(X0,double_divide(X0,X1)) = inverse(inverse(X1)),
    inference(superposition,[status(thm)],[c_1045,c_1049]) ).

cnf(c_1170,plain,
    inverse(inverse(X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_1169,c_1046]) ).

cnf(c_1241,plain,
    multiply(double_divide(X0,X1),X1) = inverse(X0),
    inference(superposition,[status(thm)],[c_1170,c_1051]) ).

cnf(c_1249,plain,
    multiply(double_divide(X0,X1),multiply(X1,X2)) = double_divide(inverse(X2),X0),
    inference(superposition,[status(thm)],[c_1051,c_101]) ).

cnf(c_1258,plain,
    double_divide(inverse(multiply(X0,X1)),X1) = X0,
    inference(demodulation,[status(thm)],[c_101,c_1249]) ).

cnf(c_1259,plain,
    double_divide(double_divide(X0,X1),X0) = X1,
    inference(light_normalisation,[status(thm)],[c_1258,c_1049]) ).

cnf(c_1279,plain,
    double_divide(X0,X1) = double_divide(X1,X0),
    inference(superposition,[status(thm)],[c_1046,c_1259]) ).

cnf(c_1300,plain,
    inverse(double_divide(X0,X1)) = multiply(X0,X1),
    inference(superposition,[status(thm)],[c_1279,c_50]) ).

cnf(c_1336,plain,
    multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_1300,c_50]) ).

cnf(c_1339,plain,
    multiply(inverse(b1),b1) != multiply(a1,inverse(a1)),
    inference(demodulation,[status(thm)],[c_51,c_1336]) ).

cnf(c_1354,plain,
    multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)),
    inference(superposition,[status(thm)],[c_1336,c_1339]) ).

cnf(c_1358,plain,
    multiply(multiply(X0,X1),inverse(X1)) = X0,
    inference(superposition,[status(thm)],[c_1336,c_1054]) ).

cnf(c_1365,plain,
    multiply(multiply(double_divide(X0,X1),X2),multiply(X1,X0)) = X2,
    inference(superposition,[status(thm)],[c_50,c_1054]) ).

cnf(c_1370,plain,
    double_divide(inverse(X0),multiply(X0,X1)) = inverse(X1),
    inference(superposition,[status(thm)],[c_1054,c_1049]) ).

cnf(c_1428,plain,
    multiply(double_divide(X0,multiply(double_divide(X0,X1),X1)),X2) = X2,
    inference(superposition,[status(thm)],[c_1365,c_258]) ).

cnf(c_1429,plain,
    multiply(double_divide(X0,inverse(X0)),X1) = X1,
    inference(light_normalisation,[status(thm)],[c_1428,c_1241]) ).

cnf(c_1646,plain,
    double_divide(X0,inverse(X0)) = multiply(X1,inverse(X1)),
    inference(superposition,[status(thm)],[c_1429,c_1358]) ).

cnf(c_2108,plain,
    double_divide(inverse(X0),X1) = multiply(X0,inverse(X1)),
    inference(superposition,[status(thm)],[c_1370,c_615]) ).

cnf(c_2116,plain,
    double_divide(inverse(a1),a1) != multiply(b1,inverse(b1)),
    inference(demodulation,[status(thm)],[c_1354,c_2108]) ).

cnf(c_2361,plain,
    double_divide(X0,inverse(X0)) != double_divide(inverse(a1),a1),
    inference(superposition,[status(thm)],[c_1646,c_2116]) ).

cnf(c_2362,plain,
    double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
    inference(superposition,[status(thm)],[c_1646,c_1646]) ).

cnf(c_2377,plain,
    double_divide(a1,inverse(a1)) = double_divide(a1,inverse(a1)),
    inference(instantiation,[status(thm)],[c_2362]) ).

cnf(c_2869,plain,
    double_divide(X0,inverse(X0)) != double_divide(a1,inverse(a1)),
    inference(superposition,[status(thm)],[c_1279,c_2361]) ).

cnf(c_2871,plain,
    double_divide(a1,inverse(a1)) != double_divide(a1,inverse(a1)),
    inference(instantiation,[status(thm)],[c_2869]) ).

cnf(c_2872,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2871,c_2377]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP601-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.33  % Computer : n009.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Mon Aug 28 22:59:20 EDT 2023
% 0.11/0.33  % CPUTime  : 
% 0.17/0.45  Running UEQ theorem proving
% 0.17/0.45  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.81/1.13  % SZS status Started for theBenchmark.p
% 3.81/1.13  % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.13  
% 3.81/1.13  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.81/1.13  
% 3.81/1.13  ------  iProver source info
% 3.81/1.13  
% 3.81/1.13  git: date: 2023-05-31 18:12:56 +0000
% 3.81/1.13  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.81/1.13  git: non_committed_changes: false
% 3.81/1.13  git: last_make_outside_of_git: false
% 3.81/1.13  
% 3.81/1.13  ------ Parsing...successful
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.81/1.13  
% 3.81/1.13  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.81/1.13  
% 3.81/1.13  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.81/1.13  ------ Proving...
% 3.81/1.13  ------ Problem Properties 
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  clauses                                 3
% 3.81/1.13  conjectures                             1
% 3.81/1.13  EPR                                     0
% 3.81/1.13  Horn                                    3
% 3.81/1.13  unary                                   3
% 3.81/1.13  binary                                  0
% 3.81/1.13  lits                                    3
% 3.81/1.13  lits eq                                 3
% 3.81/1.13  fd_pure                                 0
% 3.81/1.13  fd_pseudo                               0
% 3.81/1.13  fd_cond                                 0
% 3.81/1.13  fd_pseudo_cond                          0
% 3.81/1.13  AC symbols                              0
% 3.81/1.13  
% 3.81/1.13  ------ Input Options Time Limit: Unbounded
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  ------ 
% 3.81/1.13  Current options:
% 3.81/1.13  ------ 
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  ------ Proving...
% 3.81/1.13  
% 3.81/1.13  
% 3.81/1.13  % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.13  
% 3.81/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.13  
% 3.81/1.14  
%------------------------------------------------------------------------------