TSTP Solution File: GRP658-10 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP658-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n003.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:11 EDT 2023

% Result   : Unsatisfiable 0.45s 1.16s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   27 (  27 unt;   0 nHn;   4 RR)
%            Number of literals    :   27 (  26 equ;   3 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    :    6 (   6 usr;   0 con; 1-2 aty)
%            Number of variables   :   62 (   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(X0,mult(X1,X1)),X2) = mult(mult(X0,X1),mult(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

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

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

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

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

cnf(c_283,plain,
    mult(rd(X0,mult(X1,X1)),X1) = rd(mult(X0,ld(X1,X2)),X2),
    inference(superposition,[status(thm)],[c_160,c_52]) ).

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

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

cnf(c_675,plain,
    rd(rd(X0,X0),X1) = rd(X1,mult(X1,X1)),
    inference(superposition,[status(thm)],[c_593,c_52]) ).

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

cnf(c_689,plain,
    rd(X0,X0) = rd(X1,X1),
    inference(superposition,[status(thm)],[c_593,c_593]) ).

cnf(c_746,plain,
    mult(rd(X0,X0),X1) = X1,
    inference(superposition,[status(thm)],[c_689,c_51]) ).

cnf(c_802,plain,
    tuple(x1(rd(X0,X0)),mult(x1_2(rd(X0,X0)),rd(X0,X0))) != tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))),
    inference(superposition,[status(thm)],[c_746,c_54]) ).

cnf(c_911,plain,
    ld(rd(rd(X0,X0),X1),rd(X2,X2)) = X1,
    inference(superposition,[status(thm)],[c_675,c_676]) ).

cnf(c_1639,plain,
    ld(rd(X0,X0),rd(X1,X1)) = rd(X2,X2),
    inference(superposition,[status(thm)],[c_689,c_911]) ).

cnf(c_2574,plain,
    mult(rd(X0,mult(X1,X2)),X3) = mult(rd(X0,X2),ld(X1,X3)),
    inference(superposition,[status(thm)],[c_326,c_160]) ).

cnf(c_2581,plain,
    mult(rd(X0,X0),ld(X0,X0)) = rd(X1,X1),
    inference(demodulation,[status(thm)],[c_593,c_2574]) ).

cnf(c_4153,plain,
    mult(rd(X0,X0),ld(X1,X1)) = rd(X2,X2),
    inference(superposition,[status(thm)],[c_689,c_2581]) ).

cnf(c_5011,plain,
    ld(rd(X0,X0),rd(X1,X1)) = ld(X2,X2),
    inference(superposition,[status(thm)],[c_4153,c_50]) ).

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

cnf(c_5539,plain,
    mult(X0,rd(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_1639,c_5463]) ).

cnf(c_5641,plain,
    tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))) != tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))),
    inference(demodulation,[status(thm)],[c_802,c_5539]) ).

cnf(c_5642,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_5641]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP658-10 : TPTP v8.1.2. Released v8.1.0.
% 0.04/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n003.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 : Tue Aug 29 00:10:10 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running UEQ theorem proving
% 0.19/0.47  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
% 0.45/1.16  % SZS status Started for theBenchmark.p
% 0.45/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.16  
% 0.45/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.16  
% 0.45/1.16  ------  iProver source info
% 0.45/1.16  
% 0.45/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.16  git: non_committed_changes: false
% 0.45/1.16  git: last_make_outside_of_git: false
% 0.45/1.16  
% 0.45/1.16  ------ Parsing...successful
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.45/1.16  
% 0.45/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.45/1.16  
% 0.45/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.45/1.16  ------ Proving...
% 0.45/1.16  ------ Problem Properties 
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  clauses                                 6
% 0.45/1.16  conjectures                             1
% 0.45/1.16  EPR                                     0
% 0.45/1.16  Horn                                    6
% 0.45/1.16  unary                                   6
% 0.45/1.16  binary                                  0
% 0.45/1.16  lits                                    6
% 0.45/1.16  lits eq                                 6
% 0.45/1.16  fd_pure                                 0
% 0.45/1.16  fd_pseudo                               0
% 0.45/1.16  fd_cond                                 0
% 0.45/1.16  fd_pseudo_cond                          0
% 0.45/1.16  AC symbols                              0
% 0.45/1.16  
% 0.45/1.16  ------ Input Options Time Limit: Unbounded
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  ------ 
% 0.45/1.16  Current options:
% 0.45/1.16  ------ 
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  ------ Proving...
% 0.45/1.16  
% 0.45/1.16  
% 0.45/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.16  
% 0.45/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.16  
% 0.45/1.16  
%------------------------------------------------------------------------------