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

View Problem - Process Solution

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

% Computer : n008.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:01 EDT 2023

% Result   : Unsatisfiable 7.42s 1.69s
% Output   : CNFRefutation 7.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   19 (  19 unt;   0 nHn;   4 RR)
%            Number of literals    :   19 (  18 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (   0 sgn)

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

cnf(c_50,plain,
    divide(X0,inverse(X1)) = multiply(X0,X1),
    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,
    divide(divide(X0,X0),divide(X1,multiply(divide(X2,divide(X3,X1)),X3))) = X2,
    inference(demodulation,[status(thm)],[c_49,c_50]) ).

cnf(c_155,plain,
    divide(divide(X0,X0),divide(multiply(divide(X1,divide(X2,X3)),X2),multiply(X1,X3))) = divide(X4,X4),
    inference(superposition,[status(thm)],[c_60,c_60]) ).

cnf(c_159,plain,
    divide(X0,X0) = sP0_iProver_split,
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_155]) ).

cnf(c_2910,plain,
    multiply(inverse(X0),X0) = sP0_iProver_split,
    inference(superposition,[status(thm)],[c_159,c_50]) ).

cnf(c_2914,plain,
    divide(divide(X0,X0),divide(X1,multiply(sP0_iProver_split,X2))) = divide(X2,X1),
    inference(superposition,[status(thm)],[c_159,c_60]) ).

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

cnf(c_2924,plain,
    divide(sP0_iProver_split,divide(X0,multiply(sP0_iProver_split,X1))) = divide(X1,X0),
    inference(demodulation,[status(thm)],[c_2914,c_159]) ).

cnf(c_2925,plain,
    divide(sP0_iProver_split,divide(inverse(X0),multiply(divide(X1,multiply(X2,X0)),X2))) = X1,
    inference(demodulation,[status(thm)],[c_2917,c_159]) ).

cnf(c_2929,plain,
    multiply(sP0_iProver_split,a2) != a2,
    inference(demodulation,[status(thm)],[c_51,c_2910]) ).

cnf(c_2933,plain,
    divide(X0,multiply(sP0_iProver_split,X0)) = divide(sP0_iProver_split,sP0_iProver_split),
    inference(superposition,[status(thm)],[c_159,c_2924]) ).

cnf(c_2962,plain,
    divide(sP0_iProver_split,divide(inverse(X0),multiply(sP0_iProver_split,X1))) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_159,c_2925]) ).

cnf(c_3036,plain,
    divide(X0,multiply(sP0_iProver_split,X0)) = sP0_iProver_split,
    inference(demodulation,[status(thm)],[c_2933,c_159]) ).

cnf(c_3155,plain,
    divide(sP0_iProver_split,divide(inverse(X0),multiply(sP0_iProver_split,sP0_iProver_split))) = X0,
    inference(superposition,[status(thm)],[c_3036,c_2925]) ).

cnf(c_4259,plain,
    multiply(sP0_iProver_split,X0) = X0,
    inference(demodulation,[status(thm)],[c_3155,c_2962]) ).

cnf(c_5656,plain,
    a2 != a2,
    inference(demodulation,[status(thm)],[c_2929,c_4259]) ).

cnf(c_5659,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_5656]) ).


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