TSTP Solution File: GRP697-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP697-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:23:28 EDT 2024
% Result : Unsatisfiable 11.36s 2.23s
% Output : CNFRefutation 11.36s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% 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_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_102,plain,
mult(b,c) = sP0_iProver_def,
definition ).
cnf(c_103,plain,
mult(b,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_104,plain,
mult(a,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_105,plain,
mult(sP2_iProver_def,b) = sP3_iProver_def,
definition ).
cnf(c_106,plain,
mult(a,b) = sP4_iProver_def,
definition ).
cnf(c_107,plain,
mult(c,b) = sP5_iProver_def,
definition ).
cnf(c_108,plain,
mult(b,sP5_iProver_def) = sP6_iProver_def,
definition ).
cnf(c_109,plain,
mult(sP4_iProver_def,sP6_iProver_def) = sP7_iProver_def,
definition ).
cnf(c_110,negated_conjecture,
sP3_iProver_def != sP7_iProver_def,
inference(demodulation,[status(thm)],[c_60,c_107,c_108,c_106,c_109,c_102,c_103,c_104,c_105]) ).
cnf(c_201,plain,
ld(i(X0),unit) = X0,
inference(superposition,[status(thm)],[c_58,c_50]) ).
cnf(c_202,plain,
ld(X0,unit) = i(X0),
inference(superposition,[status(thm)],[c_59,c_50]) ).
cnf(c_223,plain,
i(i(X0)) = X0,
inference(demodulation,[status(thm)],[c_201,c_202]) ).
cnf(c_257,plain,
mult(b,i(sP5_iProver_def)) = i(c),
inference(superposition,[status(thm)],[c_107,c_55]) ).
cnf(c_265,plain,
ld(X0,i(X1)) = i(mult(X1,X0)),
inference(superposition,[status(thm)],[c_55,c_50]) ).
cnf(c_267,plain,
mult(i(mult(X0,X1)),i(i(X0))) = i(X1),
inference(superposition,[status(thm)],[c_55,c_55]) ).
cnf(c_273,plain,
mult(i(mult(X0,X1)),X0) = i(X1),
inference(light_normalisation,[status(thm)],[c_267,c_223]) ).
cnf(c_331,plain,
mult(rd(mult(X0,X1),X0),X2) = mult(X0,mult(X1,ld(X0,X2))),
inference(superposition,[status(thm)],[c_49,c_56]) ).
cnf(c_349,plain,
ld(rd(mult(X0,X1),X0),mult(X0,mult(X1,X2))) = mult(X0,X2),
inference(superposition,[status(thm)],[c_56,c_50]) ).
cnf(c_472,plain,
mult(sP4_iProver_def,ld(b,mult(X0,b))) = mult(mult(a,X0),b),
inference(superposition,[status(thm)],[c_106,c_57]) ).
cnf(c_833,plain,
i(mult(i(X0),X1)) = ld(X1,X0),
inference(superposition,[status(thm)],[c_223,c_265]) ).
cnf(c_861,plain,
mult(i(sP0_iProver_def),b) = i(c),
inference(superposition,[status(thm)],[c_102,c_273]) ).
cnf(c_865,plain,
mult(i(sP6_iProver_def),b) = i(sP5_iProver_def),
inference(superposition,[status(thm)],[c_108,c_273]) ).
cnf(c_1204,plain,
rd(i(c),b) = i(sP0_iProver_def),
inference(superposition,[status(thm)],[c_861,c_52]) ).
cnf(c_1327,plain,
mult(b,i(i(sP5_iProver_def))) = i(i(sP6_iProver_def)),
inference(superposition,[status(thm)],[c_865,c_55]) ).
cnf(c_1899,plain,
ld(ld(i(X0),X1),X0) = i(X1),
inference(superposition,[status(thm)],[c_49,c_833]) ).
cnf(c_2843,plain,
mult(X0,mult(X1,ld(X0,unit))) = rd(mult(X0,X1),X0),
inference(superposition,[status(thm)],[c_331,c_53]) ).
cnf(c_2856,plain,
mult(X0,mult(X1,i(X0))) = rd(mult(X0,X1),X0),
inference(light_normalisation,[status(thm)],[c_2843,c_202]) ).
cnf(c_7351,plain,
ld(rd(mult(X0,X1),X0),mult(X0,unit)) = mult(X0,i(X1)),
inference(superposition,[status(thm)],[c_59,c_349]) ).
cnf(c_7441,plain,
ld(rd(mult(X0,X1),X0),X0) = mult(X0,i(X1)),
inference(light_normalisation,[status(thm)],[c_7351,c_53]) ).
cnf(c_13771,plain,
ld(rd(i(c),b),b) = mult(b,i(i(sP5_iProver_def))),
inference(superposition,[status(thm)],[c_257,c_7441]) ).
cnf(c_13884,plain,
ld(i(sP0_iProver_def),b) = i(i(sP6_iProver_def)),
inference(light_normalisation,[status(thm)],[c_13771,c_1204,c_1327]) ).
cnf(c_14512,plain,
ld(i(sP0_iProver_def),b) = sP6_iProver_def,
inference(demodulation,[status(thm)],[c_13884,c_223]) ).
cnf(c_14520,plain,
ld(sP6_iProver_def,sP0_iProver_def) = i(b),
inference(superposition,[status(thm)],[c_14512,c_1899]) ).
cnf(c_14687,plain,
mult(sP6_iProver_def,i(b)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_14520,c_49]) ).
cnf(c_14710,plain,
rd(mult(b,sP6_iProver_def),b) = mult(b,sP0_iProver_def),
inference(superposition,[status(thm)],[c_14687,c_2856]) ).
cnf(c_14715,plain,
rd(mult(b,sP6_iProver_def),b) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_14710,c_103]) ).
cnf(c_14932,plain,
mult(b,sP6_iProver_def) = mult(sP1_iProver_def,b),
inference(superposition,[status(thm)],[c_14715,c_51]) ).
cnf(c_15025,plain,
ld(b,mult(sP1_iProver_def,b)) = sP6_iProver_def,
inference(superposition,[status(thm)],[c_14932,c_50]) ).
cnf(c_15239,plain,
mult(mult(a,sP1_iProver_def),b) = mult(sP4_iProver_def,sP6_iProver_def),
inference(superposition,[status(thm)],[c_15025,c_472]) ).
cnf(c_15272,plain,
sP3_iProver_def = sP7_iProver_def,
inference(light_normalisation,[status(thm)],[c_15239,c_104,c_105,c_109]) ).
cnf(c_15273,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15272,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP697-1 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:51:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running UEQ theorem proving
% 0.21/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
% 11.36/2.23 % SZS status Started for theBenchmark.p
% 11.36/2.23 % SZS status Unsatisfiable for theBenchmark.p
% 11.36/2.23
% 11.36/2.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 11.36/2.23
% 11.36/2.23 ------ iProver source info
% 11.36/2.23
% 11.36/2.23 git: date: 2024-05-02 19:28:25 +0000
% 11.36/2.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 11.36/2.23 git: non_committed_changes: false
% 11.36/2.23
% 11.36/2.23 ------ Parsing...successful
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 11.36/2.23
% 11.36/2.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.36/2.23
% 11.36/2.23 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 11.36/2.23 ------ Proving...
% 11.36/2.23 ------ Problem Properties
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23 clauses 20
% 11.36/2.23 conjectures 1
% 11.36/2.23 EPR 1
% 11.36/2.23 Horn 20
% 11.36/2.23 unary 20
% 11.36/2.23 binary 0
% 11.36/2.23 lits 20
% 11.36/2.23 lits eq 20
% 11.36/2.23 fd_pure 0
% 11.36/2.23 fd_pseudo 0
% 11.36/2.23 fd_cond 0
% 11.36/2.23 fd_pseudo_cond 0
% 11.36/2.23 AC symbols 0
% 11.36/2.23
% 11.36/2.23 ------ Input Options Time Limit: Unbounded
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23 ------
% 11.36/2.23 Current options:
% 11.36/2.23 ------
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23 ------ Proving...
% 11.36/2.23
% 11.36/2.23
% 11.36/2.23 % SZS status Unsatisfiable for theBenchmark.p
% 11.36/2.23
% 11.36/2.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.36/2.23
% 11.36/2.23
%------------------------------------------------------------------------------