TSTP Solution File: RNG013-6 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG013-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:57:15 EDT 2024
% Result : Unsatisfiable 3.98s 1.10s
% Output : CNFRefutation 3.98s
% 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/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_51,plain,
add(X0,additive_identity) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
cnf(c_52,plain,
multiply(additive_identity,X0) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_multiplicative_zero) ).
cnf(c_55,plain,
add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(c_56,plain,
additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(c_59,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(c_146,plain,
multiply(a,b) = sP0_iProver_def,
definition ).
cnf(c_147,plain,
additive_inverse(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_148,plain,
additive_inverse(a) = sP2_iProver_def,
definition ).
cnf(c_149,plain,
multiply(sP2_iProver_def,b) = sP3_iProver_def,
definition ).
cnf(c_150,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_49,c_148,c_149,c_146,c_147]) ).
cnf(c_151,plain,
X0 = X0,
theory(equality) ).
cnf(c_152,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_222,plain,
additive_inverse(sP2_iProver_def) = a,
inference(superposition,[status(thm)],[c_148,c_56]) ).
cnf(c_228,plain,
add(sP2_iProver_def,a) = additive_identity,
inference(superposition,[status(thm)],[c_222,c_55]) ).
cnf(c_231,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_59]) ).
cnf(c_238,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_55,c_60]) ).
cnf(c_256,plain,
additive_inverse(additive_identity) = additive_identity,
inference(superposition,[status(thm)],[c_231,c_55]) ).
cnf(c_295,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_238,c_231]) ).
cnf(c_306,plain,
add(additive_inverse(X0),add(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_56,c_295]) ).
cnf(c_313,plain,
add(X0,add(X1,add(additive_inverse(add(X0,X1)),X2))) = X2,
inference(superposition,[status(thm)],[c_295,c_60]) ).
cnf(c_327,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(theory_normalisation,[status(thm)],[c_306,c_60,c_59]) ).
cnf(c_401,plain,
( sP1_iProver_def != X0
| sP3_iProver_def != X0
| sP1_iProver_def = sP3_iProver_def ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_404,plain,
( X0 != X1
| sP3_iProver_def != X1
| sP3_iProver_def = X0 ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_405,plain,
( X0 != sP3_iProver_def
| sP3_iProver_def != sP3_iProver_def
| sP3_iProver_def = X0 ),
inference(instantiation,[status(thm)],[c_404]) ).
cnf(c_406,plain,
sP3_iProver_def = sP3_iProver_def,
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_422,plain,
( add(sP3_iProver_def,additive_identity) != sP3_iProver_def
| sP3_iProver_def != sP3_iProver_def
| sP3_iProver_def = add(sP3_iProver_def,additive_identity) ),
inference(instantiation,[status(thm)],[c_405]) ).
cnf(c_423,plain,
add(sP3_iProver_def,additive_identity) = sP3_iProver_def,
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_475,plain,
( sP1_iProver_def != add(sP3_iProver_def,additive_identity)
| sP3_iProver_def != add(sP3_iProver_def,additive_identity)
| sP1_iProver_def = sP3_iProver_def ),
inference(instantiation,[status(thm)],[c_401]) ).
cnf(c_530,plain,
( add(sP3_iProver_def,additive_identity) != X0
| sP1_iProver_def != X0
| sP1_iProver_def = add(sP3_iProver_def,additive_identity) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_682,plain,
multiply(add(a,X0),b) = add(sP0_iProver_def,multiply(X0,b)),
inference(superposition,[status(thm)],[c_146,c_58]) ).
cnf(c_767,plain,
( add(sP3_iProver_def,additive_identity) != sP1_iProver_def
| sP1_iProver_def != sP1_iProver_def
| sP1_iProver_def = add(sP3_iProver_def,additive_identity) ),
inference(instantiation,[status(thm)],[c_530]) ).
cnf(c_768,plain,
sP1_iProver_def = sP1_iProver_def,
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_1640,plain,
add(X0,additive_inverse(add(X0,X1))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_327,c_313]) ).
cnf(c_2139,plain,
add(X0,additive_inverse(add(X1,X0))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_59,c_1640]) ).
cnf(c_3806,plain,
multiply(add(a,sP2_iProver_def),b) = add(sP0_iProver_def,sP3_iProver_def),
inference(superposition,[status(thm)],[c_149,c_682]) ).
cnf(c_3815,plain,
multiply(add(sP2_iProver_def,a),b) = add(sP0_iProver_def,sP3_iProver_def),
inference(theory_normalisation,[status(thm)],[c_3806,c_60,c_59]) ).
cnf(c_3816,plain,
multiply(additive_identity,b) = add(sP0_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_3815,c_228]) ).
cnf(c_3875,plain,
add(sP0_iProver_def,sP3_iProver_def) = additive_identity,
inference(demodulation,[status(thm)],[c_3816,c_52]) ).
cnf(c_3880,plain,
add(sP3_iProver_def,additive_inverse(additive_identity)) = additive_inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_3875,c_2139]) ).
cnf(c_3883,plain,
add(sP3_iProver_def,additive_identity) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_3880,c_147,c_256]) ).
cnf(c_3888,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3883,c_768,c_767,c_475,c_423,c_422,c_406,c_150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : RNG013-6 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n004.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 : Thu May 2 21:14:33 EDT 2024
% 0.17/0.31 % CPUTime :
% 0.17/0.42 Running UEQ theorem proving
% 0.17/0.42 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.98/1.10 % SZS status Started for theBenchmark.p
% 3.98/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 3.98/1.10
% 3.98/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.98/1.10
% 3.98/1.10 ------ iProver source info
% 3.98/1.10
% 3.98/1.10 git: date: 2024-05-02 19:28:25 +0000
% 3.98/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.98/1.10 git: non_committed_changes: false
% 3.98/1.10
% 3.98/1.10 ------ Parsing...successful
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10 ------ Preprocessing... sup_sim: 1 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
% 3.98/1.10
% 3.98/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.98/1.10
% 3.98/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.98/1.10 ------ Proving...
% 3.98/1.10 ------ Problem Properties
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10 clauses 18
% 3.98/1.10 conjectures 1
% 3.98/1.10 EPR 1
% 3.98/1.10 Horn 18
% 3.98/1.10 unary 18
% 3.98/1.10 binary 0
% 3.98/1.10 lits 18
% 3.98/1.10 lits eq 18
% 3.98/1.10 fd_pure 0
% 3.98/1.10 fd_pseudo 0
% 3.98/1.10 fd_cond 0
% 3.98/1.10 fd_pseudo_cond 0
% 3.98/1.10 AC symbols 1
% 3.98/1.10
% 3.98/1.10 ------ Input Options Time Limit: Unbounded
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10 ------
% 3.98/1.10 Current options:
% 3.98/1.10 ------
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10 ------ Proving...
% 3.98/1.10
% 3.98/1.10
% 3.98/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 3.98/1.10
% 3.98/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.98/1.10
% 3.98/1.10
%------------------------------------------------------------------------------