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

View Problem - Process Solution

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

% Computer : n015.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:13 EDT 2023

% Result   : Unsatisfiable 3.99s 1.18s
% Output   : CNFRefutation 3.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   52 (  49 unt;   0 nHn;   5 RR)
%            Number of literals    :   57 (  56 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  107 (   0 sgn)

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

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

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

cnf(c_52,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) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).

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

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

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

cnf(c_129,plain,
    divide(inverse(divide(X0,X0)),X1) = inverse(X1),
    inference(superposition,[status(thm)],[c_51,c_51]) ).

cnf(c_133,plain,
    divide(multiply(inverse(X0),X0),X1) = inverse(X1),
    inference(superposition,[status(thm)],[c_68,c_51]) ).

cnf(c_134,plain,
    multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
    inference(superposition,[status(thm)],[c_68,c_51]) ).

cnf(c_143,plain,
    multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
    inference(superposition,[status(thm)],[c_129,c_68]) ).

cnf(c_151,plain,
    multiply(multiply(inverse(X0),X0),X1) = inverse(inverse(X1)),
    inference(superposition,[status(thm)],[c_133,c_68]) ).

cnf(c_152,plain,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | inverse(inverse(a2)) != a2 ),
    inference(demodulation,[status(thm)],[c_52,c_151]) ).

cnf(c_185,plain,
    divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
    inference(superposition,[status(thm)],[c_51,c_70]) ).

cnf(c_188,plain,
    divide(X0,divide(inverse(X1),divide(inverse(X0),X1))) = divide(X2,X2),
    inference(superposition,[status(thm)],[c_129,c_70]) ).

cnf(c_192,plain,
    divide(divide(X0,X0),divide(divide(inverse(X1),X2),inverse(X2))) = X1,
    inference(superposition,[status(thm)],[c_129,c_70]) ).

cnf(c_297,plain,
    multiply(X0,multiply(inverse(X0),X1)) = X1,
    inference(demodulation,[status(thm)],[c_185,c_68]) ).

cnf(c_303,plain,
    inverse(inverse(multiply(inverse(divide(X0,X0)),X1))) = X1,
    inference(superposition,[status(thm)],[c_297,c_134]) ).

cnf(c_306,plain,
    multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
    inference(superposition,[status(thm)],[c_297,c_297]) ).

cnf(c_307,plain,
    inverse(inverse(inverse(inverse(X0)))) = X0,
    inference(light_normalisation,[status(thm)],[c_303,c_143]) ).

cnf(c_333,plain,
    divide(inverse(inverse(inverse(X0))),divide(divide(inverse(X1),X2),divide(X0,X2))) = X1,
    inference(superposition,[status(thm)],[c_307,c_70]) ).

cnf(c_337,plain,
    multiply(X0,inverse(inverse(inverse(X1)))) = divide(X0,X1),
    inference(superposition,[status(thm)],[c_307,c_68]) ).

cnf(c_360,plain,
    multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(superposition,[status(thm)],[c_306,c_297]) ).

cnf(c_453,plain,
    multiply(X0,inverse(inverse(inverse(X1)))) = divide(inverse(inverse(X0)),X1),
    inference(superposition,[status(thm)],[c_337,c_306]) ).

cnf(c_455,plain,
    divide(inverse(inverse(X0)),X1) = divide(X0,X1),
    inference(light_normalisation,[status(thm)],[c_453,c_337]) ).

cnf(c_611,plain,
    divide(X0,X0) = divide(X1,X1),
    inference(superposition,[status(thm)],[c_188,c_188]) ).

cnf(c_730,plain,
    inverse(multiply(divide(inverse(X0),X1),X1)) = X0,
    inference(demodulation,[status(thm)],[c_192,c_51,c_68]) ).

cnf(c_734,plain,
    inverse(multiply(multiply(inverse(X0),X1),inverse(X1))) = X0,
    inference(superposition,[status(thm)],[c_68,c_730]) ).

cnf(c_739,plain,
    inverse(multiply(divide(X0,X1),X1)) = inverse(X0),
    inference(superposition,[status(thm)],[c_455,c_730]) ).

cnf(c_758,plain,
    inverse(inverse(X0)) = X0,
    inference(demodulation,[status(thm)],[c_730,c_739]) ).

cnf(c_759,plain,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_152,c_758]) ).

cnf(c_764,plain,
    multiply(X0,inverse(X1)) = divide(X0,X1),
    inference(demodulation,[status(thm)],[c_337,c_758]) ).

cnf(c_840,plain,
    inverse(divide(multiply(inverse(X0),X1),X1)) = X0,
    inference(demodulation,[status(thm)],[c_734,c_764]) ).

