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

View Problem - Process Solution

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

% Computer : n022.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:42 EDT 2024

% Result   : Unsatisfiable 1.81s 1.19s
% Output   : CNFRefutation 1.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   25 (  25 unt;   0 nHn;   2 RR)
%            Number of literals    :   25 (  24 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   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   :   48 (   0 sgn)

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

cnf(c_50,plain,
    divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

cnf(c_51,plain,
    divide(divide(X0,X0),X1) = inverse(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).

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

cnf(c_64,plain,
    divide(X0,inverse(X1)) = multiply(X0,X1),
    inference(demodulation,[status(thm)],[c_50,c_51]) ).

cnf(c_105,plain,
    divide(inverse(divide(X0,X0)),X1) = inverse(X1),
    inference(superposition,[status(thm)],[c_51,c_51]) ).

cnf(c_110,plain,
    multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
    inference(superposition,[status(thm)],[c_64,c_51]) ).

cnf(c_119,plain,
    multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
    inference(superposition,[status(thm)],[c_105,c_64]) ).

cnf(c_205,plain,
    divide(X0,divide(divide(X1,divide(X2,X0)),X1)) = X2,
    inference(superposition,[status(thm)],[c_49,c_49]) ).

cnf(c_290,plain,
    divide(X0,inverse(divide(X1,X0))) = X1,
    inference(superposition,[status(thm)],[c_51,c_205]) ).

cnf(c_409,plain,
    multiply(X0,divide(X1,X0)) = X1,
    inference(demodulation,[status(thm)],[c_290,c_64]) ).

cnf(c_414,plain,
    multiply(X0,inverse(X0)) = divide(X1,X1),
    inference(superposition,[status(thm)],[c_51,c_409]) ).

cnf(c_415,plain,
    multiply(inverse(X0),multiply(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c_64,c_409]) ).

cnf(c_489,plain,
    divide(X0,X0) = divide(X1,X1),
    inference(superposition,[status(thm)],[c_414,c_414]) ).

cnf(c_641,plain,
    multiply(X0,divide(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_489,c_409]) ).

cnf(c_724,plain,
    inverse(inverse(multiply(X0,divide(X1,X1)))) = X0,
    inference(superposition,[status(thm)],[c_415,c_119]) ).

cnf(c_726,plain,
    inverse(inverse(X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_724,c_641]) ).

cnf(c_729,plain,
    multiply(divide(X0,X0),X1) = X1,
    inference(demodulation,[status(thm)],[c_110,c_726]) ).

cnf(c_769,plain,
    divide(X0,divide(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_729,c_409]) ).

cnf(c_790,plain,
    divide(X0,divide(X0,X1)) = X1,
    inference(superposition,[status(thm)],[c_769,c_49]) ).

cnf(c_868,plain,
    multiply(divide(X0,X1),X1) = X0,
    inference(superposition,[status(thm)],[c_790,c_409]) ).

cnf(c_911,plain,
    multiply(inverse(X0),X1) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_868,c_415]) ).

cnf(c_915,plain,
    divide(multiply(X0,X1),X1) = X0,
    inference(demodulation,[status(thm)],[c_415,c_911]) ).

cnf(c_946,plain,
    multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_915,c_409]) ).

cnf(c_949,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_946]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : GRP524-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.09/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n022.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Jun 20 08:07:24 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 0.22/0.50  Running UEQ theorem proving
% 0.22/0.50  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.81/1.19  % SZS status Started for theBenchmark.p
% 1.81/1.19  % SZS status Unsatisfiable for theBenchmark.p
% 1.81/1.19  
% 1.81/1.19  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.81/1.19  
% 1.81/1.19  ------  iProver source info
% 1.81/1.19  
% 1.81/1.19  git: date: 2024-06-12 09:56:46 +0000
% 1.81/1.19  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.81/1.19  git: non_committed_changes: false
% 1.81/1.19  
% 1.81/1.19  ------ Parsing...successful
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.81/1.19  
% 1.81/1.19  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.81/1.19  
% 1.81/1.19  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.81/1.19  ------ Proving...
% 1.81/1.19  ------ Problem Properties 
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  clauses                                 4
% 1.81/1.19  conjectures                             1
% 1.81/1.19  EPR                                     0
% 1.81/1.19  Horn                                    4
% 1.81/1.19  unary                                   4
% 1.81/1.19  binary                                  0
% 1.81/1.19  lits                                    4
% 1.81/1.19  lits eq                                 4
% 1.81/1.19  fd_pure                                 0
% 1.81/1.19  fd_pseudo                               0
% 1.81/1.19  fd_cond                                 0
% 1.81/1.19  fd_pseudo_cond                          0
% 1.81/1.19  AC symbols                              0
% 1.81/1.19  
% 1.81/1.19  ------ Input Options Time Limit: Unbounded
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  ------ 
% 1.81/1.19  Current options:
% 1.81/1.19  ------ 
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  ------ Proving...
% 1.81/1.19  
% 1.81/1.19  
% 1.81/1.19  % SZS status Unsatisfiable for theBenchmark.p
% 1.81/1.19  
% 1.81/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.19  
% 1.81/1.19  
%------------------------------------------------------------------------------