TSTP Solution File: GRP523-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP523-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 3.63s 1.15s
% Output : CNFRefutation 3.63s
% 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(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_64,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_70,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_71,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_72,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_73,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_74,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_52,c_72,c_73,c_70,c_71]) ).
cnf(c_118,plain,
divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_51,c_51]) ).
cnf(c_122,plain,
divide(multiply(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_64,c_51]) ).
cnf(c_123,plain,
multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_64,c_51]) ).
cnf(c_132,plain,
multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_118,c_64]) ).
cnf(c_157,plain,
divide(multiply(inverse(X0),X0),divide(X1,divide(X2,inverse(X1)))) = X2,
inference(superposition,[status(thm)],[c_122,c_49]) ).
cnf(c_159,plain,
divide(X0,divide(divide(X1,divide(X2,X0)),X1)) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_371,plain,
divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_51,c_159]) ).
cnf(c_393,plain,
divide(divide(X0,X1),divide(X2,X1)) = divide(X0,X2),
inference(superposition,[status(thm)],[c_159,c_49]) ).
cnf(c_505,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(demodulation,[status(thm)],[c_371,c_64]) ).
cnf(c_510,plain,
multiply(X0,inverse(X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_51,c_505]) ).
cnf(c_511,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_64,c_505]) ).
cnf(c_574,plain,
divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_510,c_510]) ).
cnf(c_743,plain,
multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_574,c_505]) ).
cnf(c_837,plain,
multiply(inverse(b3),sP0_iProver_def) = a3,
inference(superposition,[status(thm)],[c_70,c_511]) ).
cnf(c_838,plain,
multiply(inverse(c3),sP2_iProver_def) = b3,
inference(superposition,[status(thm)],[c_72,c_511]) ).
cnf(c_839,plain,
multiply(inverse(c3),sP1_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_71,c_511]) ).
cnf(c_840,plain,
multiply(inverse(sP2_iProver_def),sP3_iProver_def) = a3,
inference(superposition,[status(thm)],[c_73,c_511]) ).
cnf(c_848,plain,
inverse(inverse(multiply(X0,divide(X1,X1)))) = X0,
inference(superposition,[status(thm)],[c_511,c_132]) ).
cnf(c_850,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_848,c_743]) ).
cnf(c_854,plain,
multiply(divide(X0,X0),X1) = X1,
inference(demodulation,[status(thm)],[c_123,c_850]) ).
cnf(c_976,plain,
multiply(inverse(sP1_iProver_def),sP0_iProver_def) = inverse(c3),
inference(superposition,[status(thm)],[c_839,c_511]) ).
cnf(c_1081,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_854,c_505]) ).
cnf(c_1135,plain,
divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_1081,c_49]) ).
cnf(c_1191,plain,
multiply(divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_1135,c_505]) ).
cnf(c_1248,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_1191,c_511]) ).
cnf(c_1253,plain,
divide(sP0_iProver_def,b3) = a3,
inference(demodulation,[status(thm)],[c_837,c_1248]) ).
cnf(c_1255,plain,
divide(sP2_iProver_def,c3) = b3,
inference(demodulation,[status(thm)],[c_838,c_1248]) ).
cnf(c_1257,plain,
divide(sP0_iProver_def,sP1_iProver_def) = inverse(c3),
inference(demodulation,[status(thm)],[c_976,c_1248]) ).
cnf(c_1259,plain,
divide(sP3_iProver_def,sP2_iProver_def) = a3,
inference(demodulation,[status(thm)],[c_840,c_1248]) ).
cnf(c_1266,plain,
divide(sP0_iProver_def,a3) = b3,
inference(superposition,[status(thm)],[c_1253,c_1135]) ).
cnf(c_1293,plain,
divide(sP2_iProver_def,b3) = c3,
inference(superposition,[status(thm)],[c_1255,c_1135]) ).
cnf(c_1296,plain,
divide(sP3_iProver_def,a3) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_1259,c_1135]) ).
cnf(c_1324,plain,
divide(sP0_iProver_def,inverse(c3)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_1257,c_1135]) ).
cnf(c_1332,plain,
inverse(divide(X0,multiply(X1,X0))) = X1,
inference(demodulation,[status(thm)],[c_157,c_51,c_64,c_1248]) ).
cnf(c_1343,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_1191,c_1332]) ).
cnf(c_1785,plain,
divide(sP2_iProver_def,divide(X0,a3)) = divide(sP3_iProver_def,X0),
inference(superposition,[status(thm)],[c_1296,c_393]) ).
cnf(c_2234,plain,
divide(sP2_iProver_def,b3) = divide(sP3_iProver_def,sP0_iProver_def),
inference(superposition,[status(thm)],[c_1266,c_1785]) ).
cnf(c_2244,plain,
divide(sP3_iProver_def,sP0_iProver_def) = c3,
inference(light_normalisation,[status(thm)],[c_2234,c_1293]) ).
cnf(c_2251,plain,
divide(sP0_iProver_def,sP3_iProver_def) = inverse(c3),
inference(superposition,[status(thm)],[c_2244,c_1343]) ).
cnf(c_2271,plain,
divide(sP0_iProver_def,inverse(c3)) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_2251,c_1135]) ).
cnf(c_2273,plain,
sP1_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_2271,c_1324]) ).
cnf(c_2274,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2273,c_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP523-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu May 2 23:33:06 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 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.63/1.15 % SZS status Started for theBenchmark.p
% 3.63/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.63/1.15
% 3.63/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.63/1.15
% 3.63/1.15 ------ iProver source info
% 3.63/1.15
% 3.63/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.63/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.63/1.15 git: non_committed_changes: false
% 3.63/1.15
% 3.63/1.15 ------ Parsing...successful
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.63/1.15
% 3.63/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.63/1.15
% 3.63/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.63/1.15 ------ Proving...
% 3.63/1.15 ------ Problem Properties
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15 clauses 8
% 3.63/1.15 conjectures 1
% 3.63/1.15 EPR 1
% 3.63/1.15 Horn 8
% 3.63/1.15 unary 8
% 3.63/1.15 binary 0
% 3.63/1.15 lits 8
% 3.63/1.15 lits eq 8
% 3.63/1.15 fd_pure 0
% 3.63/1.15 fd_pseudo 0
% 3.63/1.15 fd_cond 0
% 3.63/1.15 fd_pseudo_cond 0
% 3.63/1.15 AC symbols 0
% 3.63/1.15
% 3.63/1.15 ------ Input Options Time Limit: Unbounded
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15 ------
% 3.63/1.15 Current options:
% 3.63/1.15 ------
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15 ------ Proving...
% 3.63/1.15
% 3.63/1.15
% 3.63/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.63/1.15
% 3.63/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.15
% 3.63/1.15
%------------------------------------------------------------------------------