TSTP Solution File: GRP091-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP091-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 00:57:28 EDT 2023
% Result : Unsatisfiable 0.47s 1.16s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 47 ( 42 unt; 0 nHn; 9 RR)
% Number of literals : 58 ( 57 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(X0,divide(divide(X0,X1),X2)),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(divide(X0,X0),X1) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,plain,
divide(X0,X0) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(c_53,negated_conjecture,
( multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_74,plain,
divide(identity,X0) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_51,c_52]) ).
cnf(c_75,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_52,c_74]) ).
cnf(c_145,plain,
multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_75,c_52]) ).
cnf(c_146,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_75,c_74]) ).
cnf(c_147,plain,
( multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(b1),b1) != identity
| multiply(a4,b4) != multiply(b4,a4) ),
inference(demodulation,[status(thm)],[c_53,c_145]) ).
cnf(c_148,plain,
( multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_147,c_145]) ).
cnf(c_155,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(identity,a2) != a2
| multiply(a4,b4) != multiply(b4,a4) ),
inference(demodulation,[status(thm)],[c_148,c_145]) ).
cnf(c_174,plain,
divide(divide(X0,divide(identity,X1)),X0) = X1,
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_179,plain,
divide(divide(X0,X1),divide(divide(X0,X2),X1)) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_224,plain,
divide(multiply(X0,X1),X0) = X1,
inference(demodulation,[status(thm)],[c_174,c_74,c_75]) ).
cnf(c_230,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_224,c_75]) ).
cnf(c_250,plain,
multiply(identity,X0) = X0,
inference(superposition,[status(thm)],[c_145,c_230]) ).
cnf(c_254,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(backward_subsumption_resolution,[status(thm)],[c_155,c_250]) ).
cnf(c_255,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_146,c_250]) ).
cnf(c_262,plain,
divide(X0,identity) = X0,
inference(superposition,[status(thm)],[c_250,c_224]) ).
cnf(c_272,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_255,c_75]) ).
cnf(c_281,plain,
divide(X0,divide(divide(X0,identity),X1)) = X1,
inference(superposition,[status(thm)],[c_262,c_49]) ).
cnf(c_284,plain,
divide(X0,divide(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_281,c_262]) ).
cnf(c_321,plain,
divide(X0,multiply(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_75,c_284]) ).
cnf(c_323,plain,
divide(multiply(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_224,c_284]) ).
cnf(c_343,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_230,c_323]) ).
cnf(c_345,plain,
multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_323,c_75]) ).
cnf(c_347,plain,
multiply(divide(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_345,c_272]) ).
cnf(c_361,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_224,c_347]) ).
cnf(c_362,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_284,c_347]) ).
cnf(c_365,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(backward_subsumption_resolution,[status(thm)],[c_254,c_361]) ).
cnf(c_369,plain,
multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
inference(demodulation,[status(thm)],[c_365,c_361]) ).
cnf(c_393,plain,
divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_272,c_224]) ).
cnf(c_419,plain,
divide(X0,multiply(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_361,c_321]) ).
cnf(c_433,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_362,c_321]) ).
cnf(c_445,plain,
divide(X0,inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_255,c_343]) ).
cnf(c_487,plain,
divide(inverse(X0),X1) = inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_419,c_393]) ).
cnf(c_506,plain,
divide(X0,divide(X1,X2)) = multiply(divide(X2,X1),X0),
inference(superposition,[status(thm)],[c_433,c_343]) ).
cnf(c_699,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_487,c_75]) ).
cnf(c_716,plain,
multiply(divide(X0,X1),multiply(divide(X2,X0),X1)) = X2,
inference(demodulation,[status(thm)],[c_179,c_361,c_506]) ).
cnf(c_751,plain,
divide(X0,divide(X1,X2)) = multiply(divide(X0,X1),X2),
inference(superposition,[status(thm)],[c_716,c_224]) ).
cnf(c_1320,plain,
multiply(multiply(X0,X1),X2) = multiply(X1,multiply(X0,X2)),
inference(demodulation,[status(thm)],[c_699,c_445,c_751]) ).
cnf(c_1332,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_361,c_1320]) ).
cnf(c_1346,plain,
multiply(X0,multiply(X1,X2)) = multiply(X2,multiply(X1,X0)),
inference(superposition,[status(thm)],[c_1320,c_361]) ).
cnf(c_1352,plain,
multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(a3,c3)),
inference(demodulation,[status(thm)],[c_369,c_1346]) ).
cnf(c_2252,plain,
multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_1332,c_1320]) ).
cnf(c_2258,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1352,c_2252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP091-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 23:43:47 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.16 % SZS status Started for theBenchmark.p
% 0.47/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.16
% 0.47/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.16
% 0.47/1.16 ------ iProver source info
% 0.47/1.16
% 0.47/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.16 git: non_committed_changes: false
% 0.47/1.16 git: last_make_outside_of_git: false
% 0.47/1.16
% 0.47/1.16 ------ Parsing...successful
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.47/1.16 ------ Proving...
% 0.47/1.16 ------ Problem Properties
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 clauses 5
% 0.47/1.16 conjectures 1
% 0.47/1.16 EPR 0
% 0.47/1.16 Horn 5
% 0.47/1.16 unary 4
% 0.47/1.16 binary 0
% 0.47/1.16 lits 8
% 0.47/1.16 lits eq 8
% 0.47/1.16 fd_pure 0
% 0.47/1.16 fd_pseudo 0
% 0.47/1.16 fd_cond 0
% 0.47/1.16 fd_pseudo_cond 0
% 0.47/1.16 AC symbols 0
% 0.47/1.16
% 0.47/1.16 ------ Schedule dynamic 5 is on
% 0.47/1.16
% 0.47/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------
% 0.47/1.16 Current options:
% 0.47/1.16 ------
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------ Proving...
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.16
% 0.47/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.16
% 0.47/1.16
%------------------------------------------------------------------------------