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

View Problem - Process Solution

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

% Computer : n004.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:44 EDT 2024

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

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

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

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

cnf(c_52,plain,
    double_divide(X0,inverse(X0)) = identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).

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

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

cnf(c_69,plain,
    double_divide(double_divide(identity,X0),double_divide(double_divide(double_divide(X1,X2),inverse(identity)),double_divide(X0,X2))) = X1,
    inference(demodulation,[status(thm)],[c_49,c_51]) ).

cnf(c_77,plain,
    inverse(a1) = sP0_iProver_def,
    definition ).

cnf(c_78,plain,
    multiply(sP0_iProver_def,a1) = sP1_iProver_def,
    definition ).

cnf(c_79,negated_conjecture,
    sP1_iProver_def != identity,
    inference(demodulation,[status(thm)],[c_53,c_77,c_78]) ).

cnf(c_127,plain,
    double_divide(a1,sP0_iProver_def) = identity,
    inference(superposition,[status(thm)],[c_77,c_52]) ).

cnf(c_130,plain,
    multiply(sP0_iProver_def,a1) = inverse(identity),
    inference(superposition,[status(thm)],[c_127,c_68]) ).

cnf(c_132,plain,
    inverse(identity) = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_130,c_78]) ).

cnf(c_136,plain,
    double_divide(identity,sP1_iProver_def) = identity,
    inference(superposition,[status(thm)],[c_132,c_52]) ).

cnf(c_137,plain,
    double_divide(double_divide(identity,X0),double_divide(double_divide(double_divide(X1,X2),sP1_iProver_def),double_divide(X0,X2))) = X1,
    inference(light_normalisation,[status(thm)],[c_69,c_132]) ).

cnf(c_172,plain,
    double_divide(double_divide(identity,X0),double_divide(identity,double_divide(X0,sP1_iProver_def))) = identity,
    inference(superposition,[status(thm)],[c_136,c_137]) ).

cnf(c_374,plain,
    double_divide(inverse(identity),double_divide(identity,double_divide(identity,sP1_iProver_def))) = identity,
    inference(superposition,[status(thm)],[c_51,c_172]) ).

cnf(c_386,plain,
    double_divide(sP1_iProver_def,double_divide(identity,identity)) = identity,
    inference(light_normalisation,[status(thm)],[c_374,c_132,c_136]) ).

cnf(c_415,plain,
    double_divide(sP1_iProver_def,sP1_iProver_def) = identity,
    inference(demodulation,[status(thm)],[c_386,c_51,c_132]) ).

cnf(c_416,plain,
    double_divide(double_divide(identity,X0),double_divide(double_divide(identity,sP1_iProver_def),double_divide(X0,sP1_iProver_def))) = sP1_iProver_def,
    inference(superposition,[status(thm)],[c_415,c_137]) ).

cnf(c_425,plain,
    identity = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_416,c_136,c_172]) ).

cnf(c_444,plain,
    sP1_iProver_def != sP1_iProver_def,
    inference(demodulation,[status(thm)],[c_79,c_425]) ).

cnf(c_445,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_444]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP493-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n004.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 23:57:48 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  Running UEQ theorem proving
% 0.17/0.43  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
% 2.69/1.11  % SZS status Started for theBenchmark.p
% 2.69/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 2.69/1.11  
% 2.69/1.11  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.69/1.11  
% 2.69/1.11  ------  iProver source info
% 2.69/1.11  
% 2.69/1.11  git: date: 2024-05-02 19:28:25 +0000
% 2.69/1.11  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.69/1.11  git: non_committed_changes: false
% 2.69/1.11  
% 2.69/1.11  ------ Parsing...successful
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  ------ Preprocessing... sup_sim: 2  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.69/1.11  
% 2.69/1.11  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.69/1.11  
% 2.69/1.11  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.69/1.11  ------ Proving...
% 2.69/1.11  ------ Problem Properties 
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  clauses                                 7
% 2.69/1.11  conjectures                             1
% 2.69/1.11  EPR                                     1
% 2.69/1.11  Horn                                    7
% 2.69/1.11  unary                                   7
% 2.69/1.11  binary                                  0
% 2.69/1.11  lits                                    7
% 2.69/1.11  lits eq                                 7
% 2.69/1.11  fd_pure                                 0
% 2.69/1.11  fd_pseudo                               0
% 2.69/1.11  fd_cond                                 0
% 2.69/1.11  fd_pseudo_cond                          0
% 2.69/1.11  AC symbols                              0
% 2.69/1.11  
% 2.69/1.11  ------ Input Options Time Limit: Unbounded
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  ------ 
% 2.69/1.11  Current options:
% 2.69/1.11  ------ 
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  ------ Proving...
% 2.69/1.11  
% 2.69/1.11  
% 2.69/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 2.69/1.11  
% 2.69/1.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.69/1.11  
% 2.69/1.11  
%------------------------------------------------------------------------------