TSTP Solution File: GRP067-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP067-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:14 EDT 2023
% Result : Unsatisfiable 3.44s 1.14s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 44 ( 42 unt; 0 nHn; 5 RR)
% Number of literals : 47 ( 46 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(divide(X0,X0),divide(X0,divide(X1,divide(divide(identity,X0),X2)))),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(identity,X1)) = multiply(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(identity,X0) = inverse(X0),
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(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_72,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_73,plain,
divide(divide(identity,divide(X0,divide(X1,divide(inverse(X0),X2)))),X2) = X1,
inference(light_normalisation,[status(thm)],[c_49,c_51,c_52]) ).
cnf(c_74,plain,
divide(inverse(divide(X0,divide(X1,divide(inverse(X0),X2)))),X2) = X1,
inference(demodulation,[status(thm)],[c_73,c_51]) ).
cnf(c_135,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_139,plain,
divide(X0,identity) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_135,c_72]) ).
cnf(c_140,plain,
multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_72,c_52]) ).
cnf(c_141,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_72,c_51]) ).
cnf(c_142,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(identity,a2) != a2 ),
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_140]) ).
cnf(c_152,plain,
divide(inverse(inverse(divide(X0,divide(inverse(identity),X1)))),X1) = X0,
inference(superposition,[status(thm)],[c_51,c_74]) ).
cnf(c_156,plain,
divide(inverse(divide(X0,divide(X1,identity))),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_52,c_74]) ).
cnf(c_162,plain,
inverse(divide(X0,divide(X1,divide(inverse(X0),divide(inverse(X2),X3))))) = divide(inverse(divide(X2,X1)),X3),
inference(superposition,[status(thm)],[c_74,c_74]) ).
cnf(c_163,plain,
divide(inverse(inverse(divide(X0,divide(identity,X1)))),X1) = X0,
inference(light_normalisation,[status(thm)],[c_152,c_135]) ).
cnf(c_183,plain,
divide(X0,multiply(identity,X1)) = multiply(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_141,c_72]) ).
cnf(c_341,plain,
multiply(inverse(divide(X0,divide(X1,identity))),X0) = X1,
inference(demodulation,[status(thm)],[c_156,c_72]) ).
cnf(c_343,plain,
multiply(inverse(identity),divide(X0,identity)) = X0,
inference(superposition,[status(thm)],[c_52,c_341]) ).
cnf(c_352,plain,
multiply(identity,divide(X0,identity)) = X0,
inference(light_normalisation,[status(thm)],[c_343,c_135]) ).
cnf(c_519,plain,
divide(multiply(identity,multiply(X0,X1)),X1) = X0,
inference(demodulation,[status(thm)],[c_163,c_51,c_72,c_141]) ).
cnf(c_524,plain,
divide(multiply(identity,divide(X0,identity)),identity) = X0,
inference(superposition,[status(thm)],[c_139,c_519]) ).
cnf(c_532,plain,
multiply(identity,multiply(X0,identity)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_519,c_352]) ).
cnf(c_538,plain,
multiply(identity,X0) = X0,
inference(light_normalisation,[status(thm)],[c_532,c_139,c_352]) ).
cnf(c_539,plain,
divide(X0,identity) = X0,
inference(light_normalisation,[status(thm)],[c_524,c_352]) ).
cnf(c_547,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(backward_subsumption_resolution,[status(thm)],[c_142,c_538]) ).
cnf(c_554,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(demodulation,[status(thm)],[c_183,c_538]) ).
cnf(c_555,plain,
divide(multiply(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_519,c_538]) ).
cnf(c_578,plain,
divide(inverse(divide(X0,divide(X1,inverse(X0)))),identity) = X1,
inference(superposition,[status(thm)],[c_539,c_74]) ).
cnf(c_611,plain,
multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_555,c_72]) ).
cnf(c_614,plain,
multiply(divide(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_611,c_554]) ).
cnf(c_624,plain,
inverse(divide(X0,divide(X1,divide(inverse(X0),X2)))) = multiply(X1,X2),
inference(superposition,[status(thm)],[c_74,c_614]) ).
cnf(c_685,plain,
inverse(divide(X0,multiply(X1,X0))) = X1,
inference(demodulation,[status(thm)],[c_578,c_72,c_539]) ).
cnf(c_690,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_614,c_685]) ).
cnf(c_719,plain,
divide(inverse(X0),X1) = inverse(multiply(X1,X0)),
inference(superposition,[status(thm)],[c_72,c_690]) ).
cnf(c_829,plain,
multiply(X0,divide(inverse(X1),X2)) = divide(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_719,c_554]) ).
cnf(c_830,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_719,c_72]) ).
cnf(c_1335,plain,
divide(divide(X0,X1),X2) = divide(X0,multiply(X2,X1)),
inference(demodulation,[status(thm)],[c_162,c_624,c_690,c_829]) ).
cnf(c_1343,plain,
divide(X0,multiply(X1,inverse(X2))) = divide(multiply(X0,X2),X1),
inference(superposition,[status(thm)],[c_72,c_1335]) ).
cnf(c_1410,plain,
divide(multiply(X0,X1),X2) = divide(X0,divide(X2,X1)),
inference(demodulation,[status(thm)],[c_1343,c_554]) ).
cnf(c_1426,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(multiply(X0,X2),X1),
inference(superposition,[status(thm)],[c_1410,c_72]) ).
cnf(c_1436,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(light_normalisation,[status(thm)],[c_1426,c_830]) ).
cnf(c_1441,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_547,c_1436]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP067-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 00:00:02 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.44/1.14 % SZS status Started for theBenchmark.p
% 3.44/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.44/1.14
% 3.44/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.44/1.14
% 3.44/1.14 ------ iProver source info
% 3.44/1.14
% 3.44/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.44/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.44/1.14 git: non_committed_changes: false
% 3.44/1.14 git: last_make_outside_of_git: false
% 3.44/1.14
% 3.44/1.14 ------ Parsing...successful
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.44/1.14
% 3.44/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.44/1.14
% 3.44/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.44/1.14 ------ Proving...
% 3.44/1.14 ------ Problem Properties
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14 clauses 5
% 3.44/1.14 conjectures 1
% 3.44/1.14 EPR 0
% 3.44/1.14 Horn 5
% 3.44/1.14 unary 4
% 3.44/1.14 binary 0
% 3.44/1.14 lits 7
% 3.44/1.14 lits eq 7
% 3.44/1.14 fd_pure 0
% 3.44/1.14 fd_pseudo 0
% 3.44/1.14 fd_cond 0
% 3.44/1.14 fd_pseudo_cond 0
% 3.44/1.14 AC symbols 0
% 3.44/1.14
% 3.44/1.14 ------ Schedule dynamic 5 is on
% 3.44/1.14
% 3.44/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14 ------
% 3.44/1.14 Current options:
% 3.44/1.14 ------
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14 ------ Proving...
% 3.44/1.14
% 3.44/1.14
% 3.44/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.44/1.14
% 3.44/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.44/1.14
% 3.44/1.14
%------------------------------------------------------------------------------