TSTP Solution File: GRP069-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP069-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:20:51 EDT 2024
% Result : Unsatisfiable 3.81s 1.22s
% Output : CNFRefutation 3.81s
% 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(identity,X0),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(identity,X1)) = multiply(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(identity,X0) = inverse(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,plain,
divide(X0,X0) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(c_53,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_72,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_73,plain,
divide(X0,divide(divide(divide(identity,X1),X2),divide(inverse(X0),X2))) = X1,
inference(light_normalisation,[status(thm)],[c_49,c_51,c_52]) ).
cnf(c_74,plain,
divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(demodulation,[status(thm)],[c_73,c_51]) ).
cnf(c_85,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_86,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_87,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_88,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_89,plain,
inverse(a1) = sP4_iProver_def,
definition ).
cnf(c_90,plain,
multiply(sP4_iProver_def,a1) = sP5_iProver_def,
definition ).
cnf(c_91,plain,
multiply(identity,a2) = sP6_iProver_def,
definition ).
cnf(c_92,negated_conjecture,
( sP1_iProver_def != sP3_iProver_def
| sP5_iProver_def != identity
| sP6_iProver_def != a2 ),
inference(demodulation,[status(thm)],[c_53,c_91,c_89,c_90,c_87,c_88,c_85,c_86]) ).
cnf(c_158,plain,
divide(X0,sP4_iProver_def) = multiply(X0,a1),
inference(superposition,[status(thm)],[c_89,c_72]) ).
cnf(c_160,plain,
divide(sP4_iProver_def,sP4_iProver_def) = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_90,c_158]) ).
cnf(c_165,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_51,c_52]) ).
cnf(c_169,plain,
divide(X0,identity) = X0,
inference(superposition,[status(thm)],[c_52,c_74]) ).
cnf(c_203,plain,
identity = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_160,c_52]) ).
cnf(c_204,plain,
inverse(sP5_iProver_def) = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_165,c_203]) ).
cnf(c_205,plain,
divide(sP5_iProver_def,X0) = inverse(X0),
inference(demodulation,[status(thm)],[c_51,c_203]) ).
cnf(c_206,plain,
multiply(sP5_iProver_def,a2) = sP6_iProver_def,
inference(demodulation,[status(thm)],[c_91,c_203]) ).
cnf(c_207,plain,
divide(X0,X0) = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_52,c_203]) ).
cnf(c_208,plain,
( a2 != sP6_iProver_def
| sP1_iProver_def != sP3_iProver_def
| sP5_iProver_def != sP5_iProver_def ),
inference(demodulation,[status(thm)],[c_92,c_203]) ).
cnf(c_209,plain,
( a2 != sP6_iProver_def
| sP1_iProver_def != sP3_iProver_def ),
inference(equality_resolution_simp,[status(thm)],[c_208]) ).
cnf(c_216,plain,
divide(X0,sP5_iProver_def) = multiply(X0,sP5_iProver_def),
inference(superposition,[status(thm)],[c_204,c_72]) ).
cnf(c_223,plain,
divide(X0,sP5_iProver_def) = X0,
inference(light_normalisation,[status(thm)],[c_169,c_203]) ).
cnf(c_224,plain,
divide(X0,divide(divide(inverse(X1),sP5_iProver_def),inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_223,c_74]) ).
cnf(c_242,plain,
divide(X0,divide(sP5_iProver_def,divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_207,c_74]) ).
cnf(c_265,plain,
multiply(sP5_iProver_def,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_205,c_72]) ).
cnf(c_278,plain,
multiply(X0,sP5_iProver_def) = X0,
inference(light_normalisation,[status(thm)],[c_216,c_223]) ).
cnf(c_288,plain,
divide(X0,multiply(sP5_iProver_def,X1)) = multiply(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_265,c_72]) ).
cnf(c_304,plain,
divide(X0,divide(divide(inverse(X1),multiply(sP5_iProver_def,X2)),multiply(inverse(X0),inverse(X2)))) = X1,
inference(superposition,[status(thm)],[c_288,c_74]) ).
cnf(c_413,plain,
divide(X0,multiply(inverse(X1),X0)) = X1,
inference(demodulation,[status(thm)],[c_224,c_72,c_223]) ).
cnf(c_417,plain,
divide(sP5_iProver_def,inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_278,c_413]) ).
cnf(c_490,plain,
multiply(sP5_iProver_def,X0) = X0,
inference(demodulation,[status(thm)],[c_417,c_205,c_265]) ).
cnf(c_494,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_265,c_490]) ).
cnf(c_495,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(demodulation,[status(thm)],[c_288,c_490]) ).
cnf(c_496,plain,
a2 = sP6_iProver_def,
inference(demodulation,[status(thm)],[c_206,c_490]) ).
cnf(c_498,plain,
sP1_iProver_def != sP3_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_209,c_496]) ).
cnf(c_510,plain,
divide(X0,multiply(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_494,c_413]) ).
cnf(c_593,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_242,c_72,c_205]) ).
cnf(c_601,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_494,c_593]) ).
cnf(c_925,plain,
divide(multiply(X0,X1),X1) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_601,c_510]) ).
cnf(c_933,plain,
divide(multiply(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_925,c_494]) ).
cnf(c_993,plain,
multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_933,c_72]) ).
cnf(c_997,plain,
multiply(divide(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_993,c_495]) ).
cnf(c_1109,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_997,c_510]) ).
cnf(c_1528,plain,
divide(inverse(X0),X1) = inverse(multiply(X1,X0)),
inference(superposition,[status(thm)],[c_72,c_1109]) ).
cnf(c_1567,plain,
divide(inverse(c3),b3) = inverse(sP2_iProver_def),
inference(superposition,[status(thm)],[c_87,c_1528]) ).
cnf(c_1568,plain,
divide(inverse(c3),sP0_iProver_def) = inverse(sP1_iProver_def),
inference(superposition,[status(thm)],[c_86,c_1528]) ).
cnf(c_1569,plain,
divide(inverse(sP2_iProver_def),a3) = inverse(sP3_iProver_def),
inference(superposition,[status(thm)],[c_88,c_1528]) ).
cnf(c_1590,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_1528,c_72]) ).
cnf(c_1623,plain,
multiply(inverse(sP2_iProver_def),b3) = inverse(c3),
inference(superposition,[status(thm)],[c_1567,c_997]) ).
cnf(c_1766,plain,
divide(X0,multiply(divide(inverse(X1),X2),multiply(X2,X0))) = X1,
inference(demodulation,[status(thm)],[c_304,c_490,c_495,c_1590]) ).
cnf(c_1783,plain,
divide(b3,multiply(divide(inverse(X0),a3),sP0_iProver_def)) = X0,
inference(superposition,[status(thm)],[c_85,c_1766]) ).
cnf(c_1904,plain,
divide(b3,multiply(inverse(sP3_iProver_def),sP0_iProver_def)) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_1569,c_1783]) ).
cnf(c_1995,plain,
multiply(sP2_iProver_def,multiply(inverse(sP3_iProver_def),sP0_iProver_def)) = b3,
inference(superposition,[status(thm)],[c_1904,c_997]) ).
cnf(c_1997,plain,
multiply(inverse(sP2_iProver_def),b3) = multiply(inverse(sP3_iProver_def),sP0_iProver_def),
inference(superposition,[status(thm)],[c_1995,c_601]) ).
cnf(c_2000,plain,
multiply(inverse(sP3_iProver_def),sP0_iProver_def) = inverse(c3),
inference(light_normalisation,[status(thm)],[c_1997,c_1623]) ).
cnf(c_2004,plain,
divide(inverse(c3),sP0_iProver_def) = inverse(sP3_iProver_def),
inference(superposition,[status(thm)],[c_2000,c_933]) ).
cnf(c_2009,plain,
inverse(sP1_iProver_def) = inverse(sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_2004,c_1568]) ).
cnf(c_2016,plain,
inverse(inverse(sP1_iProver_def)) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_2009,c_494]) ).
cnf(c_2050,plain,
sP1_iProver_def = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_2016,c_494]) ).
cnf(c_2051,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2050,c_498]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP069-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 00:11:58 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.81/1.22 % SZS status Started for theBenchmark.p
% 3.81/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.22
% 3.81/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.81/1.22
% 3.81/1.22 ------ iProver source info
% 3.81/1.22
% 3.81/1.22 git: date: 2024-05-02 19:28:25 +0000
% 3.81/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.81/1.22 git: non_committed_changes: false
% 3.81/1.22
% 3.81/1.22 ------ Parsing...successful
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.81/1.22
% 3.81/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.81/1.22
% 3.81/1.22 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.81/1.22 ------ Proving...
% 3.81/1.22 ------ Problem Properties
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22 clauses 12
% 3.81/1.22 conjectures 1
% 3.81/1.22 EPR 1
% 3.81/1.22 Horn 12
% 3.81/1.22 unary 11
% 3.81/1.22 binary 0
% 3.81/1.22 lits 14
% 3.81/1.22 lits eq 14
% 3.81/1.22 fd_pure 0
% 3.81/1.22 fd_pseudo 0
% 3.81/1.22 fd_cond 0
% 3.81/1.22 fd_pseudo_cond 0
% 3.81/1.22 AC symbols 0
% 3.81/1.22
% 3.81/1.22 ------ Schedule dynamic 5 is on
% 3.81/1.22
% 3.81/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22 ------
% 3.81/1.22 Current options:
% 3.81/1.22 ------
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22 ------ Proving...
% 3.81/1.22
% 3.81/1.22
% 3.81/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.22
% 3.81/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.22
% 3.81/1.23
%------------------------------------------------------------------------------