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

View Problem - Process Solution

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

% Computer : n032.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:35 EDT 2024

% Result   : Unsatisfiable 1.28s 1.11s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   5 RR)
%            Number of literals    :   28 (  27 equ;   4 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   :   63 (   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_79,negated_conjecture,
    tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)),
    inference(demodulation,[status(thm)],[c_54]) ).

cnf(c_140,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_140]) ).

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

cnf(c_281,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_323,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_585,plain,
    mult(rd(X0,mult(X0,X0)),X0) = rd(X1,X1),
    inference(superposition,[status(thm)],[c_49,c_281]) ).

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

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

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

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

cnf(c_791,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_735,c_79]) ).

cnf(c_899,plain,
    ld(rd(rd(X0,X0),X1),rd(X2,X2)) = X1,
    inference(superposition,[status(thm)],[c_665,c_666]) ).

cnf(c_1617,plain,
    ld(rd(X0,X0),rd(X1,X1)) = rd(X2,X2),
    inference(superposition,[status(thm)],[c_679,c_899]) ).

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

cnf(c_2546,plain,
    mult(rd(X0,X0),ld(X0,X0)) = rd(X1,X1),
    inference(demodulation,[status(thm)],[c_585,c_2540]) ).

cnf(c_4081,plain,
    mult(rd(X0,X0),ld(X1,X1)) = rd(X2,X2),
    inference(superposition,[status(thm)],[c_679,c_2546]) ).

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

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

cnf(c_5441,plain,
    mult(X0,rd(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_1617,c_5366]) ).

cnf(c_5540,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_791,c_5441]) ).

cnf(c_5541,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_5540]) ).


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