TSTP Solution File: GRP555-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : GRP555-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n023.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:22:54 EDT 2024

% Result   : Unsatisfiable 3.78s 1.13s
% Output   : CNFRefutation 3.78s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

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

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

cnf(c_51,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).

cnf(c_60,plain,
    divide(multiply(X0,divide(X1,divide(X0,X2))),X2) = X1,
    inference(demodulation,[status(thm)],[c_49,c_50]) ).

cnf(c_66,plain,
    multiply(a3,b3) = sP0_iProver_def,
    definition ).

cnf(c_67,plain,
    multiply(sP0_iProver_def,c3) = sP1_iProver_def,
    definition ).

cnf(c_68,plain,
    multiply(b3,c3) = sP2_iProver_def,
    definition ).

cnf(c_69,plain,
    multiply(a3,sP2_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_70,negated_conjecture,
    sP1_iProver_def != sP3_iProver_def,
    inference(demodulation,[status(thm)],[c_51,c_68,c_69,c_66,c_67]) ).

cnf(c_71,plain,
    X0 = X0,
    theory(equality) ).

cnf(c_72,plain,
    ( X0 != X1
    | X2 != X1
    | X2 = X0 ),
    theory(equality) ).

cnf(c_114,plain,
    divide(multiply(X0,divide(X1,multiply(X0,X2))),inverse(X2)) = X1,
    inference(superposition,[status(thm)],[c_50,c_60]) ).

cnf(c_115,plain,
    divide(multiply(multiply(X0,divide(X1,divide(X0,X2))),divide(X3,X1)),X2) = X3,
    inference(superposition,[status(thm)],[c_60,c_60]) ).

cnf(c_117,plain,
    multiply(X0,divide(X1,divide(X0,divide(X2,X3)))) = divide(multiply(X2,X1),X3),
    inference(superposition,[status(thm)],[c_60,c_60]) ).

cnf(c_123,plain,
    multiply(multiply(X0,divide(X1,multiply(X0,X2))),X2) = X1,
    inference(demodulation,[status(thm)],[c_114,c_50]) ).

cnf(c_125,plain,
    multiply(multiply(a3,divide(X0,sP0_iProver_def)),b3) = X0,
    inference(superposition,[status(thm)],[c_66,c_123]) ).

cnf(c_144,plain,
    divide(multiply(multiply(X0,divide(X1,divide(X0,X2))),X3),X2) = multiply(X4,divide(X3,divide(X4,X1))),
    inference(superposition,[status(thm)],[c_60,c_115]) ).

cnf(c_166,plain,
    ( sP1_iProver_def != X0
    | sP3_iProver_def != X0
    | sP1_iProver_def = sP3_iProver_def ),
    inference(instantiation,[status(thm)],[c_72]) ).

cnf(c_169,plain,
    ( X0 != X1
    | sP3_iProver_def != X1
    | sP3_iProver_def = X0 ),
    inference(instantiation,[status(thm)],[c_72]) ).

cnf(c_170,plain,
    ( X0 != sP3_iProver_def
    | sP3_iProver_def != sP3_iProver_def
    | sP3_iProver_def = X0 ),
    inference(instantiation,[status(thm)],[c_169]) ).

cnf(c_171,plain,
    sP3_iProver_def = sP3_iProver_def,
    inference(instantiation,[status(thm)],[c_71]) ).

cnf(c_183,plain,
    ( multiply(a3,sP2_iProver_def) != sP3_iProver_def
    | sP3_iProver_def != sP3_iProver_def
    | sP3_iProver_def = multiply(a3,sP2_iProver_def) ),
    inference(instantiation,[status(thm)],[c_170]) ).

cnf(c_185,plain,
    multiply(X0,divide(X1,divide(X0,sP0_iProver_def))) = multiply(multiply(a3,X1),b3),
    inference(superposition,[status(thm)],[c_60,c_125]) ).

cnf(c_197,plain,
    ( sP1_iProver_def != multiply(a3,sP2_iProver_def)
    | sP3_iProver_def != multiply(a3,sP2_iProver_def)
    | sP1_iProver_def = sP3_iProver_def ),
    inference(instantiation,[status(thm)],[c_166]) ).

cnf(c_236,plain,
    divide(multiply(multiply(a3,X0),b3),sP0_iProver_def) = X0,
    inference(superposition,[status(thm)],[c_185,c_60]) ).

cnf(c_245,plain,
    ( multiply(a3,sP2_iProver_def) != X0
    | sP1_iProver_def != X0
    | sP1_iProver_def = multiply(a3,sP2_iProver_def) ),
    inference(instantiation,[status(thm)],[c_72]) ).

cnf(c_371,plain,
    ( multiply(a3,sP2_iProver_def) != sP1_iProver_def
    | sP1_iProver_def != sP1_iProver_def
    | sP1_iProver_def = multiply(a3,sP2_iProver_def) ),
    inference(instantiation,[status(thm)],[c_245]) ).

cnf(c_372,plain,
    sP1_iProver_def = sP1_iProver_def,
    inference(instantiation,[status(thm)],[c_71]) ).

cnf(c_438,plain,
    divide(divide(multiply(X0,X1),X2),divide(X0,X2)) = X1,
    inference(superposition,[status(thm)],[c_117,c_60]) ).

cnf(c_470,plain,
    divide(X0,divide(multiply(a3,X0),sP0_iProver_def)) = b3,
    inference(superposition,[status(thm)],[c_236,c_438]) ).

cnf(c_798,plain,
    divide(multiply(multiply(a3,X0),X1),sP0_iProver_def) = multiply(X0,divide(X1,b3)),
    inference(superposition,[status(thm)],[c_470,c_117]) ).

cnf(c_810,plain,
    multiply(X0,divide(b3,b3)) = X0,
    inference(demodulation,[status(thm)],[c_236,c_798]) ).

cnf(c_860,plain,
    multiply(X0,divide(X1,multiply(X0,divide(b3,b3)))) = X1,
    inference(superposition,[status(thm)],[c_810,c_123]) ).

cnf(c_865,plain,
    multiply(X0,divide(X1,X0)) = X1,
    inference(light_normalisation,[status(thm)],[c_860,c_810]) ).

cnf(c_902,plain,
    multiply(X0,divide(X1,divide(X0,X2))) = multiply(X2,X1),
    inference(superposition,[status(thm)],[c_60,c_865]) ).

cnf(c_1991,plain,
    divide(multiply(multiply(X0,X1),X2),X0) = multiply(X3,divide(X2,divide(X3,X1))),
    inference(light_normalisation,[status(thm)],[c_144,c_902]) ).

cnf(c_1992,plain,
    divide(multiply(multiply(X0,X1),X2),X0) = multiply(X1,X2),
    inference(demodulation,[status(thm)],[c_1991,c_902]) ).

cnf(c_2004,plain,
    divide(multiply(sP0_iProver_def,X0),a3) = multiply(b3,X0),
    inference(superposition,[status(thm)],[c_66,c_1992]) ).

cnf(c_2148,plain,
    divide(sP1_iProver_def,a3) = multiply(b3,c3),
    inference(superposition,[status(thm)],[c_67,c_2004]) ).

cnf(c_2152,plain,
    divide(sP1_iProver_def,a3) = sP2_iProver_def,
    inference(light_normalisation,[status(thm)],[c_2148,c_68]) ).

cnf(c_2326,plain,
    multiply(a3,sP2_iProver_def) = sP1_iProver_def,
    inference(superposition,[status(thm)],[c_2152,c_865]) ).

cnf(c_2327,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2326,c_372,c_371,c_197,c_183,c_171,c_70,c_69]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP555-1 : TPTP v8.1.2. Released v2.6.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.32  % Computer : n023.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Fri May  3 00:15:09 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.17/0.44  Running UEQ theorem proving
% 0.17/0.44  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.78/1.13  % SZS status Started for theBenchmark.p
% 3.78/1.13  % SZS status Unsatisfiable for theBenchmark.p
% 3.78/1.13  
% 3.78/1.13  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.78/1.13  
% 3.78/1.13  ------  iProver source info
% 3.78/1.13  
% 3.78/1.13  git: date: 2024-05-02 19:28:25 +0000
% 3.78/1.13  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.78/1.13  git: non_committed_changes: false
% 3.78/1.13  
% 3.78/1.13  ------ Parsing...successful
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.78/1.13  
% 3.78/1.13  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.78/1.13  
% 3.78/1.13  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.78/1.13  ------ Proving...
% 3.78/1.13  ------ Problem Properties 
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  clauses                                 7
% 3.78/1.13  conjectures                             1
% 3.78/1.13  EPR                                     1
% 3.78/1.13  Horn                                    7
% 3.78/1.13  unary                                   7
% 3.78/1.13  binary                                  0
% 3.78/1.13  lits                                    7
% 3.78/1.13  lits eq                                 7
% 3.78/1.13  fd_pure                                 0
% 3.78/1.13  fd_pseudo                               0
% 3.78/1.13  fd_cond                                 0
% 3.78/1.13  fd_pseudo_cond                          0
% 3.78/1.13  AC symbols                              0
% 3.78/1.13  
% 3.78/1.13  ------ Input Options Time Limit: Unbounded
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  ------ 
% 3.78/1.13  Current options:
% 3.78/1.13  ------ 
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  ------ Proving...
% 3.78/1.13  
% 3.78/1.13  
% 3.78/1.13  % SZS status Unsatisfiable for theBenchmark.p
% 3.78/1.13  
% 3.78/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.13  
% 3.78/1.13  
%------------------------------------------------------------------------------