TSTP Solution File: GRP551-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP551-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:54 EDT 2024
% Result : Unsatisfiable 3.42s 1.11s
% Output : CNFRefutation 3.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(identity,X0),divide(divide(divide(X1,X0),X2),X1)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(identity,X1)) = multiply(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(identity,X0) = inverse(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,plain,
divide(X0,X0) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(c_53,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_68,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_69,plain,
divide(inverse(X0),divide(divide(divide(X1,X0),X2),X1)) = X2,
inference(light_normalisation,[status(thm)],[c_49,c_51]) ).
cnf(c_76,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_77,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_78,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_79,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_80,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_78,c_79,c_76,c_77]) ).
cnf(c_126,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_130,plain,
divide(X0,identity) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_126,c_68]) ).
cnf(c_131,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_68,c_51]) ).
cnf(c_138,plain,
divide(inverse(X0),divide(identity,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_52,c_69]) ).
cnf(c_141,plain,
divide(inverse(X0),divide(divide(identity,X1),X0)) = X1,
inference(superposition,[status(thm)],[c_52,c_69]) ).
cnf(c_142,plain,
divide(inverse(inverse(X0)),divide(divide(multiply(X1,X0),X2),X1)) = X2,
inference(superposition,[status(thm)],[c_68,c_69]) ).
cnf(c_145,plain,
divide(multiply(identity,X0),divide(divide(multiply(X1,X0),X2),X1)) = X2,
inference(light_normalisation,[status(thm)],[c_142,c_131]) ).
cnf(c_193,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(demodulation,[status(thm)],[c_138,c_51,c_68]) ).
cnf(c_196,plain,
divide(X0,identity) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_126,c_193]) ).
cnf(c_199,plain,
divide(inverse(X0),identity) = divide(identity,X0),
inference(superposition,[status(thm)],[c_193,c_130]) ).
cnf(c_200,plain,
divide(inverse(X0),identity) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_199,c_51]) ).
cnf(c_204,plain,
divide(X0,identity) = inverse(inverse(X0)),
inference(demodulation,[status(thm)],[c_131,c_196]) ).
cnf(c_229,plain,
divide(divide(X0,identity),identity) = divide(X0,identity),
inference(superposition,[status(thm)],[c_204,c_200]) ).
cnf(c_338,plain,
divide(inverse(X0),divide(inverse(X1),X0)) = X1,
inference(demodulation,[status(thm)],[c_141,c_51]) ).
cnf(c_342,plain,
divide(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_52,c_338]) ).
cnf(c_355,plain,
divide(X0,identity) = X0,
inference(light_normalisation,[status(thm)],[c_342,c_204,c_229]) ).
cnf(c_361,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_204,c_355]) ).
cnf(c_362,plain,
multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_196,c_355]) ).
cnf(c_408,plain,
divide(inverse(identity),divide(divide(X0,X1),X0)) = X1,
inference(superposition,[status(thm)],[c_355,c_69]) ).
cnf(c_410,plain,
divide(inverse(X0),divide(divide(identity,X0),X1)) = X1,
inference(superposition,[status(thm)],[c_355,c_69]) ).
cnf(c_415,plain,
divide(inverse(X0),divide(inverse(X0),X1)) = X1,
inference(light_normalisation,[status(thm)],[c_410,c_51]) ).
cnf(c_416,plain,
divide(identity,divide(divide(X0,X1),X0)) = X1,
inference(light_normalisation,[status(thm)],[c_408,c_126]) ).
cnf(c_441,plain,
divide(X0,inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_361,c_193]) ).
cnf(c_479,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_441,c_68]) ).
cnf(c_486,plain,
multiply(sP2_iProver_def,a3) = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_79,c_479]) ).
cnf(c_617,plain,
divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_361,c_415]) ).
cnf(c_632,plain,
inverse(divide(divide(X0,X1),X0)) = X1,
inference(demodulation,[status(thm)],[c_416,c_51]) ).
cnf(c_647,plain,
divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_632,c_361]) ).
cnf(c_737,plain,
divide(multiply(X0,X1),X1) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_441,c_647]) ).
cnf(c_750,plain,
divide(multiply(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_737,c_361]) ).
cnf(c_770,plain,
divide(sP0_iProver_def,b3) = a3,
inference(superposition,[status(thm)],[c_76,c_750]) ).
cnf(c_772,plain,
divide(sP1_iProver_def,c3) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_77,c_750]) ).
cnf(c_778,plain,
divide(sP3_iProver_def,a3) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_486,c_750]) ).
cnf(c_829,plain,
divide(sP0_iProver_def,a3) = b3,
inference(superposition,[status(thm)],[c_770,c_617]) ).
cnf(c_849,plain,
divide(sP1_iProver_def,sP0_iProver_def) = c3,
inference(superposition,[status(thm)],[c_772,c_617]) ).
cnf(c_850,plain,
divide(sP2_iProver_def,sP3_iProver_def) = inverse(a3),
inference(superposition,[status(thm)],[c_778,c_647]) ).
cnf(c_852,plain,
divide(b3,sP0_iProver_def) = inverse(a3),
inference(superposition,[status(thm)],[c_829,c_647]) ).
cnf(c_870,plain,
divide(c3,sP1_iProver_def) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_849,c_647]) ).
cnf(c_888,plain,
divide(X0,divide(divide(multiply(X1,X0),X2),X1)) = X2,
inference(light_normalisation,[status(thm)],[c_145,c_362]) ).
cnf(c_902,plain,
divide(c3,divide(divide(sP2_iProver_def,X0),b3)) = X0,
inference(superposition,[status(thm)],[c_78,c_888]) ).
cnf(c_999,plain,
divide(inverse(a3),b3) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_852,c_647]) ).
cnf(c_1023,plain,
divide(c3,inverse(sP0_iProver_def)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_870,c_617]) ).
cnf(c_1054,plain,
divide(c3,divide(inverse(a3),b3)) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_850,c_902]) ).
cnf(c_1058,plain,
sP1_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_1054,c_999,c_1023]) ).
cnf(c_1059,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1058,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP551-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:48:50 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running UEQ theorem proving
% 0.17/0.44 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.42/1.11 % SZS status Started for theBenchmark.p
% 3.42/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.42/1.11
% 3.42/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.42/1.11
% 3.42/1.11 ------ iProver source info
% 3.42/1.11
% 3.42/1.11 git: date: 2024-05-02 19:28:25 +0000
% 3.42/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.42/1.11 git: non_committed_changes: false
% 3.42/1.11
% 3.42/1.11 ------ Parsing...successful
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.42/1.11
% 3.42/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.42/1.11
% 3.42/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.42/1.11 ------ Proving...
% 3.42/1.11 ------ Problem Properties
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11 clauses 9
% 3.42/1.11 conjectures 1
% 3.42/1.11 EPR 1
% 3.42/1.11 Horn 9
% 3.42/1.11 unary 9
% 3.42/1.11 binary 0
% 3.42/1.11 lits 9
% 3.42/1.11 lits eq 9
% 3.42/1.11 fd_pure 0
% 3.42/1.11 fd_pseudo 0
% 3.42/1.11 fd_cond 0
% 3.42/1.11 fd_pseudo_cond 0
% 3.42/1.11 AC symbols 0
% 3.42/1.11
% 3.42/1.11 ------ Input Options Time Limit: Unbounded
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11 ------
% 3.42/1.11 Current options:
% 3.42/1.11 ------
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11 ------ Proving...
% 3.42/1.11
% 3.42/1.11
% 3.42/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.42/1.11
% 3.42/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.42/1.11
% 3.42/1.12
%------------------------------------------------------------------------------