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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : GRP709-1 : TPTP v8.2.0. Released v4.0.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:01:57 EDT 2024

% Result   : Unsatisfiable 0.49s 1.17s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  26 unt;   0 nHn;   4 RR)
%            Number of literals    :   26 (  25 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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    mult(X0,ld(X0,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).

cnf(c_51,plain,
    mult(rd(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).

cnf(c_52,plain,
    rd(mult(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).

cnf(c_54,plain,
    mult(unit,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).

cnf(c_55,plain,
    mult(mult(X0,mult(X1,X0)),X2) = mult(X0,mult(X1,mult(X0,X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).

cnf(c_56,plain,
    mult(X0,op_c) = mult(op_c,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).

cnf(c_57,plain,
    mult(mult(X0,X1),op_c) = mult(X0,mult(X1,op_c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).

cnf(c_58,negated_conjecture,
    mult(mult(mult(op_c,op_c),a),b) != mult(mult(op_c,op_c),mult(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(c_88,plain,
    mult(X0,mult(X1,op_c)) = mult(op_c,mult(X0,X1)),
    inference(demodulation,[status(thm)],[c_57,c_56]) ).

cnf(c_145,plain,
    ld(unit,X0) = X0,
    inference(superposition,[status(thm)],[c_54,c_49]) ).

cnf(c_163,plain,
    mult(op_c,mult(X0,rd(X1,op_c))) = mult(X0,X1),
    inference(superposition,[status(thm)],[c_51,c_88]) ).

cnf(c_194,plain,
    rd(mult(op_c,X0),op_c) = X0,
    inference(superposition,[status(thm)],[c_56,c_52]) ).

cnf(c_199,plain,
    mult(X0,mult(op_c,X1)) = mult(op_c,mult(X0,X1)),
    inference(superposition,[status(thm)],[c_56,c_88]) ).

cnf(c_215,plain,
    mult(mult(X0,mult(op_c,op_c)),X1) = mult(op_c,mult(X0,mult(op_c,X1))),
    inference(superposition,[status(thm)],[c_88,c_55]) ).

cnf(c_216,plain,
    mult(ld(X0,X1),mult(X0,mult(ld(X0,X1),X2))) = mult(mult(ld(X0,X1),X1),X2),
    inference(superposition,[status(thm)],[c_49,c_55]) ).

cnf(c_222,plain,
    mult(mult(op_c,mult(op_c,X0)),X1) = mult(op_c,mult(X0,mult(op_c,X1))),
    inference(superposition,[status(thm)],[c_56,c_55]) ).

cnf(c_290,plain,
    ld(op_c,X0) = rd(X0,op_c),
    inference(superposition,[status(thm)],[c_49,c_194]) ).

cnf(c_396,plain,
    mult(op_c,mult(X0,ld(op_c,X1))) = mult(X0,X1),
    inference(demodulation,[status(thm)],[c_163,c_290]) ).

cnf(c_824,plain,
    mult(X0,mult(op_c,ld(op_c,X1))) = mult(X0,X1),
    inference(superposition,[status(thm)],[c_199,c_396]) ).

cnf(c_1328,plain,
    mult(op_c,mult(op_c,mult(X0,mult(op_c,ld(op_c,X1))))) = mult(mult(X0,mult(op_c,op_c)),X1),
    inference(superposition,[status(thm)],[c_215,c_396]) ).

cnf(c_1331,plain,
    mult(op_c,mult(X0,mult(op_c,X1))) = mult(op_c,mult(op_c,mult(X0,X1))),
    inference(light_normalisation,[status(thm)],[c_1328,c_215,c_824]) ).

cnf(c_1778,plain,
    mult(ld(unit,X0),mult(ld(unit,X0),X1)) = mult(mult(ld(unit,X0),X0),X1),
    inference(superposition,[status(thm)],[c_54,c_216]) ).

cnf(c_1815,plain,
    mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
    inference(light_normalisation,[status(thm)],[c_1778,c_145]) ).

cnf(c_1820,plain,
    mult(mult(op_c,mult(op_c,a)),b) != mult(mult(op_c,op_c),mult(a,b)),
    inference(demodulation,[status(thm)],[c_58,c_1815]) ).

cnf(c_2119,plain,
    mult(op_c,mult(op_c,mult(a,b))) != mult(op_c,mult(op_c,mult(a,b))),
    inference(demodulation,[status(thm)],[c_1820,c_222,c_1331,c_1815]) ).

cnf(c_2120,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_2119]) ).


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