TSTP Solution File: GRP564-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP564-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:56 EDT 2024
% Result : Unsatisfiable 3.46s 1.13s
% Output : CNFRefutation 3.46s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = 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(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(c_60,plain,
divide(divide(multiply(X0,X1),X2),divide(X0,X2)) = X1,
inference(light_normalisation,[status(thm)],[c_49,c_50]) ).
cnf(c_66,plain,
multiply(a,b) = sP0_iProver_def,
definition ).
cnf(c_67,plain,
multiply(b,a) = sP1_iProver_def,
definition ).
cnf(c_68,negated_conjecture,
sP0_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_51,c_67,c_66]) ).
cnf(c_106,plain,
divide(multiply(multiply(X0,X1),X2),divide(X0,inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_107,plain,
divide(divide(sP0_iProver_def,X0),divide(a,X0)) = b,
inference(superposition,[status(thm)],[c_66,c_60]) ).
cnf(c_110,plain,
divide(divide(multiply(divide(multiply(X0,X1),X2),X3),divide(X0,X2)),X1) = X3,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_119,plain,
divide(divide(multiply(divide(sP0_iProver_def,X0),X1),divide(a,X0)),b) = X1,
inference(superposition,[status(thm)],[c_107,c_60]) ).
cnf(c_143,plain,
divide(multiply(multiply(X0,X1),X2),multiply(X0,X2)) = X1,
inference(demodulation,[status(thm)],[c_106,c_50]) ).
cnf(c_145,plain,
divide(multiply(sP1_iProver_def,X0),multiply(b,X0)) = a,
inference(superposition,[status(thm)],[c_67,c_143]) ).
cnf(c_188,plain,
divide(a,divide(sP1_iProver_def,multiply(b,X0))) = X0,
inference(superposition,[status(thm)],[c_145,c_60]) ).
cnf(c_241,plain,
divide(divide(sP0_iProver_def,divide(sP1_iProver_def,multiply(b,X0))),X0) = b,
inference(superposition,[status(thm)],[c_188,c_107]) ).
cnf(c_344,plain,
multiply(divide(sP0_iProver_def,divide(sP1_iProver_def,multiply(b,inverse(X0)))),X0) = b,
inference(superposition,[status(thm)],[c_241,c_50]) ).
cnf(c_449,plain,
divide(divide(b,divide(a,divide(sP1_iProver_def,multiply(b,inverse(X0))))),b) = X0,
inference(superposition,[status(thm)],[c_344,c_119]) ).
cnf(c_1134,plain,
divide(multiply(b,X0),b) = X0,
inference(demodulation,[status(thm)],[c_449,c_50,c_188]) ).
cnf(c_1135,plain,
divide(sP1_iProver_def,b) = a,
inference(superposition,[status(thm)],[c_67,c_1134]) ).
cnf(c_1139,plain,
divide(X0,divide(b,b)) = X0,
inference(superposition,[status(thm)],[c_1134,c_60]) ).
cnf(c_1211,plain,
divide(multiply(divide(multiply(b,X0),b),X1),X0) = X1,
inference(superposition,[status(thm)],[c_1139,c_110]) ).
cnf(c_1225,plain,
divide(multiply(X0,X1),X0) = X1,
inference(light_normalisation,[status(thm)],[c_1211,c_1134]) ).
cnf(c_1318,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_1225,c_50]) ).
cnf(c_1322,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_1225,c_60]) ).
cnf(c_1449,plain,
multiply(divide(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_1322,c_1225]) ).
cnf(c_1879,plain,
divide(multiply(multiply(divide(X0,X0),X1),X2),X2) = X1,
inference(superposition,[status(thm)],[c_1449,c_143]) ).
cnf(c_1893,plain,
divide(multiply(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_1879,c_1449]) ).
cnf(c_1992,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_1318,c_1893]) ).
cnf(c_2023,plain,
multiply(divide(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_1318,c_1992]) ).
cnf(c_2482,plain,
multiply(a,b) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_1135,c_2023]) ).
cnf(c_2501,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_2482,c_66]) ).
cnf(c_2502,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2501,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP564-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n023.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 : Fri May 3 00:19:24 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.46/1.13 % SZS status Started for theBenchmark.p
% 3.46/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.46/1.13
% 3.46/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.46/1.13
% 3.46/1.13 ------ iProver source info
% 3.46/1.13
% 3.46/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.46/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.46/1.13 git: non_committed_changes: false
% 3.46/1.13
% 3.46/1.13 ------ Parsing...successful
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.46/1.13
% 3.46/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.46/1.13
% 3.46/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.46/1.13 ------ Proving...
% 3.46/1.13 ------ Problem Properties
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13 clauses 5
% 3.46/1.13 conjectures 1
% 3.46/1.13 EPR 1
% 3.46/1.13 Horn 5
% 3.46/1.13 unary 5
% 3.46/1.13 binary 0
% 3.46/1.13 lits 5
% 3.46/1.13 lits eq 5
% 3.46/1.13 fd_pure 0
% 3.46/1.13 fd_pseudo 0
% 3.46/1.13 fd_cond 0
% 3.46/1.13 fd_pseudo_cond 0
% 3.46/1.13 AC symbols 0
% 3.46/1.13
% 3.46/1.13 ------ Input Options Time Limit: Unbounded
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13 ------
% 3.46/1.13 Current options:
% 3.46/1.13 ------
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13 ------ Proving...
% 3.46/1.13
% 3.46/1.13
% 3.46/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.46/1.13
% 3.46/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.46/1.13
% 3.46/1.13
%------------------------------------------------------------------------------