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

View Problem - Process Solution

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

% Computer : n019.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:50 EDT 2024

% Result   : Unsatisfiable 3.12s 1.14s
% Output   : CNFRefutation 3.12s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

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

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

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

cnf(c_52,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox/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_70,plain,
    multiply(a,b) = sP0_iProver_def,
    definition ).

cnf(c_71,plain,
    multiply(b,a) = sP1_iProver_def,
    definition ).

cnf(c_72,negated_conjecture,
    sP0_iProver_def != sP1_iProver_def,
    inference(demodulation,[status(thm)],[c_52,c_71,c_70]) ).

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

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

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

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

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

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

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

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

cnf(c_794,plain,
    multiply(X0,divide(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_631,c_539]) ).

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

cnf(c_901,plain,
    multiply(inverse(a),sP1_iProver_def) = b,
    inference(superposition,[status(thm)],[c_71,c_547]) ).

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

cnf(c_915,plain,
    inverse(inverse(X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_911,c_794]) ).

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

cnf(c_1133,plain,
    divide(X0,divide(X1,X1)) = X0,
    inference(demodulation,[status(thm)],[c_835,c_976]) ).

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

cnf(c_1280,plain,
    multiply(divide(X0,X1),X1) = X0,
    inference(superposition,[status(thm)],[c_1153,c_539]) ).

cnf(c_1311,plain,
    multiply(inverse(X0),X1) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_1280,c_547]) ).

cnf(c_1317,plain,
    divide(sP1_iProver_def,a) = b,
    inference(demodulation,[status(thm)],[c_901,c_1311]) ).

cnf(c_1345,plain,
    multiply(a,b) = sP1_iProver_def,
    inference(superposition,[status(thm)],[c_1317,c_539]) ).

cnf(c_1346,plain,
    sP0_iProver_def = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_1345,c_70]) ).

cnf(c_1347,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1346,c_72]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP524-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n019.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 : Thu May  2 23:45:44 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  Running UEQ theorem proving
% 0.20/0.46  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
% 3.12/1.14  % SZS status Started for theBenchmark.p
% 3.12/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 3.12/1.14  
% 3.12/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.12/1.14  
% 3.12/1.14  ------  iProver source info
% 3.12/1.14  
% 3.12/1.14  git: date: 2024-05-02 19:28:25 +0000
% 3.12/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.12/1.14  git: non_committed_changes: false
% 3.12/1.14  
% 3.12/1.14  ------ Parsing...successful
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.12/1.14  
% 3.12/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.12/1.14  
% 3.12/1.14  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.12/1.14  ------ Proving...
% 3.12/1.14  ------ Problem Properties 
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  clauses                                 6
% 3.12/1.14  conjectures                             1
% 3.12/1.14  EPR                                     1
% 3.12/1.14  Horn                                    6
% 3.12/1.14  unary                                   6
% 3.12/1.14  binary                                  0
% 3.12/1.14  lits                                    6
% 3.12/1.14  lits eq                                 6
% 3.12/1.14  fd_pure                                 0
% 3.12/1.14  fd_pseudo                               0
% 3.12/1.14  fd_cond                                 0
% 3.12/1.14  fd_pseudo_cond                          0
% 3.12/1.14  AC symbols                              0
% 3.12/1.14  
% 3.12/1.14  ------ Input Options Time Limit: Unbounded
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  ------ 
% 3.12/1.14  Current options:
% 3.12/1.14  ------ 
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  ------ Proving...
% 3.12/1.14  
% 3.12/1.14  
% 3.12/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 3.12/1.14  
% 3.12/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.12/1.14  
% 3.12/1.14  
%------------------------------------------------------------------------------