TSTP Solution File: GRP522-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP522-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:49 EDT 2024
% Result : Unsatisfiable 2.36s 1.10s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
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_71,plain,
inverse(b2) = sP0_iProver_def,
definition ).
cnf(c_72,plain,
multiply(sP0_iProver_def,b2) = sP1_iProver_def,
definition ).
cnf(c_73,plain,
multiply(sP1_iProver_def,a2) = sP2_iProver_def,
definition ).
cnf(c_74,negated_conjecture,
sP2_iProver_def != a2,
inference(demodulation,[status(thm)],[c_52,c_71,c_72,c_73]) ).
cnf(c_126,plain,
divide(X0,sP0_iProver_def) = multiply(X0,b2),
inference(superposition,[status(thm)],[c_71,c_64]) ).
cnf(c_127,plain,
divide(multiply(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_64,c_51]) ).
cnf(c_129,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_72,c_126]) ).
cnf(c_133,plain,
divide(sP1_iProver_def,X0) = inverse(X0),
inference(superposition,[status(thm)],[c_129,c_51]) ).
cnf(c_136,plain,
divide(inverse(sP1_iProver_def),X0) = inverse(X0),
inference(superposition,[status(thm)],[c_133,c_51]) ).
cnf(c_137,plain,
multiply(sP1_iProver_def,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_133,c_64]) ).
cnf(c_163,plain,
divide(X0,divide(X1,inverse(divide(X0,X1)))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_133,c_49]) ).
cnf(c_174,plain,
inverse(divide(X0,divide(X1,divide(sP1_iProver_def,X0)))) = X1,
inference(superposition,[status(thm)],[c_49,c_133]) ).
cnf(c_175,plain,
inverse(divide(X0,divide(X1,inverse(X0)))) = X1,
inference(light_normalisation,[status(thm)],[c_174,c_133]) ).
cnf(c_217,plain,
divide(X0,divide(X1,inverse(divide(X0,X1)))) = inverse(sP1_iProver_def),
inference(superposition,[status(thm)],[c_136,c_49]) ).
cnf(c_226,plain,
inverse(sP1_iProver_def) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_217,c_163]) ).
cnf(c_238,plain,
divide(X0,sP1_iProver_def) = multiply(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_226,c_64]) ).
cnf(c_273,plain,
divide(X0,divide(X1,inverse(divide(X0,X1)))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_127,c_49]) ).
cnf(c_282,plain,
multiply(inverse(X0),X0) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_273,c_163]) ).
cnf(c_365,plain,
inverse(divide(X0,multiply(X1,X0))) = X1,
inference(demodulation,[status(thm)],[c_175,c_64]) ).
cnf(c_368,plain,
inverse(inverse(multiply(X0,sP1_iProver_def))) = X0,
inference(superposition,[status(thm)],[c_133,c_365]) ).
cnf(c_372,plain,
inverse(divide(X0,sP1_iProver_def)) = inverse(X0),
inference(superposition,[status(thm)],[c_282,c_365]) ).
cnf(c_380,plain,
inverse(inverse(divide(X0,sP1_iProver_def))) = X0,
inference(light_normalisation,[status(thm)],[c_368,c_238]) ).
cnf(c_542,plain,
multiply(sP1_iProver_def,X0) = X0,
inference(light_normalisation,[status(thm)],[c_380,c_137,c_372]) ).
cnf(c_546,plain,
a2 = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_73,c_542]) ).
cnf(c_549,plain,
sP2_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_74,c_546]) ).
cnf(c_550,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_549]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP522-1 : TPTP v8.1.2. Released v2.6.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n004.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 23:54:03 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running UEQ theorem proving
% 0.16/0.42 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
% 2.36/1.10 % SZS status Started for theBenchmark.p
% 2.36/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.36/1.10
% 2.36/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.36/1.10
% 2.36/1.10 ------ iProver source info
% 2.36/1.10
% 2.36/1.10 git: date: 2024-05-02 19:28:25 +0000
% 2.36/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.36/1.10 git: non_committed_changes: false
% 2.36/1.10
% 2.36/1.10 ------ Parsing...successful
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.36/1.10
% 2.36/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.36/1.10
% 2.36/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.36/1.10 ------ Proving...
% 2.36/1.10 ------ Problem Properties
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10 clauses 7
% 2.36/1.10 conjectures 1
% 2.36/1.10 EPR 1
% 2.36/1.10 Horn 7
% 2.36/1.10 unary 7
% 2.36/1.10 binary 0
% 2.36/1.10 lits 7
% 2.36/1.10 lits eq 7
% 2.36/1.10 fd_pure 0
% 2.36/1.10 fd_pseudo 0
% 2.36/1.10 fd_cond 0
% 2.36/1.10 fd_pseudo_cond 0
% 2.36/1.10 AC symbols 0
% 2.36/1.10
% 2.36/1.10 ------ Input Options Time Limit: Unbounded
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10 ------
% 2.36/1.10 Current options:
% 2.36/1.10 ------
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10 ------ Proving...
% 2.36/1.10
% 2.36/1.10
% 2.36/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.36/1.10
% 2.36/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.36/1.10
% 2.36/1.10
%------------------------------------------------------------------------------