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

View Problem - Process Solution

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

% Computer : n031.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:59:45 EDT 2023

% Result   : Unsatisfiable 4.27s 1.14s
% Output   : CNFRefutation 4.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   2 RR)
%            Number of literals    :   13 (  12 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn)

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

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

cnf(c_92,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2)))) = multiply(X0,inverse(multiply(inverse(X3),multiply(inverse(X1),multiply(inverse(X1),X1))))),
    inference(superposition,[status(thm)],[c_49,c_49]) ).

cnf(c_120,plain,
    multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X2),multiply(inverse(X1),multiply(inverse(X1),X1)))))) = X2,
    inference(superposition,[status(thm)],[c_92,c_49]) ).

cnf(c_131,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(multiply(X0,X1)),X3))),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X3,
    inference(superposition,[status(thm)],[c_92,c_49]) ).

cnf(c_208,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,X2))),multiply(inverse(X1),multiply(inverse(X1),X1)))) = X2,
    inference(superposition,[status(thm)],[c_131,c_131]) ).

cnf(c_247,plain,
    multiply(inverse(multiply(X0,X1)),inverse(multiply(X2,multiply(inverse(multiply(X0,X2)),multiply(inverse(multiply(X0,X2)),multiply(X0,X2)))))) = multiply(inverse(X1),multiply(inverse(X1),X1)),
    inference(superposition,[status(thm)],[c_208,c_49]) ).

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

cnf(c_302,plain,
    multiply(inverse(multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))),multiply(X0,X2)) = multiply(X3,multiply(inverse(multiply(inverse(multiply(X4,X1)),multiply(X4,X3))),X2)),
    inference(superposition,[status(thm)],[c_208,c_258]) ).

cnf(c_1235,plain,
    multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(X2)))),multiply(inverse(X1),multiply(inverse(X1),X1))) = X2,
    inference(superposition,[status(thm)],[c_247,c_120]) ).

cnf(c_4289,plain,
    multiply(inverse(multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))),multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))) = multiply(inverse(X2),X2),
    inference(superposition,[status(thm)],[c_1235,c_302]) ).

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

cnf(c_5166,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_5048]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP406-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n031.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 00:28:25 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running UEQ theorem proving
% 0.19/0.47  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
% 4.27/1.14  % SZS status Started for theBenchmark.p
% 4.27/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 4.27/1.14  
% 4.27/1.14  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.27/1.14  
% 4.27/1.14  ------  iProver source info
% 4.27/1.14  
% 4.27/1.14  git: date: 2023-05-31 18:12:56 +0000
% 4.27/1.14  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.27/1.14  git: non_committed_changes: false
% 4.27/1.14  git: last_make_outside_of_git: false
% 4.27/1.14  
% 4.27/1.14  ------ Parsing...successful
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 4.27/1.14  
% 4.27/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 4.27/1.14  
% 4.27/1.14  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 4.27/1.14  ------ Proving...
% 4.27/1.14  ------ Problem Properties 
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  clauses                                 2
% 4.27/1.14  conjectures                             1
% 4.27/1.14  EPR                                     0
% 4.27/1.14  Horn                                    2
% 4.27/1.14  unary                                   2
% 4.27/1.14  binary                                  0
% 4.27/1.14  lits                                    2
% 4.27/1.14  lits eq                                 2
% 4.27/1.14  fd_pure                                 0
% 4.27/1.14  fd_pseudo                               0
% 4.27/1.14  fd_cond                                 0
% 4.27/1.14  fd_pseudo_cond                          0
% 4.27/1.14  AC symbols                              0
% 4.27/1.14  
% 4.27/1.14  ------ Input Options Time Limit: Unbounded
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  ------ 
% 4.27/1.14  Current options:
% 4.27/1.14  ------ 
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  ------ Proving...
% 4.27/1.14  
% 4.27/1.14  
% 4.27/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 4.27/1.14  
% 4.27/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.27/1.14  
% 4.27/1.14  
%------------------------------------------------------------------------------