TSTP Solution File: GRP616-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : GRP616-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n001.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 : Mon Jun 24 07:00:57 EDT 2024

% Result   : Unsatisfiable 3.81s 1.13s
% Output   : CNFRefutation 3.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   37 (  37 unt;   0 nHn;   2 RR)
%            Number of literals    :   37 (  36 equ;   1 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   :   86 (   0 sgn)

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

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

cnf(c_51,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).

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

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

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

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

cnf(c_116,plain,
    double_divide(inverse(X0),double_divide(multiply(inverse(X0),X1),double_divide(X1,inverse(X2)))) = X2,
    inference(superposition,[status(thm)],[c_108,c_60]) ).

cnf(c_323,plain,
    double_divide(multiply(double_divide(multiply(X0,multiply(inverse(inverse(X1)),X2)),double_divide(X2,X0)),inverse(X3)),X3) = X1,
    inference(superposition,[status(thm)],[c_113,c_109]) ).

cnf(c_566,plain,
    double_divide(multiply(inverse(X0),inverse(X1)),X1) = X0,
    inference(demodulation,[status(thm)],[c_323,c_60]) ).

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

cnf(c_572,plain,
    multiply(X0,multiply(inverse(X1),inverse(X0))) = inverse(X1),
    inference(superposition,[status(thm)],[c_566,c_50]) ).

cnf(c_631,plain,
    double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
    inference(superposition,[status(thm)],[c_572,c_60]) ).

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

cnf(c_882,plain,
    double_divide(inverse(X0),double_divide(inverse(inverse(X1)),inverse(X0))) = X1,
    inference(superposition,[status(thm)],[c_572,c_568]) ).

cnf(c_1260,plain,
    double_divide(multiply(X0,inverse(X0)),inverse(X1)) = X1,
    inference(superposition,[status(thm)],[c_743,c_568]) ).

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

cnf(c_1325,plain,
    multiply(inverse(X0),multiply(X1,inverse(X1))) = inverse(X0),
    inference(superposition,[status(thm)],[c_1260,c_50]) ).

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

cnf(c_2089,plain,
    double_divide(inverse(X0),double_divide(multiply(inverse(X0),multiply(double_divide(X1,X2),multiply(X2,X1))),X3)) = X3,
    inference(superposition,[status(thm)],[c_1320,c_116]) ).

cnf(c_2098,plain,
    double_divide(inverse(X0),double_divide(inverse(X0),X1)) = X1,
    inference(light_normalisation,[status(thm)],[c_2089,c_1585]) ).

cnf(c_2218,plain,
    inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_2098,c_882]) ).

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

cnf(c_2276,plain,
    multiply(X0,multiply(X1,inverse(X0))) = X1,
    inference(superposition,[status(thm)],[c_2218,c_572]) ).

cnf(c_2279,plain,
    double_divide(X0,double_divide(X0,X1)) = X1,
    inference(superposition,[status(thm)],[c_2218,c_2098]) ).

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

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

cnf(c_2406,plain,
    multiply(inverse(X0),multiply(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c_2218,c_2276]) ).

cnf(c_2494,plain,
    double_divide(inverse(X0),X1) = multiply(X0,inverse(X1)),
    inference(superposition,[status(thm)],[c_2393,c_2276]) ).

cnf(c_2497,plain,
    multiply(X0,double_divide(inverse(X1),X0)) = X1,
    inference(demodulation,[status(thm)],[c_2276,c_2494]) ).

cnf(c_2676,plain,
    multiply(double_divide(X0,X1),X1) = inverse(X0),
    inference(superposition,[status(thm)],[c_2406,c_2405]) ).

cnf(c_2750,plain,
    multiply(X0,double_divide(X1,X0)) = inverse(X1),
    inference(superposition,[status(thm)],[c_2218,c_2497]) ).

cnf(c_2928,plain,
    double_divide(double_divide(X0,X1),X1) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c_2750,c_2271]) ).

cnf(c_2937,plain,
    double_divide(double_divide(X0,X1),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_2928,c_2218]) ).

cnf(c_2968,plain,
    inverse(double_divide(X0,X1)) = multiply(X0,X1),
    inference(superposition,[status(thm)],[c_2937,c_2676]) ).

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

cnf(c_3181,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_51,c_3176]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : GRP616-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.02/0.09  % Command  : run_iprover %s %d THM
% 0.08/0.28  % Computer : n001.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Thu Jun 20 11:57:09 EDT 2024
% 0.08/0.29  % CPUTime  : 
% 0.15/0.43  Running UEQ theorem proving
% 0.15/0.43  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/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.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.81/1.13  
% 3.81/1.13  ------  iProver source info
% 3.81/1.13  
% 3.81/1.13  git: date: 2024-06-12 09:56:46 +0000
% 3.81/1.13  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.81/1.13  git: non_committed_changes: 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.13  
%------------------------------------------------------------------------------