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

View Problem - Process Solution

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

% Computer : n021.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:22:30 EDT 2024

% Result   : Unsatisfiable 0.46s 1.15s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   12 (  12 unt;   0 nHn;   2 RR)
%            Number of literals    :   12 (  11 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   10 (   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(multiply(inverse(multiply(X0,inverse(multiply(X1,X2)))),multiply(X0,inverse(X2))),inverse(multiply(inverse(X2),X2))) = X1,
    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,
    multiply(multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(inverse(multiply(inverse(X2),X2))))),inverse(multiply(inverse(inverse(multiply(inverse(X2),X2))),inverse(multiply(inverse(X2),X2))))) = multiply(inverse(multiply(X3,inverse(multiply(X1,X2)))),multiply(X3,inverse(X2))),
    inference(superposition,[status(thm)],[c_49,c_49]) ).

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

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

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

cnf(c_365,plain,
    multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(multiply(X2,inverse(X3))))) = multiply(inverse(multiply(X4,inverse(X1))),multiply(X4,inverse(multiply(X2,inverse(X3))))),
    inference(superposition,[status(thm)],[c_220,c_225]) ).

cnf(c_458,plain,
    multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(X2))) = multiply(inverse(multiply(X3,inverse(X1))),multiply(X3,inverse(X2))),
    inference(superposition,[status(thm)],[c_94,c_365]) ).

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

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

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

cnf(c_1141,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_796]) ).


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