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

View Problem - Process Solution

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

% Computer : n008.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:23:19 EDT 2024

% Result   : Unsatisfiable 3.41s 1.10s
% Output   : CNFRefutation 3.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;   6 RR)
%            Number of literals    :   24 (  23 equ;   5 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   :   48 (   0 sgn)

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

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

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

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

cnf(c_53,plain,
    mult(mult(X0,mult(X1,X2)),X0) = mult(mult(X0,X1),mult(X2,X0)),
    file('/export/starexec/sandbox/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/sandbox/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_131,plain,
    ld(rd(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c_51,c_50]) ).

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

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

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

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

cnf(c_325,plain,
    mult(X0,mult(X1,ld(X1,X2))) = rd(mult(mult(X0,X2),X0),X0),
    inference(superposition,[status(thm)],[c_141,c_144]) ).

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

cnf(c_637,plain,
    mult(X0,rd(X1,rd(X0,X0))) = mult(X0,X1),
    inference(demodulation,[status(thm)],[c_325,c_49,c_557]) ).

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

cnf(c_650,plain,
    rd(X0,rd(X1,X1)) = X0,
    inference(light_normalisation,[status(thm)],[c_642,c_50]) ).

cnf(c_699,plain,
    ld(X0,X0) = rd(X1,X1),
    inference(superposition,[status(thm)],[c_650,c_131]) ).

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

cnf(c_718,plain,
    mult(ld(X0,X0),X1) = X1,
    inference(superposition,[status(thm)],[c_699,c_51]) ).

cnf(c_772,plain,
    tuple(mult(rd(X0,X0),x1(rd(X0,X0))),x1_2(rd(X0,X0))) != tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))),
    inference(superposition,[status(thm)],[c_700,c_79]) ).

cnf(c_836,plain,
    tuple(mult(ld(X0,X0),x1(ld(X0,X0))),x1_2(ld(X0,X0))) != tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))),
    inference(superposition,[status(thm)],[c_699,c_772]) ).

cnf(c_839,plain,
    tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))) != tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))),
    inference(demodulation,[status(thm)],[c_836,c_718]) ).

cnf(c_840,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_839]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : GRP656-10 : TPTP v8.1.2. Released v8.1.0.
% 0.06/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n008.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:44:27 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  Running UEQ theorem proving
% 0.17/0.43  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.41/1.10  % SZS status Started for theBenchmark.p
% 3.41/1.10  % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.10  
% 3.41/1.10  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.41/1.10  
% 3.41/1.10  ------  iProver source info
% 3.41/1.10  
% 3.41/1.10  git: date: 2024-05-02 19:28:25 +0000
% 3.41/1.10  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.41/1.10  git: non_committed_changes: false
% 3.41/1.10  
% 3.41/1.10  ------ Parsing...successful
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.41/1.10  
% 3.41/1.10  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.41/1.10  
% 3.41/1.10  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.41/1.10  ------ Proving...
% 3.41/1.10  ------ Problem Properties 
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  clauses                                 6
% 3.41/1.10  conjectures                             1
% 3.41/1.10  EPR                                     0
% 3.41/1.10  Horn                                    6
% 3.41/1.10  unary                                   6
% 3.41/1.10  binary                                  0
% 3.41/1.10  lits                                    6
% 3.41/1.10  lits eq                                 6
% 3.41/1.10  fd_pure                                 0
% 3.41/1.10  fd_pseudo                               0
% 3.41/1.10  fd_cond                                 0
% 3.41/1.10  fd_pseudo_cond                          0
% 3.41/1.10  AC symbols                              0
% 3.41/1.10  
% 3.41/1.10  ------ Input Options Time Limit: Unbounded
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  ------ 
% 3.41/1.10  Current options:
% 3.41/1.10  ------ 
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  ------ Proving...
% 3.41/1.10  
% 3.41/1.10  
% 3.41/1.10  % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.10  
% 3.41/1.10  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.11  
% 3.41/1.11  
%------------------------------------------------------------------------------