cnf(c_844,plain,
    inverse(divide(X0,multiply(X1,X0))) = X1,
    inference(superposition,[status(thm)],[c_360,c_840]) ).

cnf(c_928,plain,
    multiply(inverse(X0),X0) = divide(X1,X1),
    inference(superposition,[status(thm)],[c_611,c_68]) ).

cnf(c_1045,plain,
    divide(X0,multiply(X1,X0)) = inverse(X1),
    inference(superposition,[status(thm)],[c_844,c_758]) ).

cnf(c_1310,plain,
    multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
    inference(superposition,[status(thm)],[c_928,c_68]) ).

cnf(c_1319,plain,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(backward_subsumption_resolution,[status(thm)],[c_759,c_1310]) ).

cnf(c_1468,plain,
    divide(multiply(X0,X1),X1) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c_360,c_1045]) ).

cnf(c_1478,plain,
    divide(multiply(X0,X1),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_1468,c_758]) ).

cnf(c_1531,plain,
    multiply(multiply(X0,inverse(X1)),X1) = X0,
    inference(superposition,[status(thm)],[c_1478,c_68]) ).

cnf(c_1532,plain,
    multiply(divide(X0,X1),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_1531,c_764]) ).

cnf(c_1737,plain,
    inverse(divide(X0,X1)) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_1532,c_1045]) ).

cnf(c_1860,plain,
    divide(inverse(X0),X1) = inverse(multiply(X1,X0)),
    inference(superposition,[status(thm)],[c_68,c_1737]) ).

cnf(c_1916,plain,
    divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X2,X1)),
    inference(superposition,[status(thm)],[c_1860,c_68]) ).

cnf(c_1949,plain,
    divide(X0,divide(divide(inverse(X1),X2),X3)) = multiply(X0,multiply(X3,multiply(X2,X1))),
    inference(superposition,[status(thm)],[c_1860,c_1916]) ).

cnf(c_2502,plain,
    divide(inverse(X0),divide(divide(inverse(X1),X2),divide(X0,X2))) = X1,
    inference(light_normalisation,[status(thm)],[c_333,c_758]) ).

cnf(c_2503,plain,
    multiply(inverse(X0),multiply(divide(X0,X1),multiply(X1,X2))) = X2,
    inference(demodulation,[status(thm)],[c_2502,c_1949]) ).

cnf(c_2532,plain,
    multiply(divide(X0,X1),multiply(X1,X2)) = multiply(inverse(inverse(X0)),X2),
    inference(superposition,[status(thm)],[c_2503,c_360]) ).

cnf(c_2541,plain,
    multiply(divide(X0,X1),multiply(X1,X2)) = multiply(X0,X2),
    inference(light_normalisation,[status(thm)],[c_2532,c_758]) ).

cnf(c_3191,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(superposition,[status(thm)],[c_1478,c_2541]) ).

cnf(c_3226,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_1319,c_3191]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP063-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n015.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 : Mon Aug 28 20:22:10 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
% 3.99/1.18  % SZS status Started for theBenchmark.p
% 3.99/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.18  
% 3.99/1.18  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.99/1.18  
% 3.99/1.18  ------  iProver source info
% 3.99/1.18  
% 3.99/1.18  git: date: 2023-05-31 18:12:56 +0000
% 3.99/1.18  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.99/1.18  git: non_committed_changes: false
% 3.99/1.18  git: last_make_outside_of_git: false
% 3.99/1.18  
% 3.99/1.18  ------ Parsing...successful
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  ------ Preprocessing... sup_sim: 2  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.99/1.18  
% 3.99/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.99/1.18  
% 3.99/1.18  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.99/1.18  ------ Proving...
% 3.99/1.18  ------ Problem Properties 
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  clauses                                 4
% 3.99/1.18  conjectures                             1
% 3.99/1.18  EPR                                     0
% 3.99/1.18  Horn                                    4
% 3.99/1.18  unary                                   3
% 3.99/1.18  binary                                  0
% 3.99/1.18  lits                                    6
% 3.99/1.18  lits eq                                 6
% 3.99/1.18  fd_pure                                 0
% 3.99/1.18  fd_pseudo                               0
% 3.99/1.18  fd_cond                                 0
% 3.99/1.18  fd_pseudo_cond                          0
% 3.99/1.18  AC symbols                              0
% 3.99/1.18  
% 3.99/1.18  ------ Schedule dynamic 5 is on 
% 3.99/1.18  
% 3.99/1.18  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  ------ 
% 3.99/1.18  Current options:
% 3.99/1.18  ------ 
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  ------ Proving...
% 3.99/1.18  
% 3.99/1.18  
% 3.99/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.18  
% 3.99/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.18  
% 3.99/1.18  
%------------------------------------------------------------------------------