TSTP Solution File: GRP470-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP470-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:02 EDT 2023
% Result : Unsatisfiable 19.18s 4.16s
% Output : CNFRefutation 19.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 3
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 4 RR)
% Number of literals : 41 ( 40 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 123 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
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_108,plain,
divide(inverse(divide(inverse(X0),divide(X1,divide(X2,X3)))),multiply(divide(X3,X2),X0)) = X1,
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_112,plain,
divide(inverse(divide(X0,X1)),divide(divide(X2,divide(X3,X4)),X0)) = inverse(divide(X2,divide(X1,divide(X4,X3)))),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_153,plain,
divide(inverse(divide(inverse(X0),divide(X1,divide(inverse(X2),X3)))),multiply(multiply(X3,X2),X0)) = X1,
inference(superposition,[status(thm)],[c_50,c_108]) ).
cnf(c_497,plain,
inverse(divide(X0,divide(divide(X1,divide(divide(X2,X3),X0)),divide(X3,X2)))) = X1,
inference(superposition,[status(thm)],[c_112,c_49]) ).
cnf(c_566,plain,
inverse(inverse(divide(X0,divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2)))))) = X0,
inference(superposition,[status(thm)],[c_112,c_497]) ).
cnf(c_571,plain,
inverse(divide(X0,divide(divide(X1,divide(multiply(X2,X3),X0)),divide(inverse(X3),X2)))) = X1,
inference(superposition,[status(thm)],[c_50,c_497]) ).
cnf(c_655,plain,
inverse(divide(inverse(X0),divide(divide(X1,multiply(multiply(X2,X3),X0)),divide(inverse(X3),X2)))) = X1,
inference(superposition,[status(thm)],[c_50,c_571]) ).
cnf(c_1163,plain,
inverse(divide(divide(inverse(divide(divide(X0,X1),divide(X2,X3))),divide(X1,X0)),divide(X4,divide(X3,X2)))) = inverse(inverse(X4)),
inference(superposition,[status(thm)],[c_49,c_566]) ).
cnf(c_1172,plain,
inverse(inverse(divide(X0,divide(inverse(X1),divide(inverse(multiply(divide(X2,X3),X1)),divide(X3,X2)))))) = X0,
inference(superposition,[status(thm)],[c_50,c_566]) ).
cnf(c_12889,plain,
divide(inverse(inverse(X0)),divide(divide(X1,X2),divide(inverse(divide(divide(X3,X4),divide(X1,X2))),divide(X4,X3)))) = X0,
inference(superposition,[status(thm)],[c_1163,c_49]) ).
cnf(c_13868,plain,
divide(inverse(inverse(X0)),divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2)))) = X0,
inference(superposition,[status(thm)],[c_12889,c_12889]) ).
cnf(c_15378,plain,
divide(inverse(X0),multiply(multiply(divide(X1,X2),divide(divide(X2,X1),X3)),inverse(X0))) = X3,
inference(superposition,[status(thm)],[c_13868,c_153]) ).
cnf(c_15689,plain,
divide(X0,multiply(multiply(divide(X1,X2),divide(divide(X2,X1),X3)),X0)) = X3,
inference(superposition,[status(thm)],[c_1172,c_15378]) ).
cnf(c_16009,plain,
inverse(divide(inverse(X0),divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2))))) = X0,
inference(superposition,[status(thm)],[c_15689,c_655]) ).
cnf(c_19383,plain,
divide(divide(inverse(divide(divide(X0,X1),divide(X2,X3))),divide(X1,X0)),divide(X4,divide(X3,X2))) = inverse(X4),
inference(superposition,[status(thm)],[c_49,c_16009]) ).
cnf(c_25363,plain,
inverse(divide(divide(X0,divide(divide(X1,X2),X3)),divide(X2,X1))) = inverse(divide(X0,inverse(X3))),
inference(superposition,[status(thm)],[c_19383,c_497]) ).
cnf(c_26248,plain,
inverse(divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0))) = inverse(divide(inverse(divide(X4,X1)),inverse(X4))),
inference(superposition,[status(thm)],[c_112,c_25363]) ).
cnf(c_26512,plain,
inverse(divide(inverse(divide(X0,X1)),inverse(X0))) = inverse(X1),
inference(light_normalisation,[status(thm)],[c_26248,c_49]) ).
cnf(c_26929,plain,
divide(inverse(inverse(X0)),divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2)))) = divide(inverse(divide(X4,X0)),inverse(X4)),
inference(superposition,[status(thm)],[c_26512,c_13868]) ).
cnf(c_27026,plain,
divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
inference(light_normalisation,[status(thm)],[c_26929,c_13868]) ).
cnf(c_27270,plain,
multiply(multiply(divide(X0,X1),divide(divide(X1,X0),X2)),X3) = divide(inverse(X2),inverse(X3)),
inference(superposition,[status(thm)],[c_15689,c_27026]) ).
cnf(c_27331,plain,
multiply(inverse(divide(X0,X1)),X0) = X1,
inference(superposition,[status(thm)],[c_27026,c_50]) ).
cnf(c_27457,plain,
divide(X0,divide(inverse(X1),inverse(X0))) = X1,
inference(demodulation,[status(thm)],[c_15689,c_27270]) ).
cnf(c_27719,plain,
multiply(inverse(X0),inverse(divide(X1,divide(X0,divide(X2,X3))))) = divide(divide(X3,X2),X1),
inference(superposition,[status(thm)],[c_49,c_27331]) ).
cnf(c_27742,plain,
multiply(inverse(X0),inverse(divide(X1,X0))) = inverse(X1),
inference(superposition,[status(thm)],[c_27026,c_27331]) ).
cnf(c_29434,plain,
divide(divide(inverse(X0),inverse(X1)),X2) = multiply(inverse(X0),inverse(divide(X2,X1))),
inference(superposition,[status(thm)],[c_27457,c_27719]) ).
cnf(c_29514,plain,
divide(divide(inverse(X0),inverse(X0)),X1) = inverse(X1),
inference(demodulation,[status(thm)],[c_27742,c_29434]) ).
cnf(c_29955,plain,
divide(divide(X0,X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_16009,c_29514]) ).
cnf(c_30084,plain,
divide(multiply(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_50,c_29955]) ).
cnf(c_30104,plain,
divide(inverse(divide(X0,divide(X1,divide(X2,X2)))),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_29955,c_49]) ).
cnf(c_30355,plain,
multiply(multiply(inverse(X0),X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_30084,c_50]) ).
cnf(c_30451,plain,
inverse(inverse(a2)) != a2,
inference(demodulation,[status(thm)],[c_51,c_30355]) ).
cnf(c_30973,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_30104,c_27026]) ).
cnf(c_31434,plain,
divide(X0,inverse(divide(X1,X1))) = X0,
inference(superposition,[status(thm)],[c_29955,c_30973]) ).
cnf(c_31979,plain,
inverse(divide(divide(X0,X0),X1)) = X1,
inference(superposition,[status(thm)],[c_31434,c_27026]) ).
cnf(c_31989,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_31979,c_29955]) ).
cnf(c_32003,plain,
a2 != a2,
inference(demodulation,[status(thm)],[c_30451,c_31989]) ).
cnf(c_32004,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_32003]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP470-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 19:51:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 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
% 19.18/4.16 % SZS status Started for theBenchmark.p
% 19.18/4.16 % SZS status Unsatisfiable for theBenchmark.p
% 19.18/4.16
% 19.18/4.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 19.18/4.16
% 19.18/4.16 ------ iProver source info
% 19.18/4.16
% 19.18/4.16 git: date: 2023-05-31 18:12:56 +0000
% 19.18/4.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 19.18/4.16 git: non_committed_changes: false
% 19.18/4.16 git: last_make_outside_of_git: false
% 19.18/4.16
% 19.18/4.16 ------ Parsing...successful
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 19.18/4.16
% 19.18/4.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 19.18/4.16
% 19.18/4.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 19.18/4.16 ------ Proving...
% 19.18/4.16 ------ Problem Properties
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16 clauses 3
% 19.18/4.16 conjectures 1
% 19.18/4.16 EPR 0
% 19.18/4.16 Horn 3
% 19.18/4.16 unary 3
% 19.18/4.16 binary 0
% 19.18/4.16 lits 3
% 19.18/4.16 lits eq 3
% 19.18/4.16 fd_pure 0
% 19.18/4.16 fd_pseudo 0
% 19.18/4.16 fd_cond 0
% 19.18/4.16 fd_pseudo_cond 0
% 19.18/4.16 AC symbols 0
% 19.18/4.16
% 19.18/4.16 ------ Input Options Time Limit: Unbounded
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16 ------
% 19.18/4.16 Current options:
% 19.18/4.16 ------
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16 ------ Proving...
% 19.18/4.16
% 19.18/4.16
% 19.18/4.16 % SZS status Unsatisfiable for theBenchmark.p
% 19.18/4.16
% 19.18/4.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 19.18/4.16
% 19.18/4.16
%------------------------------------------------------------------------------