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

View Problem - Process Solution

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

% Computer : n027.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:02 EDT 2024

% Result   : Unsatisfiable 0.46s 1.16s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   23 (  23 unt;   0 nHn;   3 RR)
%            Number of literals    :   23 (  22 equ;   2 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   :   52 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(inverse(X2),X1))))) = X2,
    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(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).

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

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

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

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

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

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

cnf(c_447,plain,
    double_divide(X0,multiply(inverse(X0),inverse(X1))) = X1,
    inference(superposition,[status(thm)],[c_60,c_258]) ).

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

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

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

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

cnf(c_632,plain,
    double_divide(double_divide(inverse(X0),inverse(inverse(X1))),inverse(X0)) = X1,
    inference(superposition,[status(thm)],[c_511,c_507]) ).

cnf(c_959,plain,
    double_divide(inverse(X0),multiply(inverse(X1),X1)) = X0,
    inference(superposition,[status(thm)],[c_601,c_507]) ).

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

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

cnf(c_1064,plain,
    double_divide(double_divide(X0,inverse(X1)),inverse(X1)) = X0,
    inference(light_normalisation,[status(thm)],[c_1034,c_959]) ).

cnf(c_1277,plain,
    inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_1064,c_632]) ).

cnf(c_1319,plain,
    multiply(multiply(inverse(X0),X0),X1) = X1,
    inference(superposition,[status(thm)],[c_1277,c_999]) ).

cnf(c_1341,plain,
    a2 != a2,
    inference(demodulation,[status(thm)],[c_51,c_1319]) ).

cnf(c_1342,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_1341]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP598-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri May  3 00:29:20 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  Running UEQ theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.16  % SZS status Started for theBenchmark.p
% 0.46/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.16  
% 0.46/1.16  ------  iProver source info
% 0.46/1.16  
% 0.46/1.16  git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.16  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.16  git: non_committed_changes: false
% 0.46/1.16  
% 0.46/1.16  ------ Parsing...successful
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.46/1.16  ------ Proving...
% 0.46/1.16  ------ Problem Properties 
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  clauses                                 3
% 0.46/1.16  conjectures                             1
% 0.46/1.16  EPR                                     0
% 0.46/1.16  Horn                                    3
% 0.46/1.16  unary                                   3
% 0.46/1.16  binary                                  0
% 0.46/1.16  lits                                    3
% 0.46/1.16  lits eq                                 3
% 0.46/1.16  fd_pure                                 0
% 0.46/1.16  fd_pseudo                               0
% 0.46/1.16  fd_cond                                 0
% 0.46/1.16  fd_pseudo_cond                          0
% 0.46/1.16  AC symbols                              0
% 0.46/1.16  
% 0.46/1.16  ------ Input Options Time Limit: Unbounded
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ 
% 0.46/1.16  Current options:
% 0.46/1.16  ------ 
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ Proving...
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.16  
% 0.46/1.16  
%------------------------------------------------------------------------------