TSTP Solution File: GRP459-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP459-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:22:39 EDT 2024
% Result : Unsatisfiable 3.37s 1.13s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(divide(X0,X0),divide(X0,divide(X1,divide(divide(identity,X0),X2)))),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(identity,X1)) = multiply(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(identity,X0) = inverse(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,plain,
divide(X0,X0) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(c_53,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_68,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_69,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_70,plain,
divide(inverse(divide(X0,divide(X1,divide(inverse(X0),X2)))),X2) = X1,
inference(demodulation,[status(thm)],[c_69,c_51]) ).
cnf(c_78,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_79,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_80,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_81,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_82,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_80,c_81,c_78,c_79]) ).
cnf(c_134,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_138,plain,
divide(X0,identity) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_134,c_68]) ).
cnf(c_139,plain,
multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_68,c_52]) ).
cnf(c_140,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_68,c_51]) ).
cnf(c_145,plain,
divide(inverse(inverse(divide(X0,divide(inverse(identity),X1)))),X1) = X0,
inference(superposition,[status(thm)],[c_51,c_70]) ).
cnf(c_146,plain,
divide(inverse(divide(X0,identity)),X1) = divide(inverse(X0),X1),
inference(superposition,[status(thm)],[c_52,c_70]) ).
cnf(c_150,plain,
divide(inverse(divide(X0,divide(X1,multiply(inverse(X0),X2)))),inverse(X2)) = X1,
inference(superposition,[status(thm)],[c_68,c_70]) ).
cnf(c_153,plain,
multiply(inverse(divide(X0,divide(X1,divide(inverse(X0),inverse(X2))))),X2) = X1,
inference(superposition,[status(thm)],[c_70,c_68]) ).
cnf(c_156,plain,
divide(inverse(inverse(divide(X0,divide(identity,X1)))),X1) = X0,
inference(light_normalisation,[status(thm)],[c_145,c_134]) ).
cnf(c_166,plain,
multiply(identity,identity) = identity,
inference(superposition,[status(thm)],[c_134,c_139]) ).
cnf(c_171,plain,
multiply(identity,inverse(X0)) = inverse(multiply(identity,X0)),
inference(superposition,[status(thm)],[c_140,c_140]) ).
cnf(c_175,plain,
divide(X0,multiply(identity,X1)) = multiply(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_140,c_68]) ).
cnf(c_192,plain,
divide(inverse(divide(multiply(identity,X0),divide(X1,divide(multiply(identity,inverse(X0)),X2)))),X2) = X1,
inference(superposition,[status(thm)],[c_171,c_70]) ).
cnf(c_241,plain,
divide(inverse(X0),inverse(divide(X0,identity))) = identity,
inference(superposition,[status(thm)],[c_146,c_52]) ).
cnf(c_266,plain,
multiply(inverse(X0),divide(X0,identity)) = identity,
inference(demodulation,[status(thm)],[c_241,c_68]) ).
cnf(c_308,plain,
multiply(inverse(divide(X0,divide(X1,multiply(inverse(X0),X2)))),X2) = X1,
inference(demodulation,[status(thm)],[c_150,c_68]) ).
cnf(c_310,plain,
multiply(inverse(inverse(divide(X0,multiply(inverse(identity),X1)))),X1) = X0,
inference(superposition,[status(thm)],[c_51,c_308]) ).
cnf(c_326,plain,
multiply(inverse(inverse(multiply(X0,inverse(X1)))),X1) = X0,
inference(light_normalisation,[status(thm)],[c_310,c_134,c_175]) ).
cnf(c_389,plain,
multiply(multiply(identity,multiply(X0,inverse(X1))),X1) = X0,
inference(demodulation,[status(thm)],[c_326,c_140]) ).
cnf(c_398,plain,
divide(multiply(identity,multiply(X0,inverse(identity))),identity) = X0,
inference(superposition,[status(thm)],[c_389,c_138]) ).
cnf(c_403,plain,
divide(multiply(identity,divide(X0,identity)),identity) = X0,
inference(light_normalisation,[status(thm)],[c_398,c_134,c_138]) ).
cnf(c_421,plain,
divide(multiply(identity,multiply(X0,X1)),X1) = X0,
inference(demodulation,[status(thm)],[c_156,c_51,c_68,c_140]) ).
cnf(c_432,plain,
divide(multiply(identity,identity),divide(X0,identity)) = inverse(X0),
inference(superposition,[status(thm)],[c_266,c_421]) ).
cnf(c_434,plain,
inverse(divide(X0,divide(X1,multiply(inverse(X0),X2)))) = divide(multiply(identity,X1),X2),
inference(superposition,[status(thm)],[c_308,c_421]) ).
cnf(c_444,plain,
divide(identity,divide(X0,identity)) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_432,c_166]) ).
cnf(c_481,plain,
inverse(divide(X0,identity)) = inverse(X0),
inference(demodulation,[status(thm)],[c_444,c_51]) ).
cnf(c_493,plain,
multiply(X0,divide(X1,identity)) = divide(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_481,c_68]) ).
cnf(c_497,plain,
multiply(X0,divide(X1,identity)) = multiply(X0,X1),
inference(light_normalisation,[status(thm)],[c_493,c_68]) ).
cnf(c_506,plain,
divide(multiply(identity,X0),identity) = X0,
inference(demodulation,[status(thm)],[c_403,c_497]) ).
cnf(c_510,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_506,c_421]) ).
cnf(c_511,plain,
divide(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_138,c_510]) ).
cnf(c_513,plain,
multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_506,c_511]) ).
cnf(c_517,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_140,c_513]) ).
cnf(c_518,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(demodulation,[status(thm)],[c_175,c_513]) ).
cnf(c_542,plain,
divide(inverse(divide(X0,divide(X1,inverse(X0)))),identity) = X1,
inference(superposition,[status(thm)],[c_511,c_70]) ).
cnf(c_551,plain,
multiply(divide(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_153,c_68,c_434,c_513]) ).
cnf(c_568,plain,
inverse(divide(X0,multiply(X1,X0))) = X1,
inference(demodulation,[status(thm)],[c_542,c_68,c_511]) ).
cnf(c_577,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_551,c_568]) ).
cnf(c_638,plain,
divide(inverse(X0),X1) = inverse(multiply(X1,X0)),
inference(superposition,[status(thm)],[c_68,c_577]) ).
cnf(c_698,plain,
divide(inverse(c3),b3) = inverse(sP2_iProver_def),
inference(superposition,[status(thm)],[c_80,c_638]) ).
cnf(c_699,plain,
divide(inverse(c3),sP0_iProver_def) = inverse(sP1_iProver_def),
inference(superposition,[status(thm)],[c_79,c_638]) ).
cnf(c_700,plain,
divide(inverse(sP2_iProver_def),a3) = inverse(sP3_iProver_def),
inference(superposition,[status(thm)],[c_81,c_638]) ).
cnf(c_713,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_638,c_68]) ).
cnf(c_770,plain,
divide(sP0_iProver_def,inverse(c3)) = inverse(inverse(sP1_iProver_def)),
inference(superposition,[status(thm)],[c_699,c_577]) ).
cnf(c_772,plain,
divide(a3,inverse(sP2_iProver_def)) = inverse(inverse(sP3_iProver_def)),
inference(superposition,[status(thm)],[c_700,c_577]) ).
cnf(c_962,plain,
divide(inverse(divide(X0,divide(X1,divide(multiply(identity,inverse(X0)),X2)))),X2) = X1,
inference(light_normalisation,[status(thm)],[c_192,c_513]) ).
cnf(c_963,plain,
divide(divide(multiply(X0,multiply(X1,X2)),X2),X1) = X0,
inference(demodulation,[status(thm)],[c_962,c_513,c_577,c_713]) ).
cnf(c_972,plain,
divide(divide(X0,X1),X2) = divide(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_551,c_963]) ).
cnf(c_1651,plain,
divide(X0,multiply(X1,inverse(X2))) = divide(multiply(X0,X2),X1),
inference(superposition,[status(thm)],[c_68,c_972]) ).
cnf(c_1791,plain,
divide(multiply(X0,X1),X2) = divide(X0,divide(X2,X1)),
inference(demodulation,[status(thm)],[c_1651,c_518]) ).
cnf(c_1799,plain,
divide(a3,divide(X0,b3)) = divide(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_78,c_1791]) ).
cnf(c_1911,plain,
divide(a3,inverse(sP2_iProver_def)) = divide(sP0_iProver_def,inverse(c3)),
inference(superposition,[status(thm)],[c_698,c_1799]) ).
cnf(c_1923,plain,
inverse(inverse(sP1_iProver_def)) = inverse(inverse(sP3_iProver_def)),
inference(light_normalisation,[status(thm)],[c_1911,c_770,c_772]) ).
cnf(c_1971,plain,
sP1_iProver_def = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_1923,c_517]) ).
cnf(c_1972,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1971,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP459-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n010.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:28:04 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_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.37/1.13 % SZS status Started for theBenchmark.p
% 3.37/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.37/1.13
% 3.37/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.37/1.13
% 3.37/1.13 ------ iProver source info
% 3.37/1.13
% 3.37/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.37/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.37/1.13 git: non_committed_changes: false
% 3.37/1.13
% 3.37/1.13 ------ Parsing...successful
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.37/1.13 ------ Proving...
% 3.37/1.13 ------ Problem Properties
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 clauses 9
% 3.37/1.13 conjectures 1
% 3.37/1.13 EPR 1
% 3.37/1.13 Horn 9
% 3.37/1.13 unary 9
% 3.37/1.13 binary 0
% 3.37/1.13 lits 9
% 3.37/1.13 lits eq 9
% 3.37/1.13 fd_pure 0
% 3.37/1.13 fd_pseudo 0
% 3.37/1.13 fd_cond 0
% 3.37/1.13 fd_pseudo_cond 0
% 3.37/1.13 AC symbols 0
% 3.37/1.13
% 3.37/1.13 ------ Input Options Time Limit: Unbounded
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------
% 3.37/1.13 Current options:
% 3.37/1.13 ------
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Proving...
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.37/1.13
% 3.37/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.37/1.13
% 3.37/1.14
%------------------------------------------------------------------------------