TSTP Solution File: GRP660-11 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP660-11 : TPTP v8.1.2. Released v8.1.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 : Thu Aug 31 01:01:12 EDT 2023

% Result   : Unsatisfiable 115.65s 15.66s
% Output   : CNFRefutation 115.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   62 (  62 unt;   0 nHn;   3 RR)
%            Number of literals    :   62 (  61 equ;   2 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  121 (   0 sgn)

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

cnf(c_50,plain,
    ld(X0,mult(X0,X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

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

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

cnf(c_53,plain,
    mult(mult(mult(X0,X1),X2),X0) = mult(X0,mult(X1,mult(X2,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

cnf(c_54,negated_conjecture,
    mult(x0,rd(x1,x1)) != x0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(c_122,plain,
    ld(rd(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c_51,c_50]) ).

cnf(c_124,plain,
    rd(X0,ld(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c_49,c_52]) ).

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

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

cnf(c_136,plain,
    rd(mult(X0,mult(X1,mult(X2,X0))),X0) = mult(mult(X0,X1),X2),
    inference(superposition,[status(thm)],[c_53,c_52]) ).

cnf(c_154,plain,
    mult(X0,mult(ld(mult(X1,X0),X2),X1)) = ld(X1,mult(X2,X1)),
    inference(superposition,[status(thm)],[c_130,c_50]) ).

cnf(c_173,plain,
    ld(X0,mult(mult(X1,X2),X0)) = mult(ld(X0,X1),mult(X2,X0)),
    inference(superposition,[status(thm)],[c_132,c_50]) ).

cnf(c_185,plain,
    mult(mult(X0,rd(X1,mult(X2,X0))),X2) = rd(mult(X0,X1),X0),
    inference(superposition,[status(thm)],[c_51,c_136]) ).

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

cnf(c_247,plain,
    ld(X0,ld(X1,mult(X2,X1))) = mult(ld(mult(X1,X0),X2),X1),
    inference(superposition,[status(thm)],[c_154,c_50]) ).

cnf(c_360,plain,
    mult(ld(X0,rd(X1,X2)),mult(X2,X0)) = ld(X0,mult(X1,X0)),
    inference(superposition,[status(thm)],[c_51,c_173]) ).

cnf(c_397,plain,
    mult(X0,rd(X1,mult(X2,X0))) = rd(rd(mult(X0,X1),X0),X2),
    inference(superposition,[status(thm)],[c_185,c_52]) ).

cnf(c_591,plain,
    mult(ld(mult(X0,X1),X0),X0) = ld(X1,X0),
    inference(superposition,[status(thm)],[c_50,c_247]) ).

cnf(c_594,plain,
    mult(ld(mult(X0,X1),rd(X2,X0)),X0) = ld(X1,ld(X0,X2)),
    inference(superposition,[status(thm)],[c_51,c_247]) ).

cnf(c_624,plain,
    ld(ld(X0,X1),X0) = mult(ld(X1,X0),X0),
    inference(superposition,[status(thm)],[c_49,c_591]) ).

cnf(c_700,plain,
    rd(X0,mult(ld(X1,X0),X0)) = ld(X0,X1),
    inference(superposition,[status(thm)],[c_624,c_124]) ).

cnf(c_750,plain,
    ld(X0,rd(X0,X1)) = rd(X0,mult(X1,X0)),
    inference(superposition,[status(thm)],[c_122,c_700]) ).

cnf(c_950,plain,
    rd(rd(X0,X1),rd(X0,mult(X1,X0))) = X0,
    inference(superposition,[status(thm)],[c_750,c_124]) ).

cnf(c_1143,plain,
    rd(rd(ld(X0,X1),X0),rd(ld(X0,X1),X1)) = ld(X0,X1),
    inference(superposition,[status(thm)],[c_49,c_950]) ).

cnf(c_1376,plain,
    mult(X0,rd(ld(X0,X1),mult(X2,X0))) = rd(rd(X1,X0),X2),
    inference(superposition,[status(thm)],[c_49,c_397]) ).

cnf(c_1670,plain,
    mult(rd(mult(X0,X1),mult(X0,mult(X0,X1))),X0) = ld(X1,ld(X0,mult(X0,X1))),
    inference(superposition,[status(thm)],[c_750,c_594]) ).

cnf(c_1672,plain,
    mult(ld(X0,rd(X1,rd(X0,X2))),rd(X0,X2)) = ld(X2,ld(rd(X0,X2),X1)),
    inference(superposition,[status(thm)],[c_51,c_594]) ).

cnf(c_1728,plain,
    mult(rd(mult(X0,X1),mult(X0,mult(X0,X1))),X0) = ld(X1,X1),
    inference(light_normalisation,[status(thm)],[c_1670,c_50]) ).

cnf(c_2595,plain,
    mult(X0,rd(ld(X0,X1),X2)) = rd(rd(X1,X0),rd(X2,X0)),
    inference(superposition,[status(thm)],[c_51,c_1376]) ).

cnf(c_3037,plain,
    mult(rd(X0,mult(rd(X0,X1),X0)),rd(X0,X1)) = ld(X1,X1),
    inference(superposition,[status(thm)],[c_51,c_1728]) ).

cnf(c_3685,plain,
    mult(X0,rd(ld(X0,ld(X0,X0)),ld(X0,X0))) = ld(X0,X0),
    inference(superposition,[status(thm)],[c_2595,c_1143]) ).

cnf(c_3990,plain,
    mult(rd(X0,X0),rd(X0,X0)) = ld(X0,X0),
    inference(superposition,[status(thm)],[c_51,c_3037]) ).

cnf(c_4031,plain,
    rd(ld(X0,X0),rd(X1,X0)) = rd(X1,mult(rd(X1,X0),X1)),
    inference(superposition,[status(thm)],[c_3037,c_52]) ).

cnf(c_4121,plain,
    ld(rd(X0,X0),ld(X0,X0)) = rd(X0,X0),
    inference(superposition,[status(thm)],[c_3990,c_50]) ).

cnf(c_5393,plain,
    rd(ld(X0,ld(X0,X0)),ld(X0,X0)) = ld(X0,ld(X0,X0)),
    inference(superposition,[status(thm)],[c_3685,c_50]) ).

cnf(c_5780,plain,
    mult(ld(X0,ld(X0,X0)),ld(X0,X0)) = ld(X0,ld(X0,X0)),
    inference(superposition,[status(thm)],[c_5393,c_51]) ).

cnf(c_6091,plain,
    rd(ld(X0,X0),ld(X0,ld(X0,X0))) = ld(ld(X0,X0),X0),
    inference(superposition,[status(thm)],[c_5780,c_700]) ).

cnf(c_7744,plain,
    ld(ld(X0,X0),X0) = X0,
    inference(superposition,[status(thm)],[c_6091,c_124]) ).

cnf(c_7839,plain,
    ld(ld(X0,X0),mult(X1,ld(X0,X0))) = mult(X0,mult(ld(X0,X1),ld(X0,X0))),
    inference(superposition,[status(thm)],[c_7744,c_239]) ).

cnf(c_7849,plain,
    ld(X0,X0) = rd(X0,X0),
    inference(superposition,[status(thm)],[c_7744,c_124]) ).

cnf(c_7873,plain,
    rd(rd(X0,X0),rd(X1,X0)) = rd(X1,mult(rd(X1,X0),X1)),
    inference(demodulation,[status(thm)],[c_4031,c_7849]) ).

cnf(c_7874,plain,
    ld(rd(X0,X0),rd(X0,X0)) = rd(X0,X0),
    inference(demodulation,[status(thm)],[c_4121,c_7849]) ).

cnf(c_7875,plain,
    mult(rd(X0,X0),rd(X0,X0)) = rd(X0,X0),
    inference(demodulation,[status(thm)],[c_3990,c_7849]) ).

cnf(c_7962,plain,
    mult(rd(X0,X0),mult(ld(X0,X1),X0)) = ld(X0,mult(X1,X0)),
    inference(superposition,[status(thm)],[c_7849,c_239]) ).

cnf(c_7964,plain,
    mult(X0,rd(X0,X0)) = X0,
    inference(superposition,[status(thm)],[c_7849,c_49]) ).

cnf(c_7971,plain,
    rd(X0,mult(rd(X0,X0),X0)) = rd(X0,X0),
    inference(superposition,[status(thm)],[c_7849,c_700]) ).

cnf(c_8038,plain,
    ld(rd(X0,X0),mult(X1,rd(X0,X0))) = mult(ld(rd(X0,X0),rd(X1,X0)),X0),
    inference(superposition,[status(thm)],[c_7964,c_360]) ).

cnf(c_9069,plain,
    mult(rd(X0,X0),mult(ld(rd(X0,X0),X1),rd(X0,X0))) = mult(mult(X1,rd(X0,X0)),rd(X0,X0)),
    inference(superposition,[status(thm)],[c_7875,c_132]) ).

cnf(c_17673,plain,
    mult(rd(X0,mult(rd(X0,X0),X0)),mult(ld(rd(X0,X0),X1),rd(X0,X0))) = ld(rd(X0,X0),mult(X1,rd(X0,X0))),
    inference(superposition,[status(thm)],[c_7873,c_7962]) ).

cnf(c_17773,plain,
    mult(ld(rd(X0,X0),rd(X1,X0)),X0) = mult(mult(X1,rd(X0,X0)),rd(X0,X0)),
    inference(light_normalisation,[status(thm)],[c_17673,c_7971,c_8038,c_9069]) ).

cnf(c_186801,plain,
    mult(mult(X0,rd(X1,X1)),rd(X1,X1)) = mult(X1,mult(ld(X1,X0),rd(X1,X1))),
    inference(light_normalisation,[status(thm)],[c_7839,c_7849,c_8038,c_17773]) ).

cnf(c_186810,plain,
    mult(X0,mult(ld(X0,rd(X1,rd(X0,X0))),rd(X0,X0))) = mult(X1,rd(X0,X0)),
    inference(superposition,[status(thm)],[c_51,c_186801]) ).

cnf(c_187667,plain,
    mult(X0,ld(X0,ld(rd(X0,X0),X1))) = mult(X1,rd(X0,X0)),
    inference(superposition,[status(thm)],[c_1672,c_186810]) ).

cnf(c_189022,plain,
    mult(mult(rd(X0,X0),X1),rd(X0,X0)) = mult(X0,ld(X0,X1)),
    inference(superposition,[status(thm)],[c_50,c_187667]) ).

cnf(c_189061,plain,
    ld(rd(X0,X0),X1) = mult(X1,rd(X0,X0)),
    inference(superposition,[status(thm)],[c_187667,c_49]) ).

cnf(c_189336,plain,
    mult(mult(rd(X0,X0),X1),rd(X0,X0)) = X1,
    inference(light_normalisation,[status(thm)],[c_189022,c_49]) ).

cnf(c_189801,plain,
    mult(rd(X0,X0),mult(X1,rd(X0,X0))) = X1,
    inference(superposition,[status(thm)],[c_189061,c_49]) ).

cnf(c_190426,plain,
    mult(ld(rd(X0,X0),rd(X0,X0)),mult(X1,rd(X0,X0))) = ld(rd(X0,X0),X1),
    inference(superposition,[status(thm)],[c_189336,c_173]) ).

cnf(c_190575,plain,
    mult(X0,rd(X1,X1)) = X0,
    inference(light_normalisation,[status(thm)],[c_190426,c_7874,c_189061,c_189801]) ).

cnf(c_190681,plain,
    x0 != x0,
    inference(demodulation,[status(thm)],[c_54,c_190575]) ).

cnf(c_190743,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_190681]) ).


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