TSTP Solution File: RNG007-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG007-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:13 EDT 2024
% Result : Unsatisfiable 2.38s 1.11s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boolean_ring) ).
cnf(c_50,negated_conjecture,
add(a,a) != additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse) ).
cnf(c_52,plain,
add(additive_inverse(X0),X0) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',left_additive_inverse) ).
cnf(c_56,plain,
additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',additive_inverse_additive_inverse) ).
cnf(c_60,plain,
multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse1) ).
cnf(c_61,plain,
multiply(additive_inverse(X0),X1) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse2) ).
cnf(c_62,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',associative_addition) ).
cnf(c_63,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',commutative_addition) ).
cnf(c_77,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(theory_normalisation,[status(thm)],[c_52,c_62,c_63]) ).
cnf(c_111,plain,
multiply(additive_inverse(X0),X1) = multiply(X0,additive_inverse(X1)),
inference(light_normalisation,[status(thm)],[c_60,c_61]) ).
cnf(c_119,plain,
add(a,a) = sP0_iProver_def,
definition ).
cnf(c_120,negated_conjecture,
sP0_iProver_def != additive_identity,
inference(demodulation,[status(thm)],[c_50,c_119]) ).
cnf(c_214,plain,
multiply(X0,additive_inverse(additive_inverse(X0))) = additive_inverse(X0),
inference(superposition,[status(thm)],[c_111,c_49]) ).
cnf(c_219,plain,
additive_inverse(X0) = X0,
inference(light_normalisation,[status(thm)],[c_214,c_49,c_56]) ).
cnf(c_224,plain,
add(X0,X0) = additive_identity,
inference(demodulation,[status(thm)],[c_77,c_219]) ).
cnf(c_227,plain,
additive_identity = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_119,c_224]) ).
cnf(c_231,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_120,c_227]) ).
cnf(c_232,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_231]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : RNG007-4 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 21:38:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running UEQ theorem proving
% 0.17/0.43 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
% 2.38/1.11 % SZS status Started for theBenchmark.p
% 2.38/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.38/1.11
% 2.38/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.38/1.11
% 2.38/1.11 ------ iProver source info
% 2.38/1.11
% 2.38/1.11 git: date: 2024-05-02 19:28:25 +0000
% 2.38/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.38/1.11 git: non_committed_changes: false
% 2.38/1.11
% 2.38/1.11 ------ Parsing...successful
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.38/1.11
% 2.38/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.38/1.11
% 2.38/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.38/1.11 ------ Proving...
% 2.38/1.11 ------ Problem Properties
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11 clauses 17
% 2.38/1.11 conjectures 1
% 2.38/1.11 EPR 1
% 2.38/1.11 Horn 17
% 2.38/1.11 unary 17
% 2.38/1.11 binary 0
% 2.38/1.11 lits 17
% 2.38/1.11 lits eq 17
% 2.38/1.11 fd_pure 0
% 2.38/1.11 fd_pseudo 0
% 2.38/1.11 fd_cond 0
% 2.38/1.11 fd_pseudo_cond 0
% 2.38/1.11 AC symbols 1
% 2.38/1.11
% 2.38/1.11 ------ Input Options Time Limit: Unbounded
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11 ------
% 2.38/1.11 Current options:
% 2.38/1.11 ------
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11 ------ Proving...
% 2.38/1.11
% 2.38/1.11
% 2.38/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.38/1.11
% 2.38/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.38/1.11
% 2.38/1.11
%------------------------------------------------------------------------------