TSTP Solution File: GRP586-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP586-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 : Mon Jun 24 07:00:52 EDT 2024
% Result : Unsatisfiable 0.47s 1.14s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(X2))),X1))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
inverse(double_divide(X0,X1)) = multiply(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_60,plain,
double_divide(X0,multiply(X1,multiply(inverse(X2),double_divide(X0,X1)))) = X2,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_104,plain,
double_divide(X0,multiply(X1,multiply(multiply(X2,X3),double_divide(X0,X1)))) = double_divide(X3,X2),
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_105,plain,
double_divide(X0,multiply(multiply(X1,multiply(inverse(X2),double_divide(X0,X1))),multiply(inverse(X3),X2))) = X3,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_107,plain,
multiply(multiply(X0,multiply(inverse(X1),double_divide(X2,X0))),X2) = inverse(X1),
inference(superposition,[status(thm)],[c_60,c_50]) ).
cnf(c_115,plain,
double_divide(multiply(inverse(X0),double_divide(double_divide(X1,X2),X3)),X3) = double_divide(X1,multiply(X2,inverse(X0))),
inference(superposition,[status(thm)],[c_107,c_104]) ).
cnf(c_154,plain,
double_divide(multiply(inverse(X0),X1),inverse(X1)) = X0,
inference(superposition,[status(thm)],[c_107,c_105]) ).
cnf(c_178,plain,
double_divide(multiply(multiply(X0,X1),X2),inverse(X2)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_50,c_154]) ).
cnf(c_183,plain,
multiply(inverse(X0),multiply(inverse(X1),X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_154,c_50]) ).
cnf(c_261,plain,
multiply(inverse(X0),multiply(multiply(X1,X2),X0)) = multiply(X1,X2),
inference(superposition,[status(thm)],[c_50,c_183]) ).
cnf(c_266,plain,
double_divide(inverse(X0),inverse(multiply(inverse(X0),X1))) = X1,
inference(superposition,[status(thm)],[c_183,c_154]) ).
cnf(c_275,plain,
double_divide(multiply(inverse(X0),double_divide(X1,X2)),X2) = double_divide(inverse(X0),inverse(X1)),
inference(superposition,[status(thm)],[c_107,c_178]) ).
cnf(c_479,plain,
double_divide(inverse(X0),inverse(multiply(X1,X2))) = multiply(multiply(X1,X2),X0),
inference(superposition,[status(thm)],[c_261,c_266]) ).
cnf(c_483,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(demodulation,[status(thm)],[c_266,c_479]) ).
cnf(c_514,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_483,c_261]) ).
cnf(c_523,plain,
multiply(inverse(multiply(X0,X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_514,c_514]) ).
cnf(c_524,plain,
double_divide(X0,inverse(multiply(X0,X1))) = X1,
inference(superposition,[status(thm)],[c_514,c_154]) ).
cnf(c_538,plain,
double_divide(inverse(X0),inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_514,c_524]) ).
cnf(c_549,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_523,c_514]) ).
cnf(c_624,plain,
inverse(multiply(double_divide(X0,X1),X2)) = multiply(multiply(X1,X0),inverse(X2)),
inference(superposition,[status(thm)],[c_50,c_549]) ).
cnf(c_640,plain,
double_divide(X0,multiply(X1,inverse(X2))) = multiply(double_divide(X0,X1),X2),
inference(demodulation,[status(thm)],[c_115,c_275,c_538]) ).
cnf(c_642,plain,
double_divide(X0,inverse(multiply(X1,X2))) = multiply(double_divide(X0,inverse(X1)),X2),
inference(superposition,[status(thm)],[c_549,c_640]) ).
cnf(c_1444,plain,
inverse(multiply(double_divide(X0,inverse(inverse(X1))),X1)) = X0,
inference(superposition,[status(thm)],[c_624,c_483]) ).
cnf(c_1547,plain,
multiply(inverse(multiply(inverse(X0),X0)),X1) = X1,
inference(demodulation,[status(thm)],[c_1444,c_50,c_642]) ).
cnf(c_1567,plain,
multiply(X0,multiply(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_1547,c_483]) ).
cnf(c_1674,plain,
double_divide(X0,inverse(X0)) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_1567,c_524]) ).
cnf(c_1776,plain,
multiply(double_divide(X0,inverse(X0)),a2) != a2,
inference(superposition,[status(thm)],[c_1674,c_51]) ).
cnf(c_1779,plain,
multiply(double_divide(X0,inverse(X0)),X1) = X1,
inference(superposition,[status(thm)],[c_1674,c_483]) ).
cnf(c_1792,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1776,c_1779]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP586-1 : TPTP v8.2.0. Released v2.6.0.
% 0.12/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 10:35:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.46 Running UEQ theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.14 % SZS status Started for theBenchmark.p
% 0.47/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.14
% 0.47/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.14
% 0.47/1.14 ------ iProver source info
% 0.47/1.14
% 0.47/1.14 git: date: 2024-06-12 09:56:46 +0000
% 0.47/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.47/1.14 git: non_committed_changes: false
% 0.47/1.14
% 0.47/1.14 ------ Parsing...successful
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.14
% 0.47/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.14
% 0.47/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.47/1.14 ------ Proving...
% 0.47/1.14 ------ Problem Properties
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 clauses 3
% 0.47/1.14 conjectures 1
% 0.47/1.14 EPR 0
% 0.47/1.14 Horn 3
% 0.47/1.14 unary 3
% 0.47/1.14 binary 0
% 0.47/1.14 lits 3
% 0.47/1.14 lits eq 3
% 0.47/1.14 fd_pure 0
% 0.47/1.14 fd_pseudo 0
% 0.47/1.14 fd_cond 0
% 0.47/1.14 fd_pseudo_cond 0
% 0.47/1.14 AC symbols 0
% 0.47/1.14
% 0.47/1.14 ------ Input Options Time Limit: Unbounded
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 ------
% 0.47/1.14 Current options:
% 0.47/1.14 ------
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 ------ Proving...
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.14
% 0.47/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.14
% 0.47/1.14
%------------------------------------------------------------------------------