TSTP Solution File: GRP697-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP697-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 : Thu Aug 31 01:01:26 EDT 2023
% Result : Unsatisfiable 50.97s 7.13s
% Output : CNFRefutation 50.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of clauses : 73 ( 73 unt; 0 nHn; 4 RR)
% Number of literals : 73 ( 72 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 137 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c_53,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c_54,plain,
mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c_55,plain,
mult(X0,i(mult(X1,X0))) = i(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c_56,plain,
mult(rd(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c_57,plain,
mult(mult(X0,X1),ld(X1,mult(X2,X1))) = mult(mult(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c_58,plain,
mult(i(X0),X0) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c_59,plain,
mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c_60,negated_conjecture,
mult(mult(a,mult(b,mult(b,c))),b) != mult(mult(a,b),mult(b,mult(c,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_163,plain,
i(unit) = unit,
inference(superposition,[status(thm)],[c_53,c_58]) ).
cnf(c_184,plain,
ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_188,plain,
rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_191,plain,
rd(unit,X0) = i(X0),
inference(superposition,[status(thm)],[c_58,c_52]) ).
cnf(c_198,plain,
mult(ld(X0,X1),i(X1)) = i(X0),
inference(superposition,[status(thm)],[c_49,c_55]) ).
cnf(c_203,plain,
mult(X0,i(unit)) = i(i(X0)),
inference(superposition,[status(thm)],[c_58,c_55]) ).
cnf(c_206,plain,
ld(X0,i(X1)) = i(mult(X1,X0)),
inference(superposition,[status(thm)],[c_55,c_50]) ).
cnf(c_213,plain,
i(i(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_203,c_53,c_163]) ).
cnf(c_227,plain,
mult(rd(unit,X0),mult(X0,X1)) = mult(X0,mult(i(X0),X1)),
inference(superposition,[status(thm)],[c_59,c_56]) ).
cnf(c_237,plain,
rd(mult(X0,mult(X1,X2)),mult(X0,X2)) = rd(mult(X0,X1),X0),
inference(superposition,[status(thm)],[c_56,c_52]) ).
cnf(c_244,plain,
mult(i(X0),mult(X0,X1)) = mult(X0,mult(i(X0),X1)),
inference(light_normalisation,[status(thm)],[c_227,c_191]) ).
cnf(c_281,plain,
mult(unit,ld(X0,mult(X1,X0))) = mult(mult(i(X0),X1),X0),
inference(superposition,[status(thm)],[c_58,c_57]) ).
cnf(c_293,plain,
rd(mult(mult(X0,X1),X2),ld(X2,mult(X1,X2))) = mult(X0,X2),
inference(superposition,[status(thm)],[c_57,c_52]) ).
cnf(c_349,plain,
mult(ld(X0,i(X1)),X1) = i(X0),
inference(superposition,[status(thm)],[c_213,c_198]) ).
cnf(c_351,plain,
rd(i(X0),i(X1)) = ld(X0,X1),
inference(superposition,[status(thm)],[c_198,c_52]) ).
cnf(c_358,plain,
mult(i(mult(X0,X1)),X0) = i(X1),
inference(light_normalisation,[status(thm)],[c_349,c_206]) ).
cnf(c_385,plain,
i(mult(i(X0),X1)) = ld(X1,X0),
inference(superposition,[status(thm)],[c_213,c_206]) ).
cnf(c_406,plain,
ld(X0,i(X1)) = rd(i(X0),X1),
inference(superposition,[status(thm)],[c_213,c_351]) ).
cnf(c_413,plain,
rd(i(X0),X1) = i(mult(X1,X0)),
inference(light_normalisation,[status(thm)],[c_406,c_206]) ).
cnf(c_461,plain,
mult(i(X0),X1) = i(ld(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_358]) ).
cnf(c_462,plain,
mult(i(X0),rd(X0,X1)) = i(X1),
inference(superposition,[status(thm)],[c_51,c_358]) ).
cnf(c_477,plain,
mult(X0,i(i(X1))) = i(i(mult(X0,X1))),
inference(superposition,[status(thm)],[c_358,c_55]) ).
cnf(c_576,plain,
mult(i(i(X0)),X1) = i(i(mult(X0,X1))),
inference(superposition,[status(thm)],[c_206,c_461]) ).
cnf(c_587,plain,
mult(X0,i(i(X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_576,c_213,c_477]) ).
cnf(c_606,plain,
ld(i(X0),i(X1)) = rd(X0,X1),
inference(superposition,[status(thm)],[c_462,c_50]) ).
cnf(c_860,plain,
ld(i(X0),mult(X0,mult(i(X0),X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_244,c_50]) ).
cnf(c_1294,plain,
ld(i(X0),mult(X0,X1)) = mult(X0,ld(i(X0),X1)),
inference(superposition,[status(thm)],[c_49,c_860]) ).
cnf(c_1592,plain,
mult(X0,ld(i(X0),i(mult(X1,X0)))) = ld(i(X0),i(X1)),
inference(superposition,[status(thm)],[c_55,c_1294]) ).
cnf(c_1625,plain,
mult(X0,ld(i(X0),i(mult(X1,X0)))) = rd(X0,X1),
inference(light_normalisation,[status(thm)],[c_1592,c_606]) ).
cnf(c_2053,plain,
mult(X0,ld(i(X0),i(X1))) = rd(X0,rd(X1,X0)),
inference(superposition,[status(thm)],[c_51,c_1625]) ).
cnf(c_2100,plain,
mult(X0,rd(X0,X1)) = rd(X0,rd(X1,X0)),
inference(light_normalisation,[status(thm)],[c_2053,c_606]) ).
cnf(c_2168,plain,
mult(X0,rd(X0,mult(X1,X0))) = rd(X0,X1),
inference(superposition,[status(thm)],[c_52,c_2100]) ).
cnf(c_2184,plain,
ld(mult(X0,rd(X0,X1)),X0) = rd(X1,X0),
inference(superposition,[status(thm)],[c_2100,c_184]) ).
cnf(c_2254,plain,
ld(X0,rd(X0,X1)) = rd(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_2168,c_50]) ).
cnf(c_2328,plain,
ld(mult(X0,X1),X0) = rd(ld(X1,X0),X0),
inference(superposition,[status(thm)],[c_188,c_2184]) ).
cnf(c_4030,plain,
mult(mult(i(X0),X1),X0) = ld(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_281,c_54]) ).
cnf(c_4414,plain,
mult(X0,i(ld(X0,mult(X1,X0)))) = i(mult(i(X0),X1)),
inference(superposition,[status(thm)],[c_4030,c_55]) ).
cnf(c_4426,plain,
mult(X0,i(ld(X0,mult(X1,X0)))) = ld(X1,X0),
inference(light_normalisation,[status(thm)],[c_4414,c_385]) ).
cnf(c_9646,plain,
rd(mult(X0,unit),mult(X0,X1)) = rd(mult(X0,i(X1)),X0),
inference(superposition,[status(thm)],[c_58,c_237]) ).
cnf(c_9731,plain,
rd(mult(X0,i(X1)),X0) = rd(X0,mult(X0,X1)),
inference(light_normalisation,[status(thm)],[c_9646,c_53]) ).
cnf(c_9962,plain,
rd(X0,mult(X0,mult(X1,X0))) = rd(i(X1),X0),
inference(superposition,[status(thm)],[c_55,c_9731]) ).
cnf(c_9990,plain,
mult(rd(X0,mult(X0,X1)),X0) = mult(X0,i(X1)),
inference(superposition,[status(thm)],[c_9731,c_51]) ).
cnf(c_10112,plain,
ld(rd(i(X0),X1),X1) = mult(X1,mult(X0,X1)),
inference(superposition,[status(thm)],[c_9962,c_184]) ).
cnf(c_10130,plain,
ld(i(mult(X0,X1)),X0) = mult(X0,mult(X1,X0)),
inference(light_normalisation,[status(thm)],[c_10112,c_413]) ).
cnf(c_10211,plain,
mult(X0,i(ld(X0,X1))) = mult(rd(X0,X1),X0),
inference(superposition,[status(thm)],[c_49,c_9990]) ).
cnf(c_11401,plain,
rd(mult(unit,X0),ld(X0,mult(X1,X0))) = mult(i(X1),X0),
inference(superposition,[status(thm)],[c_58,c_293]) ).
cnf(c_11497,plain,
rd(X0,ld(X0,mult(X1,X0))) = mult(i(X1),X0),
inference(light_normalisation,[status(thm)],[c_11401,c_54]) ).
cnf(c_11680,plain,
mult(i(i(mult(X0,X1))),X0) = rd(X0,ld(X0,i(X1))),
inference(superposition,[status(thm)],[c_358,c_11497]) ).
cnf(c_11730,plain,
rd(X0,i(mult(X1,X0))) = mult(mult(X0,X1),X0),
inference(light_normalisation,[status(thm)],[c_11680,c_206,c_477,c_587]) ).
cnf(c_12754,plain,
mult(X0,i(ld(X0,X1))) = ld(rd(X1,X0),X0),
inference(superposition,[status(thm)],[c_51,c_4426]) ).
cnf(c_12842,plain,
ld(rd(X0,X1),X1) = mult(rd(X1,X0),X1),
inference(light_normalisation,[status(thm)],[c_12754,c_10211]) ).
cnf(c_12947,plain,
mult(rd(X0,mult(X1,X0)),X0) = ld(X1,X0),
inference(superposition,[status(thm)],[c_52,c_12842]) ).
cnf(c_13000,plain,
mult(ld(X0,rd(X0,X1)),X0) = ld(X1,X0),
inference(light_normalisation,[status(thm)],[c_12947,c_2254]) ).
cnf(c_13316,plain,
ld(X0,rd(X0,X1)) = rd(ld(X1,X0),X0),
inference(superposition,[status(thm)],[c_13000,c_52]) ).
cnf(c_13377,plain,
ld(mult(X0,X1),X0) = ld(X0,rd(X0,X1)),
inference(demodulation,[status(thm)],[c_2328,c_13316]) ).
cnf(c_15354,plain,
ld(X0,rd(X0,i(mult(X1,X0)))) = ld(i(X1),X0),
inference(superposition,[status(thm)],[c_55,c_13377]) ).
cnf(c_15419,plain,
ld(X0,mult(mult(X0,X1),X0)) = ld(i(X1),X0),
inference(light_normalisation,[status(thm)],[c_15354,c_11730]) ).
cnf(c_43078,plain,
mult(mult(X0,X1),ld(i(X2),X1)) = mult(mult(X0,mult(X1,X2)),X1),
inference(superposition,[status(thm)],[c_15419,c_57]) ).
cnf(c_103064,plain,
mult(mult(X0,mult(X1,mult(X1,X2))),X1) = mult(mult(X0,X1),mult(X1,mult(X2,X1))),
inference(superposition,[status(thm)],[c_10130,c_43078]) ).
cnf(c_103297,plain,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,b),mult(b,mult(c,b))),
inference(demodulation,[status(thm)],[c_60,c_103064]) ).
cnf(c_103298,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_103297]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP697-1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n002.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 : Mon Aug 28 22:47:05 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.42 Running UEQ theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 50.97/7.13 % SZS status Started for theBenchmark.p
% 50.97/7.13 % SZS status Unsatisfiable for theBenchmark.p
% 50.97/7.13
% 50.97/7.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 50.97/7.13
% 50.97/7.13 ------ iProver source info
% 50.97/7.13
% 50.97/7.13 git: date: 2023-05-31 18:12:56 +0000
% 50.97/7.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 50.97/7.13 git: non_committed_changes: false
% 50.97/7.13 git: last_make_outside_of_git: false
% 50.97/7.13
% 50.97/7.13 ------ Parsing...successful
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 50.97/7.13
% 50.97/7.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 50.97/7.13
% 50.97/7.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 50.97/7.13 ------ Proving...
% 50.97/7.13 ------ Problem Properties
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13 clauses 12
% 50.97/7.13 conjectures 1
% 50.97/7.13 EPR 0
% 50.97/7.13 Horn 12
% 50.97/7.13 unary 12
% 50.97/7.13 binary 0
% 50.97/7.13 lits 12
% 50.97/7.13 lits eq 12
% 50.97/7.13 fd_pure 0
% 50.97/7.13 fd_pseudo 0
% 50.97/7.13 fd_cond 0
% 50.97/7.13 fd_pseudo_cond 0
% 50.97/7.13 AC symbols 0
% 50.97/7.13
% 50.97/7.13 ------ Input Options Time Limit: Unbounded
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13 ------
% 50.97/7.13 Current options:
% 50.97/7.13 ------
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13 ------ Proving...
% 50.97/7.13
% 50.97/7.13
% 50.97/7.13 % SZS status Unsatisfiable for theBenchmark.p
% 50.97/7.13
% 50.97/7.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 50.97/7.13
% 50.97/7.14
%------------------------------------------------------------------------------