TSTP Solution File: GRP449-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP449-1 : TPTP v8.1.2. Released v2.6.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 : Fri May 3 02:22:37 EDT 2024
% Result : Unsatisfiable 0.43s 1.11s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(divide(divide(X1,X1),X0),X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(divide(X0,X0),X1) = inverse(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_64,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_65,plain,
divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(demodulation,[status(thm)],[c_49,c_51]) ).
cnf(c_73,plain,
inverse(b2) = sP0_iProver_def,
definition ).
cnf(c_74,plain,
multiply(sP0_iProver_def,b2) = sP1_iProver_def,
definition ).
cnf(c_75,plain,
multiply(sP1_iProver_def,a2) = sP2_iProver_def,
definition ).
cnf(c_76,negated_conjecture,
sP2_iProver_def != a2,
inference(demodulation,[status(thm)],[c_52,c_73,c_74,c_75]) ).
cnf(c_124,plain,
divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_51,c_51]) ).
cnf(c_128,plain,
divide(X0,sP0_iProver_def) = multiply(X0,b2),
inference(superposition,[status(thm)],[c_73,c_64]) ).
cnf(c_131,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_74,c_128]) ).
cnf(c_135,plain,
divide(sP1_iProver_def,X0) = inverse(X0),
inference(superposition,[status(thm)],[c_131,c_51]) ).
cnf(c_138,plain,
divide(inverse(sP1_iProver_def),X0) = inverse(X0),
inference(superposition,[status(thm)],[c_135,c_51]) ).
cnf(c_139,plain,
multiply(sP1_iProver_def,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_135,c_64]) ).
cnf(c_144,plain,
divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_51,c_65]) ).
cnf(c_170,plain,
divide(X0,divide(inverse(X1),divide(inverse(X0),X1))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_138,c_65]) ).
cnf(c_237,plain,
divide(X0,divide(inverse(X1),divide(inverse(X0),X1))) = divide(X2,X2),
inference(superposition,[status(thm)],[c_124,c_65]) ).
cnf(c_240,plain,
divide(X0,X0) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_237,c_170]) ).
cnf(c_270,plain,
divide(X0,sP1_iProver_def) = X0,
inference(superposition,[status(thm)],[c_240,c_65]) ).
cnf(c_271,plain,
inverse(sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_240,c_135]) ).
cnf(c_293,plain,
divide(X0,sP1_iProver_def) = multiply(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_271,c_64]) ).
cnf(c_294,plain,
multiply(X0,sP1_iProver_def) = X0,
inference(light_normalisation,[status(thm)],[c_293,c_270]) ).
cnf(c_347,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_144,c_64]) ).
cnf(c_350,plain,
multiply(X0,inverse(X0)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_294,c_347]) ).
cnf(c_374,plain,
multiply(X0,sP1_iProver_def) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_350,c_347]) ).
cnf(c_375,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_374,c_139,c_294]) ).
cnf(c_376,plain,
multiply(sP1_iProver_def,X0) = X0,
inference(demodulation,[status(thm)],[c_139,c_375]) ).
cnf(c_377,plain,
a2 = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_75,c_376]) ).
cnf(c_379,plain,
sP2_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_76,c_377]) ).
cnf(c_380,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_379]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP449-1 : TPTP v8.1.2. Released v2.6.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 23:37:04 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running UEQ theorem proving
% 0.16/0.43 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.43/1.11 % SZS status Started for theBenchmark.p
% 0.43/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.11
% 0.43/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.11
% 0.43/1.11 ------ iProver source info
% 0.43/1.11
% 0.43/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.11 git: non_committed_changes: false
% 0.43/1.11
% 0.43/1.11 ------ Parsing...successful
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.43/1.11
% 0.43/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.11
% 0.43/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.43/1.11 ------ Proving...
% 0.43/1.11 ------ Problem Properties
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 clauses 7
% 0.43/1.11 conjectures 1
% 0.43/1.11 EPR 1
% 0.43/1.11 Horn 7
% 0.43/1.11 unary 7
% 0.43/1.11 binary 0
% 0.43/1.11 lits 7
% 0.43/1.11 lits eq 7
% 0.43/1.11 fd_pure 0
% 0.43/1.11 fd_pseudo 0
% 0.43/1.11 fd_cond 0
% 0.43/1.11 fd_pseudo_cond 0
% 0.43/1.11 AC symbols 0
% 0.43/1.11
% 0.43/1.11 ------ Input Options Time Limit: Unbounded
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 ------
% 0.43/1.11 Current options:
% 0.43/1.11 ------
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 ------ Proving...
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.11
% 0.43/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.11
% 0.43/1.11
%------------------------------------------------------------------------------