TSTP Solution File: RNG013-6 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG013-6 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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 14:03:01 EDT 2024
% Result : Unsatisfiable 2.99s 1.14s
% Output : CNFRefutation 2.99s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
additive_inverse(multiply(a,b)) != multiply(additive_inverse(a),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_50,plain,
add(additive_identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
cnf(c_52,plain,
multiply(additive_identity,X0) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_multiplicative_zero) ).
cnf(c_55,plain,
add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(c_56,plain,
additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
cnf(c_58,plain,
add(multiply(X0,X1),multiply(X2,X1)) = multiply(add(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(c_59,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
cnf(c_60,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(c_148,plain,
multiply(a,b) = sP0_iProver_def,
definition ).
cnf(c_149,plain,
additive_inverse(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_150,plain,
additive_inverse(a) = sP2_iProver_def,
definition ).
cnf(c_151,plain,
multiply(sP2_iProver_def,b) = sP3_iProver_def,
definition ).
cnf(c_152,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_49,c_150,c_151,c_148,c_149]) ).
cnf(c_226,plain,
additive_inverse(sP2_iProver_def) = a,
inference(superposition,[status(thm)],[c_150,c_56]) ).
cnf(c_227,plain,
additive_inverse(sP1_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_149,c_56]) ).
cnf(c_234,plain,
add(sP2_iProver_def,a) = additive_identity,
inference(superposition,[status(thm)],[c_226,c_55]) ).
cnf(c_235,plain,
add(sP1_iProver_def,sP0_iProver_def) = additive_identity,
inference(superposition,[status(thm)],[c_227,c_55]) ).
cnf(c_236,plain,
additive_inverse(additive_identity) = additive_identity,
inference(superposition,[status(thm)],[c_55,c_50]) ).
cnf(c_237,plain,
add(sP0_iProver_def,sP1_iProver_def) = additive_identity,
inference(theory_normalisation,[status(thm)],[c_235,c_60,c_59]) ).
cnf(c_254,plain,
add(sP0_iProver_def,add(sP1_iProver_def,X0)) = add(additive_identity,X0),
inference(superposition,[status(thm)],[c_237,c_60]) ).
cnf(c_257,plain,
add(X0,add(X1,additive_inverse(add(X0,X1)))) = additive_identity,
inference(superposition,[status(thm)],[c_60,c_55]) ).
cnf(c_259,plain,
add(sP0_iProver_def,add(sP1_iProver_def,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_254,c_50]) ).
cnf(c_359,plain,
add(sP0_iProver_def,add(X0,sP1_iProver_def)) = X0,
inference(superposition,[status(thm)],[c_59,c_259]) ).
cnf(c_379,plain,
multiply(add(a,X0),b) = add(sP0_iProver_def,multiply(X0,b)),
inference(superposition,[status(thm)],[c_148,c_58]) ).
cnf(c_1740,plain,
multiply(add(a,sP2_iProver_def),b) = add(sP0_iProver_def,sP3_iProver_def),
inference(superposition,[status(thm)],[c_151,c_379]) ).
cnf(c_1747,plain,
multiply(add(sP2_iProver_def,a),b) = add(sP0_iProver_def,sP3_iProver_def),
inference(theory_normalisation,[status(thm)],[c_1740,c_60,c_59]) ).
cnf(c_1748,plain,
multiply(additive_identity,b) = add(sP0_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_1747,c_234]) ).
cnf(c_1757,plain,
add(sP0_iProver_def,add(sP3_iProver_def,additive_inverse(multiply(additive_identity,b)))) = additive_identity,
inference(superposition,[status(thm)],[c_1748,c_257]) ).
cnf(c_2189,plain,
add(sP0_iProver_def,add(sP3_iProver_def,additive_inverse(additive_identity))) = additive_identity,
inference(superposition,[status(thm)],[c_52,c_1757]) ).
cnf(c_2194,plain,
add(sP0_iProver_def,add(sP3_iProver_def,additive_identity)) = additive_identity,
inference(light_normalisation,[status(thm)],[c_2189,c_236]) ).
cnf(c_2205,plain,
add(sP0_iProver_def,add(add(sP3_iProver_def,additive_identity),X0)) = add(additive_identity,X0),
inference(superposition,[status(thm)],[c_2194,c_60]) ).
cnf(c_2210,plain,
add(sP0_iProver_def,add(sP3_iProver_def,add(additive_identity,X0))) = add(additive_identity,X0),
inference(theory_normalisation,[status(thm)],[c_2205,c_60,c_59]) ).
cnf(c_2211,plain,
add(sP0_iProver_def,add(sP3_iProver_def,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_2210,c_50]) ).
cnf(c_2265,plain,
sP1_iProver_def = sP3_iProver_def,
inference(superposition,[status(thm)],[c_2211,c_359]) ).
cnf(c_2269,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2265,c_152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG013-6 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 13:58:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 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
% 2.99/1.14 % SZS status Started for theBenchmark.p
% 2.99/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.99/1.14
% 2.99/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.99/1.14
% 2.99/1.14 ------ iProver source info
% 2.99/1.14
% 2.99/1.14 git: date: 2024-06-12 09:56:46 +0000
% 2.99/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.99/1.14 git: non_committed_changes: false
% 2.99/1.14
% 2.99/1.14 ------ Parsing...successful
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.99/1.14
% 2.99/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.99/1.14
% 2.99/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.99/1.14 ------ Proving...
% 2.99/1.14 ------ Problem Properties
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14 clauses 19
% 2.99/1.14 conjectures 1
% 2.99/1.14 EPR 1
% 2.99/1.14 Horn 19
% 2.99/1.14 unary 19
% 2.99/1.14 binary 0
% 2.99/1.14 lits 19
% 2.99/1.14 lits eq 19
% 2.99/1.14 fd_pure 0
% 2.99/1.14 fd_pseudo 0
% 2.99/1.14 fd_cond 0
% 2.99/1.14 fd_pseudo_cond 0
% 2.99/1.14 AC symbols 1
% 2.99/1.14
% 2.99/1.14 ------ Input Options Time Limit: Unbounded
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14 ------
% 2.99/1.14 Current options:
% 2.99/1.14 ------
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14 ------ Proving...
% 2.99/1.14
% 2.99/1.14
% 2.99/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.99/1.14
% 2.99/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.99/1.14
% 2.99/1.14
%------------------------------------------------------------------------------