TSTP Solution File: GRP715-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP715-10 : TPTP v8.2.0. Released v8.1.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 : Mon Jun 24 07:01:58 EDT 2024
% Result : Unsatisfiable 4.20s 1.21s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_54,plain,
mult(mult(mult(X0,X1),X2),X1) = mult(X0,mult(mult(X1,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(c_55,plain,
mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(c_56,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(c_57,plain,
mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
cnf(c_58,plain,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
cnf(c_59,plain,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
cnf(c_60,negated_conjecture,
mult(mult(x0,op_a),op_b) != x0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_97,plain,
mult(x0,op_a) = sP0_iProver_def,
definition ).
cnf(c_98,plain,
mult(sP0_iProver_def,op_b) = sP1_iProver_def,
definition ).
cnf(c_99,negated_conjecture,
sP1_iProver_def != x0,
inference(demodulation,[status(thm)],[c_60,c_97,c_98]) ).
cnf(c_176,plain,
mult(op_a,mult(op_b,op_b)) = mult(unit,op_b),
inference(superposition,[status(thm)],[c_58,c_55]) ).
cnf(c_179,plain,
mult(sP0_iProver_def,mult(op_b,op_b)) = mult(sP1_iProver_def,op_b),
inference(superposition,[status(thm)],[c_98,c_55]) ).
cnf(c_231,plain,
mult(op_a,mult(mult(op_b,X0),op_b)) = mult(mult(unit,X0),op_b),
inference(superposition,[status(thm)],[c_58,c_54]) ).
cnf(c_232,plain,
mult(op_b,mult(mult(op_a,X0),op_a)) = mult(mult(unit,X0),op_a),
inference(superposition,[status(thm)],[c_59,c_54]) ).
cnf(c_233,plain,
mult(x0,mult(mult(op_a,X0),op_a)) = mult(mult(sP0_iProver_def,X0),op_a),
inference(superposition,[status(thm)],[c_97,c_54]) ).
cnf(c_243,plain,
mult(op_b,mult(mult(op_a,X0),op_a)) = mult(X0,op_a),
inference(light_normalisation,[status(thm)],[c_232,c_57]) ).
cnf(c_244,plain,
mult(op_a,mult(mult(op_b,X0),op_b)) = mult(X0,op_b),
inference(light_normalisation,[status(thm)],[c_231,c_57]) ).
cnf(c_1171,plain,
mult(op_b,mult(unit,op_a)) = mult(op_b,op_a),
inference(superposition,[status(thm)],[c_58,c_243]) ).
cnf(c_1184,plain,
mult(op_b,mult(unit,op_a)) = unit,
inference(light_normalisation,[status(thm)],[c_1171,c_59]) ).
cnf(c_1293,plain,
mult(op_a,mult(unit,op_b)) = mult(op_a,op_b),
inference(superposition,[status(thm)],[c_59,c_244]) ).
cnf(c_1309,plain,
mult(op_a,mult(unit,op_b)) = unit,
inference(light_normalisation,[status(thm)],[c_1293,c_58]) ).
cnf(c_1327,plain,
mult(mult(unit,op_b),op_a) = mult(op_b,mult(unit,op_a)),
inference(superposition,[status(thm)],[c_1309,c_243]) ).
cnf(c_1331,plain,
mult(mult(unit,op_b),op_a) = unit,
inference(light_normalisation,[status(thm)],[c_1327,c_1184]) ).
cnf(c_1737,plain,
mult(mult(sP0_iProver_def,op_b),op_a) = mult(x0,mult(unit,op_a)),
inference(superposition,[status(thm)],[c_58,c_233]) ).
cnf(c_1738,plain,
mult(mult(sP0_iProver_def,mult(op_b,op_b)),op_a) = mult(x0,mult(mult(unit,op_b),op_a)),
inference(superposition,[status(thm)],[c_176,c_233]) ).
cnf(c_1755,plain,
mult(x0,mult(unit,op_a)) = mult(sP1_iProver_def,op_a),
inference(light_normalisation,[status(thm)],[c_1737,c_98]) ).
cnf(c_1759,plain,
mult(mult(sP1_iProver_def,op_b),op_a) = mult(x0,unit),
inference(light_normalisation,[status(thm)],[c_1738,c_179,c_1331]) ).
cnf(c_1770,plain,
mult(x0,op_a) = mult(sP1_iProver_def,op_a),
inference(superposition,[status(thm)],[c_57,c_1755]) ).
cnf(c_1779,plain,
mult(sP1_iProver_def,op_a) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_1770,c_97]) ).
cnf(c_1789,plain,
mult(sP1_iProver_def,mult(mult(op_a,X0),op_a)) = mult(mult(sP0_iProver_def,X0),op_a),
inference(superposition,[status(thm)],[c_1779,c_54]) ).
cnf(c_3858,plain,
mult(mult(sP0_iProver_def,mult(op_b,op_b)),op_a) = mult(sP1_iProver_def,mult(mult(unit,op_b),op_a)),
inference(superposition,[status(thm)],[c_176,c_1789]) ).
cnf(c_3883,plain,
mult(x0,unit) = mult(sP1_iProver_def,unit),
inference(light_normalisation,[status(thm)],[c_3858,c_179,c_1331,c_1759]) ).
cnf(c_3928,plain,
mult(sP1_iProver_def,unit) = x0,
inference(superposition,[status(thm)],[c_3883,c_56]) ).
cnf(c_3947,plain,
x0 = sP1_iProver_def,
inference(superposition,[status(thm)],[c_3928,c_56]) ).
cnf(c_3969,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_99,c_3947]) ).
cnf(c_3970,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_3969]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP715-10 : TPTP v8.2.0. Released v8.1.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Jun 20 12:24:09 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running UEQ theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.20/1.21 % SZS status Started for theBenchmark.p
% 4.20/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.20/1.21
% 4.20/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.20/1.21
% 4.20/1.21 ------ iProver source info
% 4.20/1.21
% 4.20/1.21 git: date: 2024-06-12 09:56:46 +0000
% 4.20/1.21 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 4.20/1.21 git: non_committed_changes: false
% 4.20/1.21
% 4.20/1.21 ------ Parsing...successful
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.20/1.21
% 4.20/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.20/1.21
% 4.20/1.21 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.20/1.21 ------ Proving...
% 4.20/1.21 ------ Problem Properties
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21 clauses 14
% 4.20/1.21 conjectures 1
% 4.20/1.21 EPR 1
% 4.20/1.21 Horn 14
% 4.20/1.21 unary 14
% 4.20/1.21 binary 0
% 4.20/1.21 lits 14
% 4.20/1.21 lits eq 14
% 4.20/1.21 fd_pure 0
% 4.20/1.21 fd_pseudo 0
% 4.20/1.21 fd_cond 0
% 4.20/1.21 fd_pseudo_cond 0
% 4.20/1.21 AC symbols 1
% 4.20/1.21
% 4.20/1.21 ------ Input Options Time Limit: Unbounded
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21 ------
% 4.20/1.21 Current options:
% 4.20/1.21 ------
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21 ------ Proving...
% 4.20/1.21
% 4.20/1.21
% 4.20/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.20/1.21
% 4.20/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.20/1.21
% 4.20/1.21
%------------------------------------------------------------------------------