TSTP Solution File: GRP600-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP600-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:23:02 EDT 2024
% Result : Unsatisfiable 0.44s 1.14s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 3 RR)
% Number of literals : 43 ( 42 equ; 2 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 : 96 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(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(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(c_60,plain,
double_divide(double_divide(X0,X1),multiply(multiply(X1,inverse(X2)),X0)) = X2,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_108,plain,
double_divide(X0,multiply(multiply(multiply(multiply(X1,inverse(X0)),X2),inverse(X3)),double_divide(X2,X1))) = X3,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_109,plain,
multiply(multiply(multiply(X0,inverse(X1)),X2),double_divide(X2,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_60,c_50]) ).
cnf(c_115,plain,
multiply(multiply(multiply(multiply(multiply(X0,inverse(X1)),X2),inverse(X3)),double_divide(X2,X0)),X1) = inverse(X3),
inference(superposition,[status(thm)],[c_60,c_109]) ).
cnf(c_116,plain,
double_divide(double_divide(double_divide(inverse(X0),X1),multiply(X1,inverse(X2))),inverse(X2)) = X0,
inference(superposition,[status(thm)],[c_109,c_60]) ).
cnf(c_258,plain,
double_divide(X0,multiply(inverse(X0),double_divide(double_divide(X1,X2),multiply(multiply(X2,inverse(inverse(X3))),X1)))) = X3,
inference(superposition,[status(thm)],[c_115,c_108]) ).
cnf(c_447,plain,
double_divide(X0,multiply(inverse(X0),inverse(X1))) = X1,
inference(superposition,[status(thm)],[c_60,c_258]) ).
cnf(c_507,plain,
double_divide(double_divide(X0,X1),multiply(multiply(X1,X0),inverse(X2))) = X2,
inference(superposition,[status(thm)],[c_50,c_447]) ).
cnf(c_511,plain,
multiply(multiply(inverse(X0),inverse(X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_447,c_50]) ).
cnf(c_549,plain,
double_divide(double_divide(X0,inverse(X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_511,c_60]) ).
cnf(c_561,plain,
multiply(inverse(X0),double_divide(X1,inverse(X1))) = inverse(X0),
inference(superposition,[status(thm)],[c_511,c_109]) ).
cnf(c_601,plain,
double_divide(double_divide(X0,inverse(X0)),multiply(X1,X2)) = double_divide(X2,X1),
inference(superposition,[status(thm)],[c_50,c_549]) ).
cnf(c_632,plain,
double_divide(double_divide(inverse(X0),inverse(inverse(X1))),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_511,c_507]) ).
cnf(c_959,plain,
double_divide(inverse(X0),multiply(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_601,c_507]) ).
cnf(c_999,plain,
multiply(multiply(inverse(X0),X0),inverse(X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_959,c_50]) ).
cnf(c_1034,plain,
double_divide(double_divide(double_divide(inverse(X0),multiply(inverse(X1),X1)),inverse(X2)),inverse(X2)) = X0,
inference(superposition,[status(thm)],[c_999,c_116]) ).
cnf(c_1064,plain,
double_divide(double_divide(X0,inverse(X1)),inverse(X1)) = X0,
inference(light_normalisation,[status(thm)],[c_1034,c_959]) ).
cnf(c_1277,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_1064,c_632]) ).
cnf(c_1299,plain,
inverse(multiply(X0,X1)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_50,c_1277]) ).
cnf(c_1309,plain,
multiply(X0,double_divide(X1,inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_1277,c_561]) ).
cnf(c_1318,plain,
double_divide(double_divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_1277,c_1064]) ).
cnf(c_1323,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_1277,c_511]) ).
cnf(c_1375,plain,
multiply(X0,double_divide(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_1318,c_50]) ).
cnf(c_1379,plain,
multiply(X0,double_divide(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_1277,c_1309]) ).
cnf(c_1424,plain,
double_divide(X0,inverse(X1)) = multiply(inverse(X0),X1),
inference(superposition,[status(thm)],[c_1375,c_1323]) ).
cnf(c_1426,plain,
multiply(multiply(multiply(X0,X1),X2),double_divide(X1,X0)) = X2,
inference(superposition,[status(thm)],[c_50,c_1323]) ).
cnf(c_1427,plain,
multiply(multiply(X0,X1),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_1277,c_1323]) ).
cnf(c_1442,plain,
double_divide(double_divide(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_1379,c_1299]) ).
cnf(c_1553,plain,
multiply(X0,double_divide(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_1427,c_1426]) ).
cnf(c_1718,plain,
multiply(inverse(X0),inverse(X1)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1553,c_1427]) ).
cnf(c_2446,plain,
double_divide(double_divide(X0,X1),inverse(X2)) = multiply(multiply(X1,X0),X2),
inference(superposition,[status(thm)],[c_50,c_1424]) ).
cnf(c_2527,plain,
inverse(multiply(multiply(X0,X1),X2)) = multiply(inverse(X2),double_divide(X1,X0)),
inference(superposition,[status(thm)],[c_2446,c_50]) ).
cnf(c_2578,plain,
inverse(multiply(multiply(X0,double_divide(inverse(X1),X1)),X2)) = multiply(inverse(X2),inverse(X0)),
inference(superposition,[status(thm)],[c_1442,c_2527]) ).
cnf(c_2599,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
inference(light_normalisation,[status(thm)],[c_2578,c_1379]) ).
cnf(c_2600,plain,
inverse(multiply(X0,X1)) = double_divide(X0,X1),
inference(light_normalisation,[status(thm)],[c_2599,c_1718]) ).
cnf(c_2601,plain,
double_divide(X0,X1) = double_divide(X1,X0),
inference(light_normalisation,[status(thm)],[c_2600,c_1299]) ).
cnf(c_2644,plain,
inverse(double_divide(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_2601,c_50]) ).
cnf(c_2724,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_2644,c_50]) ).
cnf(c_2736,plain,
multiply(a,b) != multiply(a,b),
inference(demodulation,[status(thm)],[c_51,c_2724]) ).
cnf(c_2737,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2736]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP600-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n017.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 May 2 23:16:36 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running UEQ theorem proving
% 0.18/0.46 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.44/1.14 % SZS status Started for theBenchmark.p
% 0.44/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.14
% 0.44/1.14 ------ iProver source info
% 0.44/1.14
% 0.44/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.44/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.44/1.14 git: non_committed_changes: false
% 0.44/1.14
% 0.44/1.14 ------ Parsing...successful
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.44/1.14 ------ Proving...
% 0.44/1.14 ------ Problem Properties
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 clauses 3
% 0.44/1.14 conjectures 1
% 0.44/1.14 EPR 0
% 0.44/1.14 Horn 3
% 0.44/1.14 unary 3
% 0.44/1.14 binary 0
% 0.44/1.14 lits 3
% 0.44/1.14 lits eq 3
% 0.44/1.14 fd_pure 0
% 0.44/1.14 fd_pseudo 0
% 0.44/1.14 fd_cond 0
% 0.44/1.14 fd_pseudo_cond 0
% 0.44/1.14 AC symbols 0
% 0.44/1.14
% 0.44/1.14 ------ Input Options Time Limit: Unbounded
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------
% 0.44/1.14 Current options:
% 0.44/1.14 ------
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------ Proving...
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.14
% 0.44/1.14
%------------------------------------------------------------------------------