TSTP Solution File: GRP590-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP590-1 : TPTP v8.2.0. 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 : Mon Jun 24 07:00:53 EDT 2024
% Result : Unsatisfiable 0.44s 1.14s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 equ; 3 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 : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
double_divide(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,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(multiply(multiply(inverse(X0),X1),double_divide(X1,X2)),X2) = X0,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_106,plain,
multiply(X0,multiply(multiply(inverse(X1),X2),double_divide(X2,X0))) = inverse(X1),
inference(superposition,[status(thm)],[c_60,c_50]) ).
cnf(c_107,plain,
double_divide(multiply(multiply(inverse(X0),multiply(multiply(inverse(X1),X2),double_divide(X2,X3))),X1),X3) = X0,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_167,plain,
double_divide(multiply(inverse(X0),X0),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_106,c_107]) ).
cnf(c_212,plain,
double_divide(multiply(multiply(X0,X1),double_divide(X1,X0)),inverse(X2)) = X2,
inference(superposition,[status(thm)],[c_50,c_167]) ).
cnf(c_214,plain,
multiply(inverse(X0),multiply(inverse(X1),X1)) = inverse(X0),
inference(superposition,[status(thm)],[c_167,c_50]) ).
cnf(c_293,plain,
multiply(inverse(X0),multiply(multiply(X1,X2),double_divide(X2,X1))) = inverse(X0),
inference(superposition,[status(thm)],[c_50,c_214]) ).
cnf(c_301,plain,
double_divide(inverse(multiply(inverse(X0),X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_214,c_167]) ).
cnf(c_340,plain,
double_divide(multiply(multiply(inverse(X0),multiply(multiply(X1,X2),double_divide(X2,X1))),X3),inverse(X3)) = X0,
inference(superposition,[status(thm)],[c_212,c_60]) ).
cnf(c_347,plain,
double_divide(multiply(inverse(X0),X1),inverse(X1)) = X0,
inference(light_normalisation,[status(thm)],[c_340,c_293]) ).
cnf(c_392,plain,
double_divide(inverse(X0),inverse(multiply(inverse(X1),X1))) = X0,
inference(superposition,[status(thm)],[c_214,c_347]) ).
cnf(c_395,plain,
multiply(inverse(X0),multiply(inverse(X1),X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_347,c_50]) ).
cnf(c_449,plain,
double_divide(inverse(X0),inverse(multiply(inverse(X0),X1))) = X1,
inference(superposition,[status(thm)],[c_395,c_347]) ).
cnf(c_569,plain,
multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_392,c_301]) ).
cnf(c_631,plain,
multiply(multiply(inverse(X0),X0),a2) != a2,
inference(superposition,[status(thm)],[c_569,c_51]) ).
cnf(c_681,plain,
multiply(inverse(multiply(inverse(X0),X0)),a2) != a2,
inference(superposition,[status(thm)],[c_214,c_631]) ).
cnf(c_1377,plain,
multiply(inverse(multiply(inverse(X0),X0)),X1) = X1,
inference(superposition,[status(thm)],[c_449,c_301]) ).
cnf(c_1382,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_681,c_1377]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP590-1 : TPTP v8.2.0. Released v2.6.0.
% 0.10/0.12 % 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 : Thu Jun 20 09:19:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running UEQ theorem proving
% 0.18/0.45 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.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-06-12 09:56:46 +0000
% 0.44/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 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
%------------------------------------------------------------------------------