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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : GRP560-1 : TPTP v8.1.2. Bugfixed v2.7.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:55 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    divide(X0,inverse(divide(divide(X1,X2),divide(X0,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(a,b) != multiply(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).

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

cnf(c_66,plain,
    multiply(a,b) = sP0_iProver_def,
    definition ).

cnf(c_67,plain,
    multiply(b,a) = sP1_iProver_def,
    definition ).

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

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

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

cnf(c_111,plain,
    multiply(X0,divide(sP0_iProver_def,multiply(X0,b))) = a,
    inference(superposition,[status(thm)],[c_66,c_110]) ).

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

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

cnf(c_130,plain,
    multiply(X0,divide(multiply(X1,divide(sP0_iProver_def,multiply(X0,b))),a)) = X1,
    inference(superposition,[status(thm)],[c_111,c_110]) ).

cnf(c_266,plain,
    multiply(X0,divide(a,a)) = X0,
    inference(superposition,[status(thm)],[c_111,c_130]) ).

cnf(c_277,plain,
    multiply(X0,divide(X1,multiply(X0,divide(a,a)))) = X1,
    inference(superposition,[status(thm)],[c_266,c_110]) ).

cnf(c_278,plain,
    multiply(X0,divide(X1,X0)) = X1,
    inference(light_normalisation,[status(thm)],[c_277,c_266]) ).

cnf(c_285,plain,
    multiply(X0,divide(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_60,c_113]) ).

cnf(c_359,plain,
    multiply(inverse(X0),multiply(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c_50,c_278]) ).

cnf(c_365,plain,
    multiply(X0,divide(sP0_iProver_def,a)) = multiply(X0,b),
    inference(superposition,[status(thm)],[c_278,c_130]) ).

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

cnf(c_394,plain,
    multiply(inverse(divide(X0,X1)),X0) = X1,
    inference(superposition,[status(thm)],[c_278,c_359]) ).

cnf(c_395,plain,
    multiply(inverse(divide(X0,X0)),X1) = X1,
    inference(superposition,[status(thm)],[c_285,c_359]) ).

cnf(c_732,plain,
    inverse(divide(divide(X0,X1),divide(X2,X1))) = multiply(inverse(X0),X2),
    inference(superposition,[status(thm)],[c_385,c_359]) ).

cnf(c_734,plain,
    multiply(multiply(inverse(X0),X1),X0) = X1,
    inference(demodulation,[status(thm)],[c_385,c_732]) ).

cnf(c_864,plain,
    inverse(divide(X0,X1)) = multiply(inverse(X0),X1),
    inference(superposition,[status(thm)],[c_394,c_359]) ).

cnf(c_941,plain,
    multiply(multiply(inverse(X0),X0),X1) = X1,
    inference(demodulation,[status(thm)],[c_395,c_864]) ).

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

cnf(c_962,plain,
    divide(X0,multiply(inverse(X1),X1)) = X0,
    inference(superposition,[status(thm)],[c_941,c_278]) ).

cnf(c_963,plain,
    multiply(inverse(X0),X0) = divide(X1,X1),
    inference(superposition,[status(thm)],[c_941,c_285]) ).

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

cnf(c_1088,plain,
    multiply(multiply(inverse(X0),X1),X2) = multiply(X1,divide(X2,X0)),
    inference(light_normalisation,[status(thm)],[c_1079,c_732]) ).

cnf(c_1180,plain,
    divide(X0,divide(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_963,c_962]) ).

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

cnf(c_1358,plain,
    divide(multiply(X0,X1),multiply(multiply(inverse(X2),X2),X1)) = X0,
    inference(light_normalisation,[status(thm)],[c_1334,c_50]) ).

cnf(c_1602,plain,
    multiply(divide(X0,X0),X1) = X1,
    inference(superposition,[status(thm)],[c_1180,c_278]) ).

cnf(c_1769,plain,
    multiply(divide(X0,X0),b) = divide(sP0_iProver_def,a),
    inference(superposition,[status(thm)],[c_365,c_1602]) ).

cnf(c_2256,plain,
    divide(sP0_iProver_def,a) = b,
    inference(demodulation,[status(thm)],[c_1769,c_1602]) ).

cnf(c_2258,plain,
    multiply(X0,divide(b,divide(X0,a))) = sP0_iProver_def,
    inference(superposition,[status(thm)],[c_2256,c_60]) ).

cnf(c_2677,plain,
    divide(multiply(X0,X1),X1) = X0,
    inference(demodulation,[status(thm)],[c_1358,c_278,c_1088]) ).

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

cnf(c_2731,plain,
    multiply(b,a) = sP0_iProver_def,
    inference(demodulation,[status(thm)],[c_2258,c_2710]) ).

cnf(c_2732,plain,
    sP0_iProver_def = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_2731,c_67]) ).

cnf(c_2733,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2732,c_68]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : GRP560-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.06/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n023.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.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Fri May  3 00:09:09 EDT 2024
% 0.11/0.33  % 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
% 0.43/1.13  % SZS status Started for theBenchmark.p
% 0.43/1.13  % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.13  
% 0.43/1.13  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.13  
% 0.43/1.13  ------  iProver source info
% 0.43/1.13  
% 0.43/1.13  git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.13  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.13  git: non_committed_changes: false
% 0.43/1.13  
% 0.43/1.13  ------ Parsing...successful
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.43/1.13  
% 0.43/1.13  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.43/1.13  
% 0.43/1.13  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.43/1.13  ------ Proving...
% 0.43/1.13  ------ Problem Properties 
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  clauses                                 5
% 0.43/1.13  conjectures                             1
% 0.43/1.13  EPR                                     1
% 0.43/1.13  Horn                                    5
% 0.43/1.13  unary                                   5
% 0.43/1.13  binary                                  0
% 0.43/1.13  lits                                    5
% 0.43/1.13  lits eq                                 5
% 0.43/1.13  fd_pure                                 0
% 0.43/1.13  fd_pseudo                               0
% 0.43/1.13  fd_cond                                 0
% 0.43/1.13  fd_pseudo_cond                          0
% 0.43/1.13  AC symbols                              0
% 0.43/1.13  
% 0.43/1.13  ------ Input Options Time Limit: Unbounded
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  ------ 
% 0.43/1.13  Current options:
% 0.43/1.13  ------ 
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  ------ Proving...
% 0.43/1.13  
% 0.43/1.13  
% 0.43/1.13  % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.13  
% 0.43/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.13  
% 0.43/1.13  
%------------------------------------------------------------------------------