TSTP Solution File: GRP094-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP094-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n004.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 00:57:29 EDT 2023

% Result   : Unsatisfiable 2.65s 1.17s
% Output   : CNFRefutation 2.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   50 (  45 unt;   0 nHn;  10 RR)
%            Number of literals    :   61 (  60 equ;  19 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :   76 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    divide(divide(identity,divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

cnf(c_50,plain,
    divide(X0,divide(identity,X1)) = multiply(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

cnf(c_51,plain,
    divide(identity,X0) = inverse(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).

cnf(c_52,plain,
    divide(X0,X0) = identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).

cnf(c_53,negated_conjecture,
    ( multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | multiply(a4,b4) != multiply(b4,a4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).

cnf(c_74,plain,
    divide(X0,inverse(X1)) = multiply(X0,X1),
    inference(demodulation,[status(thm)],[c_50,c_51]) ).

cnf(c_75,plain,
    divide(inverse(divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
    inference(demodulation,[status(thm)],[c_49,c_51]) ).

cnf(c_140,plain,
    inverse(identity) = identity,
    inference(superposition,[status(thm)],[c_52,c_51]) ).

cnf(c_144,plain,
    divide(X0,identity) = multiply(X0,identity),
    inference(superposition,[status(thm)],[c_140,c_74]) ).

cnf(c_145,plain,
    multiply(identity,X0) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c_74,c_51]) ).

cnf(c_146,plain,
    multiply(inverse(X0),X0) = identity,
    inference(superposition,[status(thm)],[c_74,c_52]) ).

cnf(c_147,plain,
    ( multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(inverse(b1),b1) != identity
    | multiply(a4,b4) != multiply(b4,a4) ),
    inference(demodulation,[status(thm)],[c_53,c_146]) ).

cnf(c_148,plain,
    ( multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(a4,b4) != multiply(b4,a4) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_147,c_146]) ).

cnf(c_155,plain,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(identity,a2) != a2
    | multiply(a4,b4) != multiply(b4,a4) ),
    inference(demodulation,[status(thm)],[c_148,c_146]) ).

cnf(c_161,plain,
    divide(inverse(identity),divide(divide(X0,X1),X0)) = X1,
    inference(superposition,[status(thm)],[c_52,c_75]) ).

cnf(c_167,plain,
    divide(inverse(divide(X0,X1)),divide(identity,X0)) = X1,
    inference(superposition,[status(thm)],[c_52,c_75]) ).

cnf(c_172,plain,
    divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
    inference(light_normalisation,[status(thm)],[c_167,c_51]) ).

cnf(c_173,plain,
    divide(identity,divide(divide(X0,X1),X0)) = X1,
    inference(light_normalisation,[status(thm)],[c_161,c_140]) ).

cnf(c_224,plain,
    multiply(inverse(divide(X0,X1)),X0) = X1,
    inference(demodulation,[status(thm)],[c_172,c_74]) ).

cnf(c_225,plain,
    multiply(inverse(inverse(X0)),identity) = X0,
    inference(superposition,[status(thm)],[c_51,c_224]) ).

cnf(c_226,plain,
    multiply(inverse(identity),X0) = X0,
    inference(superposition,[status(thm)],[c_52,c_224]) ).

cnf(c_230,plain,
    multiply(identity,X0) = X0,
    inference(light_normalisation,[status(thm)],[c_226,c_140]) ).

cnf(c_231,plain,
    multiply(multiply(identity,X0),identity) = X0,
    inference(light_normalisation,[status(thm)],[c_225,c_145]) ).

cnf(c_232,plain,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(a4,b4) != multiply(b4,a4) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_155,c_230]) ).

cnf(c_233,plain,
    inverse(inverse(X0)) = X0,
    inference(demodulation,[status(thm)],[c_145,c_230]) ).

cnf(c_263,plain,
    multiply(X0,identity) = X0,
    inference(light_normalisation,[status(thm)],[c_231,c_230]) ).

cnf(c_264,plain,
    divide(X0,identity) = X0,
    inference(demodulation,[status(thm)],[c_144,c_263]) ).

cnf(c_275,plain,
    divide(inverse(divide(identity,X0)),divide(X0,X1)) = X1,
    inference(superposition,[status(thm)],[c_264,c_75]) ).

cnf(c_277,plain,
    divide(X0,divide(X0,X1)) = X1,
    inference(light_normalisation,[status(thm)],[c_275,c_51,c_233]) ).

cnf(c_294,plain,
    divide(inverse(divide(X0,X1)),X2) = divide(divide(X1,X2),X0),
    inference(superposition,[status(thm)],[c_75,c_277]) ).

cnf(c_296,plain,
    multiply(inverse(X0),X1) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_277,c_224]) ).

cnf(c_303,plain,
    divide(divide(X0,divide(divide(X0,X1),X2)),X2) = X1,
    inference(demodulation,[status(thm)],[c_75,c_294]) ).

cnf(c_355,plain,
    divide(X0,inverse(X1)) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_233,c_296]) ).

