TSTP Solution File: GRP446-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP446-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 3.44s 1.22s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(divide(X0,X0),X1) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/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(divide(divide(X0,X0),X0),X2))) = X1,
inference(light_normalisation,[status(thm)],[c_49,c_51]) ).
cnf(c_66,plain,
divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(demodulation,[status(thm)],[c_65,c_51]) ).
cnf(c_74,plain,
inverse(b2) = sP0_iProver_def,
definition ).
cnf(c_75,plain,
multiply(sP0_iProver_def,b2) = sP1_iProver_def,
definition ).
cnf(c_76,plain,
multiply(sP1_iProver_def,a2) = sP2_iProver_def,
definition ).
cnf(c_77,negated_conjecture,
sP2_iProver_def != a2,
inference(demodulation,[status(thm)],[c_52,c_74,c_75,c_76]) ).
cnf(c_125,plain,
divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_51,c_51]) ).
cnf(c_129,plain,
divide(X0,sP0_iProver_def) = multiply(X0,b2),
inference(superposition,[status(thm)],[c_74,c_64]) ).
cnf(c_132,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_75,c_129]) ).
cnf(c_136,plain,
divide(sP1_iProver_def,X0) = inverse(X0),
inference(superposition,[status(thm)],[c_132,c_51]) ).
cnf(c_139,plain,
divide(inverse(sP1_iProver_def),X0) = inverse(X0),
inference(superposition,[status(thm)],[c_136,c_51]) ).
cnf(c_140,plain,
multiply(sP1_iProver_def,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_136,c_64]) ).
cnf(c_145,plain,
divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_51,c_66]) ).
cnf(c_171,plain,
divide(X0,divide(inverse(X1),divide(inverse(X0),X1))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_139,c_66]) ).
cnf(c_238,plain,
divide(X0,divide(inverse(X1),divide(inverse(X0),X1))) = divide(X2,X2),
inference(superposition,[status(thm)],[c_125,c_66]) ).
cnf(c_241,plain,
divide(X0,X0) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_238,c_171]) ).
cnf(c_271,plain,
divide(X0,sP1_iProver_def) = X0,
inference(superposition,[status(thm)],[c_241,c_66]) ).
cnf(c_272,plain,
inverse(sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_241,c_136]) ).
cnf(c_294,plain,
divide(X0,sP1_iProver_def) = multiply(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_272,c_64]) ).
cnf(c_295,plain,
multiply(X0,sP1_iProver_def) = X0,
inference(light_normalisation,[status(thm)],[c_294,c_271]) ).
cnf(c_348,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_145,c_64]) ).
cnf(c_351,plain,
multiply(X0,inverse(X0)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_295,c_348]) ).
cnf(c_375,plain,
multiply(X0,sP1_iProver_def) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_351,c_348]) ).
cnf(c_376,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_375,c_140,c_295]) ).
cnf(c_377,plain,
multiply(sP1_iProver_def,X0) = X0,
inference(demodulation,[status(thm)],[c_140,c_376]) ).
cnf(c_378,plain,
a2 = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_76,c_377]) ).
cnf(c_380,plain,
sP2_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_77,c_378]) ).
cnf(c_381,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP446-1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 300
% 0.20/0.35 % DateTime : Fri May 3 00:16:36 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.44/1.22 % SZS status Started for theBenchmark.p
% 3.44/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 3.44/1.22
% 3.44/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.44/1.22
% 3.44/1.22 ------ iProver source info
% 3.44/1.22
% 3.44/1.22 git: date: 2024-05-02 19:28:25 +0000
% 3.44/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.44/1.22 git: non_committed_changes: false
% 3.44/1.22
% 3.44/1.22 ------ Parsing...successful
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.44/1.22
% 3.44/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.44/1.22
% 3.44/1.22 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.44/1.22 ------ Proving...
% 3.44/1.22 ------ Problem Properties
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 clauses 7
% 3.44/1.22 conjectures 1
% 3.44/1.22 EPR 1
% 3.44/1.22 Horn 7
% 3.44/1.22 unary 7
% 3.44/1.22 binary 0
% 3.44/1.22 lits 7
% 3.44/1.22 lits eq 7
% 3.44/1.22 fd_pure 0
% 3.44/1.22 fd_pseudo 0
% 3.44/1.22 fd_cond 0
% 3.44/1.22 fd_pseudo_cond 0
% 3.44/1.22 AC symbols 0
% 3.44/1.22
% 3.44/1.22 ------ Input Options Time Limit: Unbounded
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 ------
% 3.44/1.22 Current options:
% 3.44/1.22 ------
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 ------ Proving...
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 3.44/1.22
% 3.44/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.44/1.22
% 3.44/1.22
%------------------------------------------------------------------------------