TSTP Solution File: GRP613-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP613-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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 01:00:43 EDT 2023
% Result : Unsatisfiable 0.45s 1.14s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 5 RR)
% Number of literals : 43 ( 42 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 92 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
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(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_60,plain,
double_divide(multiply(X0,multiply(inverse(X1),X2)),double_divide(X2,X0)) = X1,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_108,plain,
multiply(double_divide(X0,X1),multiply(X1,multiply(inverse(X2),X0))) = inverse(X2),
inference(superposition,[status(thm)],[c_60,c_50]) ).
cnf(c_109,plain,
double_divide(multiply(double_divide(X0,X1),multiply(inverse(X2),multiply(X1,multiply(inverse(X3),X0)))),X3) = X2,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_113,plain,
multiply(X0,multiply(double_divide(X1,X2),multiply(inverse(X3),multiply(X2,multiply(inverse(X0),X1))))) = inverse(X3),
inference(superposition,[status(thm)],[c_60,c_108]) ).
cnf(c_116,plain,
double_divide(inverse(X0),double_divide(multiply(inverse(X0),X1),double_divide(X1,inverse(X2)))) = X2,
inference(superposition,[status(thm)],[c_108,c_60]) ).
cnf(c_259,plain,
double_divide(multiply(double_divide(multiply(X0,multiply(inverse(inverse(X1)),X2)),double_divide(X2,X0)),inverse(X3)),X3) = X1,
inference(superposition,[status(thm)],[c_113,c_109]) ).
cnf(c_446,plain,
double_divide(multiply(inverse(X0),inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_60,c_259]) ).
cnf(c_508,plain,
double_divide(multiply(inverse(X0),multiply(X1,X2)),double_divide(X2,X1)) = X0,
inference(superposition,[status(thm)],[c_50,c_446]) ).
cnf(c_513,plain,
multiply(X0,multiply(inverse(X1),inverse(X0))) = inverse(X1),
inference(superposition,[status(thm)],[c_446,c_50]) ).
cnf(c_548,plain,
double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_513,c_60]) ).
cnf(c_554,plain,
multiply(double_divide(inverse(X0),X0),inverse(X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_513,c_108]) ).
cnf(c_599,plain,
double_divide(multiply(X0,X1),double_divide(inverse(X2),X2)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_50,c_548]) ).
cnf(c_673,plain,
double_divide(inverse(X0),double_divide(inverse(inverse(X1)),inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_513,c_508]) ).
cnf(c_885,plain,
double_divide(multiply(X0,inverse(X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_599,c_508]) ).
cnf(c_917,plain,
double_divide(multiply(double_divide(X0,X1),multiply(X1,X0)),inverse(X2)) = X2,
inference(superposition,[status(thm)],[c_50,c_885]) ).
cnf(c_923,plain,
multiply(inverse(X0),multiply(X1,inverse(X1))) = inverse(X0),
inference(superposition,[status(thm)],[c_885,c_50]) ).
cnf(c_952,plain,
multiply(inverse(X0),multiply(double_divide(X1,X2),multiply(X2,X1))) = inverse(X0),
inference(superposition,[status(thm)],[c_50,c_923]) ).
cnf(c_1154,plain,
double_divide(inverse(X0),double_divide(multiply(inverse(X0),multiply(double_divide(X1,X2),multiply(X2,X1))),X3)) = X3,
inference(superposition,[status(thm)],[c_917,c_116]) ).
cnf(c_1162,plain,
double_divide(inverse(X0),double_divide(inverse(X0),X1)) = X1,
inference(light_normalisation,[status(thm)],[c_1154,c_952]) ).
cnf(c_1222,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_1162,c_673]) ).
cnf(c_1242,plain,
inverse(multiply(X0,X1)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_50,c_1222]) ).
cnf(c_1245,plain,
multiply(double_divide(inverse(X0),X0),X1) = X1,
inference(superposition,[status(thm)],[c_1222,c_554]) ).
cnf(c_1247,plain,
multiply(X0,multiply(X1,inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_1222,c_513]) ).
cnf(c_1250,plain,
double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_1222,c_1162]) ).
cnf(c_1315,plain,
multiply(double_divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_1250,c_50]) ).
cnf(c_1343,plain,
double_divide(inverse(X0),X0) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_1245,c_1247]) ).
cnf(c_1344,plain,
double_divide(inverse(X0),X1) = multiply(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_1315,c_1247]) ).
cnf(c_1347,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_1222,c_1247]) ).
cnf(c_1354,plain,
multiply(X0,double_divide(inverse(X1),X0)) = X1,
inference(demodulation,[status(thm)],[c_1247,c_1344]) ).
cnf(c_1405,plain,
multiply(inverse(multiply(X0,X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_1347,c_1347]) ).
cnf(c_1407,plain,
multiply(double_divide(X0,X1),X1) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_1405,c_1242]) ).
cnf(c_1421,plain,
multiply(X0,double_divide(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_1222,c_1354]) ).
cnf(c_1593,plain,
double_divide(double_divide(X0,X1),X1) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_1421,c_1242]) ).
cnf(c_1601,plain,
double_divide(double_divide(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_1593,c_1222]) ).
cnf(c_1610,plain,
inverse(double_divide(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_1601,c_1407]) ).
cnf(c_1843,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_1610,c_50]) ).
cnf(c_1850,plain,
multiply(inverse(b1),b1) != multiply(a1,inverse(a1)),
inference(demodulation,[status(thm)],[c_51,c_1843]) ).
cnf(c_1905,plain,
multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)),
inference(superposition,[status(thm)],[c_1843,c_1850]) ).
cnf(c_2671,plain,
double_divide(inverse(X0),X0) != multiply(a1,inverse(a1)),
inference(superposition,[status(thm)],[c_1343,c_1905]) ).
cnf(c_2672,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2671,c_1343]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP613-1 : TPTP v8.1.2. Released v2.6.0.
% 0.11/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n021.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.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Aug 28 20:39:13 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.45 Running UEQ theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.14 % SZS status Started for theBenchmark.p
% 0.45/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.14
% 0.45/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.14
% 0.45/1.14 ------ iProver source info
% 0.45/1.14
% 0.45/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.14 git: non_committed_changes: false
% 0.45/1.14 git: last_make_outside_of_git: false
% 0.45/1.14
% 0.45/1.14 ------ Parsing...successful
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.45/1.14 ------ Proving...
% 0.45/1.14 ------ Problem Properties
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 clauses 3
% 0.45/1.14 conjectures 1
% 0.45/1.14 EPR 0
% 0.45/1.14 Horn 3
% 0.45/1.14 unary 3
% 0.45/1.14 binary 0
% 0.45/1.14 lits 3
% 0.45/1.14 lits eq 3
% 0.45/1.14 fd_pure 0
% 0.45/1.14 fd_pseudo 0
% 0.45/1.14 fd_cond 0
% 0.45/1.14 fd_pseudo_cond 0
% 0.45/1.14 AC symbols 0
% 0.45/1.14
% 0.45/1.14 ------ Input Options Time Limit: Unbounded
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 ------
% 0.45/1.14 Current options:
% 0.45/1.14 ------
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 ------ Proving...
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.14
% 0.45/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.15
% 0.45/1.15
%------------------------------------------------------------------------------