cnf(c_437,plain,
    inverse(divide(divide(X0,X1),X0)) = X1,
    inference(demodulation,[status(thm)],[c_173,c_51]) ).

cnf(c_444,plain,
    inverse(divide(X0,X1)) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_277,c_437]) ).

cnf(c_447,plain,
    divide(divide(X0,X1),X0) = inverse(X1),
    inference(superposition,[status(thm)],[c_437,c_233]) ).

cnf(c_546,plain,
    multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_355,c_74]) ).

cnf(c_550,plain,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(backward_subsumption_resolution,[status(thm)],[c_232,c_546]) ).

cnf(c_570,plain,
    multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
    inference(demodulation,[status(thm)],[c_550,c_546]) ).

cnf(c_580,plain,
    divide(X0,divide(X1,X2)) = multiply(divide(X2,X1),X0),
    inference(superposition,[status(thm)],[c_444,c_355]) ).

cnf(c_584,plain,
    multiply(divide(X0,X1),X1) = X0,
    inference(demodulation,[status(thm)],[c_277,c_580]) ).

cnf(c_591,plain,
    multiply(X0,divide(X1,X0)) = X1,
    inference(demodulation,[status(thm)],[c_584,c_546]) ).

cnf(c_627,plain,
    divide(multiply(X0,X1),X1) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c_355,c_447]) ).

cnf(c_639,plain,
    divide(multiply(X0,X1),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_627,c_233]) ).

cnf(c_651,plain,
    divide(multiply(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c_546,c_639]) ).

cnf(c_1100,plain,
    divide(multiply(X0,multiply(divide(X1,X0),X2)),X2) = X1,
    inference(demodulation,[status(thm)],[c_303,c_546,c_580]) ).

cnf(c_1121,plain,
    divide(multiply(X0,multiply(X1,X2)),X2) = multiply(X0,X1),
    inference(superposition,[status(thm)],[c_651,c_1100]) ).

cnf(c_1746,plain,
    multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X2,X0)),
    inference(superposition,[status(thm)],[c_1121,c_591]) ).

cnf(c_1752,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
    inference(demodulation,[status(thm)],[c_570,c_1746]) ).

cnf(c_1753,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_1752]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP094-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.10/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n004.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 01:32:37 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.65/1.17  % SZS status Started for theBenchmark.p
% 2.65/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 2.65/1.17  
% 2.65/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.65/1.17  
% 2.65/1.17  ------  iProver source info
% 2.65/1.17  
% 2.65/1.17  git: date: 2023-05-31 18:12:56 +0000
% 2.65/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.65/1.17  git: non_committed_changes: false
% 2.65/1.17  git: last_make_outside_of_git: false
% 2.65/1.17  
% 2.65/1.17  ------ Parsing...successful
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  ------ Preprocessing... sup_sim: 2  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.65/1.17  
% 2.65/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.65/1.17  
% 2.65/1.17  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.65/1.17  ------ Proving...
% 2.65/1.17  ------ Problem Properties 
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  clauses                                 5
% 2.65/1.17  conjectures                             1
% 2.65/1.17  EPR                                     0
% 2.65/1.17  Horn                                    5
% 2.65/1.17  unary                                   4
% 2.65/1.17  binary                                  0
% 2.65/1.17  lits                                    8
% 2.65/1.17  lits eq                                 8
% 2.65/1.17  fd_pure                                 0
% 2.65/1.17  fd_pseudo                               0
% 2.65/1.17  fd_cond                                 0
% 2.65/1.17  fd_pseudo_cond                          0
% 2.65/1.17  AC symbols                              0
% 2.65/1.17  
% 2.65/1.17  ------ Schedule dynamic 5 is on 
% 2.65/1.17  
% 2.65/1.17  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  ------ 
% 2.65/1.17  Current options:
% 2.65/1.17  ------ 
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  ------ Proving...
% 2.65/1.17  
% 2.65/1.17  
% 2.65/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 2.65/1.17  
% 2.65/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.65/1.17  
% 2.65/1.17  
%------------------------------------------------------------------------------