TSTP Solution File: GRP547-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP547-1 : TPTP v8.1.2. Released v2.6.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 : Fri May 3 02:22:53 EDT 2024
% Result : Unsatisfiable 0.48s 1.17s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(identity,divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
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(inverse(divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
inference(demodulation,[status(thm)],[c_49,c_51]) ).
cnf(c_77,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_78,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_79,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_80,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_81,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_79,c_80,c_77,c_78]) ).
cnf(c_133,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_137,plain,
divide(X0,identity) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_133,c_68]) ).
cnf(c_138,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_68,c_51]) ).
cnf(c_145,plain,
divide(inverse(multiply(X0,X1)),divide(divide(inverse(X1),X2),X0)) = X2,
inference(superposition,[status(thm)],[c_68,c_69]) ).
cnf(c_148,plain,
divide(inverse(divide(inverse(X0),X1)),multiply(divide(X1,X2),X0)) = X2,
inference(superposition,[status(thm)],[c_68,c_69]) ).
cnf(c_150,plain,
divide(inverse(divide(X0,X1)),divide(identity,X0)) = X1,
inference(superposition,[status(thm)],[c_52,c_69]) ).
cnf(c_155,plain,
divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
inference(light_normalisation,[status(thm)],[c_150,c_51]) ).
cnf(c_188,plain,
multiply(inverse(divide(X0,X1)),X0) = X1,
inference(demodulation,[status(thm)],[c_155,c_68]) ).
cnf(c_190,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_51,c_188]) ).
cnf(c_191,plain,
multiply(inverse(identity),X0) = X0,
inference(superposition,[status(thm)],[c_52,c_188]) ).
cnf(c_195,plain,
multiply(identity,X0) = X0,
inference(light_normalisation,[status(thm)],[c_191,c_133]) ).
cnf(c_196,plain,
multiply(multiply(identity,X0),identity) = X0,
inference(light_normalisation,[status(thm)],[c_190,c_138]) ).
cnf(c_200,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_138,c_195]) ).
cnf(c_227,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_200,c_68]) ).
cnf(c_229,plain,
divide(X0,identity) = X0,
inference(light_normalisation,[status(thm)],[c_196,c_137,c_195]) ).
cnf(c_235,plain,
divide(inverse(divide(identity,X0)),divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_229,c_69]) ).
cnf(c_237,plain,
divide(X0,divide(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_235,c_51,c_200]) ).
cnf(c_251,plain,
divide(X0,multiply(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_68,c_237]) ).
cnf(c_252,plain,
divide(inverse(divide(X0,X1)),X2) = divide(divide(X1,X2),X0),
inference(superposition,[status(thm)],[c_69,c_237]) ).
cnf(c_254,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_237,c_188]) ).
cnf(c_275,plain,
divide(inverse(sP0_iProver_def),divide(divide(inverse(b3),X0),a3)) = X0,
inference(superposition,[status(thm)],[c_77,c_145]) ).
cnf(c_393,plain,
divide(X0,inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_200,c_254]) ).
cnf(c_396,plain,
divide(inverse(X0),X1) = divide(inverse(X1),X0),
inference(superposition,[status(thm)],[c_254,c_227]) ).
cnf(c_405,plain,
divide(X0,multiply(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_393,c_237]) ).
cnf(c_408,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_393,c_68]) ).
cnf(c_412,plain,
multiply(sP2_iProver_def,a3) = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_80,c_408]) ).
cnf(c_455,plain,
multiply(X0,divide(X1,multiply(divide(X1,X2),X0))) = X2,
inference(demodulation,[status(thm)],[c_148,c_252,c_393]) ).
cnf(c_465,plain,
multiply(X0,divide(X1,multiply(identity,X0))) = X1,
inference(superposition,[status(thm)],[c_52,c_455]) ).
cnf(c_480,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(light_normalisation,[status(thm)],[c_465,c_195]) ).
cnf(c_537,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_68,c_480]) ).
cnf(c_546,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_480,c_251]) ).
cnf(c_571,plain,
divide(multiply(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_537,c_254]) ).
cnf(c_582,plain,
divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_254,c_571]) ).
cnf(c_870,plain,
divide(c3,sP1_iProver_def) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_78,c_405]) ).
cnf(c_891,plain,
divide(c3,inverse(sP0_iProver_def)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_870,c_237]) ).
cnf(c_901,plain,
divide(inverse(X0),X1) = inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_393,c_546]) ).
cnf(c_1312,plain,
divide(inverse(X0),divide(X1,X2)) = divide(divide(X2,X1),X0),
inference(superposition,[status(thm)],[c_546,c_396]) ).
cnf(c_1363,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(multiply(X1,X2),X0),
inference(superposition,[status(thm)],[c_901,c_393]) ).
cnf(c_1375,plain,
divide(multiply(a3,multiply(b3,X0)),sP0_iProver_def) = X0,
inference(demodulation,[status(thm)],[c_275,c_408,c_1312,c_1363]) ).
cnf(c_1377,plain,
divide(multiply(a3,sP2_iProver_def),sP0_iProver_def) = c3,
inference(superposition,[status(thm)],[c_79,c_1375]) ).
cnf(c_1404,plain,
divide(sP3_iProver_def,sP0_iProver_def) = c3,
inference(demodulation,[status(thm)],[c_1377,c_408,c_412]) ).
cnf(c_1405,plain,
divide(c3,sP3_iProver_def) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_1404,c_582]) ).
cnf(c_1414,plain,
divide(c3,inverse(sP0_iProver_def)) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_1405,c_237]) ).
cnf(c_1415,plain,
sP1_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_1414,c_891]) ).
cnf(c_1416,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1415,c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP547-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/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 : Fri May 3 00:01:01 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 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
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...successful
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 9
% 0.48/1.17 conjectures 1
% 0.48/1.17 EPR 1
% 0.48/1.17 Horn 9
% 0.48/1.17 unary 9
% 0.48/1.17 binary 0
% 0.48/1.17 lits 9
% 0.48/1.17 lits eq 9
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 0
% 0.48/1.17 fd_pseudo_cond 0
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Input Options Time Limit: Unbounded
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.17
%------------------------------------------------------------------------------