TSTP Solution File: GRP610-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP610-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:23:04 EDT 2024
% Result : Unsatisfiable 3.72s 1.14s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 5 RR)
% Number of literals : 41 ( 40 equ; 4 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 : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,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(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_60,plain,
multiply(double_divide(X0,X1),multiply(X1,multiply(X2,X0))) = X2,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_98,plain,
multiply(double_divide(multiply(X0,multiply(X1,X2)),X3),multiply(X3,X1)) = double_divide(X2,X0),
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_100,plain,
multiply(double_divide(multiply(X0,X1),double_divide(X1,X2)),X0) = X2,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_106,plain,
double_divide(multiply(X0,X1),double_divide(X1,X2)) = multiply(double_divide(X0,X3),multiply(X3,X2)),
inference(superposition,[status(thm)],[c_100,c_60]) ).
cnf(c_125,plain,
double_divide(X0,multiply(double_divide(multiply(X1,X0),X2),X1)) = X2,
inference(superposition,[status(thm)],[c_98,c_100]) ).
cnf(c_139,plain,
double_divide(multiply(X0,X1),double_divide(X1,multiply(X2,X0))) = X2,
inference(superposition,[status(thm)],[c_98,c_125]) ).
cnf(c_145,plain,
multiply(multiply(double_divide(multiply(X0,X1),X2),X0),X1) = inverse(X2),
inference(superposition,[status(thm)],[c_125,c_50]) ).
cnf(c_165,plain,
multiply(double_divide(X0,multiply(X1,X2)),multiply(X2,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_139,c_50]) ).
cnf(c_227,plain,
multiply(double_divide(X0,double_divide(X0,multiply(X1,X2))),inverse(X1)) = X2,
inference(superposition,[status(thm)],[c_165,c_60]) ).
cnf(c_272,plain,
double_divide(multiply(inverse(X0),X1),multiply(X0,X2)) = double_divide(X1,X2),
inference(superposition,[status(thm)],[c_227,c_125]) ).
cnf(c_382,plain,
multiply(multiply(double_divide(X0,X1),multiply(X1,X2)),X0) = X2,
inference(superposition,[status(thm)],[c_106,c_100]) ).
cnf(c_510,plain,
multiply(X0,multiply(multiply(double_divide(X1,X0),X2),X1)) = X2,
inference(superposition,[status(thm)],[c_100,c_382]) ).
cnf(c_639,plain,
double_divide(X0,multiply(double_divide(X0,X1),inverse(X2))) = multiply(X2,X1),
inference(superposition,[status(thm)],[c_272,c_125]) ).
cnf(c_1132,plain,
multiply(X0,double_divide(X1,multiply(X0,X2))) = double_divide(X1,X2),
inference(superposition,[status(thm)],[c_227,c_639]) ).
cnf(c_1183,plain,
multiply(double_divide(multiply(X0,X1),X2),X2) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_125,c_1132]) ).
cnf(c_1314,plain,
multiply(double_divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_1183,c_145]) ).
cnf(c_1315,plain,
double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_1183,c_125]) ).
cnf(c_1318,plain,
inverse(multiply(X0,X1)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1183,c_165]) ).
cnf(c_1323,plain,
multiply(multiply(X0,X1),inverse(X0)) = X1,
inference(demodulation,[status(thm)],[c_227,c_1315]) ).
cnf(c_1422,plain,
multiply(double_divide(X0,X1),multiply(X1,inverse(X2))) = double_divide(X0,X2),
inference(superposition,[status(thm)],[c_1314,c_60]) ).
cnf(c_1428,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_1314,c_510]) ).
cnf(c_1446,plain,
multiply(double_divide(inverse(X0),double_divide(X1,X2)),double_divide(X1,X0)) = X2,
inference(superposition,[status(thm)],[c_1422,c_60]) ).
cnf(c_1467,plain,
multiply(X0,double_divide(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_1315,c_1446]) ).
cnf(c_1551,plain,
double_divide(X0,double_divide(X0,X1)) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_1314,c_1318]) ).
cnf(c_1552,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1551,c_1315]) ).
cnf(c_1605,plain,
multiply(inverse(X0),X1) = multiply(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_1428,c_1323]) ).
cnf(c_1611,plain,
multiply(multiply(b2,inverse(b2)),a2) != a2,
inference(demodulation,[status(thm)],[c_51,c_1605]) ).
cnf(c_1625,plain,
double_divide(inverse(multiply(X0,X1)),X1) = X0,
inference(superposition,[status(thm)],[c_1467,c_1132]) ).
cnf(c_1626,plain,
double_divide(double_divide(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_1467,c_1314]) ).
cnf(c_1627,plain,
double_divide(double_divide(X0,X1),X0) = X1,
inference(light_normalisation,[status(thm)],[c_1625,c_1318]) ).
cnf(c_1636,plain,
double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1315,c_1627]) ).
cnf(c_1641,plain,
multiply(X0,double_divide(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_1627,c_50]) ).
cnf(c_1655,plain,
inverse(double_divide(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_1636,c_50]) ).
cnf(c_1665,plain,
double_divide(inverse(X0),X1) = multiply(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_1641,c_1428]) ).
cnf(c_1667,plain,
multiply(double_divide(inverse(b2),b2),a2) != a2,
inference(demodulation,[status(thm)],[c_1611,c_1665]) ).
cnf(c_2117,plain,
multiply(double_divide(inverse(X0),X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_1626,c_1655]) ).
cnf(c_2135,plain,
inverse(inverse(a2)) != a2,
inference(demodulation,[status(thm)],[c_1667,c_2117]) ).
cnf(c_2136,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2135,c_1552]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP610-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 23:57:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running UEQ theorem proving
% 0.18/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.72/1.14 % SZS status Started for theBenchmark.p
% 3.72/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/1.14
% 3.72/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.72/1.14
% 3.72/1.14 ------ iProver source info
% 3.72/1.14
% 3.72/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.72/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.72/1.14 git: non_committed_changes: false
% 3.72/1.14
% 3.72/1.14 ------ Parsing...successful
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.72/1.14
% 3.72/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.72/1.14
% 3.72/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.72/1.14 ------ Proving...
% 3.72/1.14 ------ Problem Properties
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14 clauses 3
% 3.72/1.14 conjectures 1
% 3.72/1.14 EPR 0
% 3.72/1.14 Horn 3
% 3.72/1.14 unary 3
% 3.72/1.14 binary 0
% 3.72/1.14 lits 3
% 3.72/1.14 lits eq 3
% 3.72/1.14 fd_pure 0
% 3.72/1.14 fd_pseudo 0
% 3.72/1.14 fd_cond 0
% 3.72/1.14 fd_pseudo_cond 0
% 3.72/1.14 AC symbols 0
% 3.72/1.14
% 3.72/1.14 ------ Input Options Time Limit: Unbounded
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14 ------
% 3.72/1.14 Current options:
% 3.72/1.14 ------
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14 ------ Proving...
% 3.72/1.14
% 3.72/1.14
% 3.72/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/1.14
% 3.72/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.72/1.14
% 3.72/1.14
%------------------------------------------------------------------------------