TSTP Solution File: RNG005-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 : Thu Aug 31 13:54:35 EDT 2023
% Result : Unsatisfiable 3.75s 1.11s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of clauses : 47 ( 41 unt; 0 nHn; 26 RR)
% Number of literals : 63 ( 46 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
product(a,b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).
cnf(c_50,plain,
product(additive_inverse(a),b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b) ).
cnf(c_51,negated_conjecture,
~ sum(c,d,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sum_is_additive_id) ).
cnf(c_53,plain,
sum(X0,additive_identity,X0),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(c_57,plain,
sum(X0,additive_inverse(X0),additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
cnf(c_59,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X0,X3,X4)
| ~ sum(X1,X5,X3)
| sum(X2,X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(c_60,plain,
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(c_66,plain,
( ~ product(X0,X1,X2)
| ~ product(X3,X1,X4)
| ~ sum(X0,X3,X5)
| ~ sum(X2,X4,X6)
| product(X5,X1,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity4) ).
cnf(c_76,plain,
multiply(a,b) = d,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_77,plain,
multiply(additive_inverse(a),b) = c,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_78,plain,
add(c,d) != additive_identity,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_80,plain,
add(X0,additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_84,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_87,plain,
( add(X0,X1) != X2
| add(X0,X3) != X4
| add(X1,X5) != X3
| add(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_59]) ).
cnf(c_89,plain,
( add(X0,X1) != X2
| add(X1,X0) = X2 ),
inference(well_definedness,[status(thm)],[c_60]) ).
cnf(c_101,plain,
( multiply(X0,X1) != X2
| multiply(X3,X1) != X4
| add(X0,X3) != X5
| add(X2,X4) != X6
| multiply(X5,X1) = X6 ),
inference(well_definedness,[status(thm)],[c_66]) ).
cnf(c_220,plain,
add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_89]) ).
cnf(c_221,plain,
add(d,c) != additive_identity,
inference(demodulation,[status(thm)],[c_78,c_220]) ).
cnf(c_227,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_87]) ).
cnf(c_229,plain,
add(multiply(X0,X1),multiply(X2,X1)) = multiply(add(X0,X2),X1),
inference(unflattening,[status(thm)],[c_101]) ).
cnf(c_345,plain,
add(X0,add(X1,X2)) = add(X1,add(X0,X2)),
inference(superposition,[status(thm)],[c_227,c_220]) ).
cnf(c_346,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_80,c_220]) ).
cnf(c_363,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_84,c_227]) ).
cnf(c_365,plain,
add(X0,add(X1,additive_inverse(add(X0,X1)))) = additive_identity,
inference(superposition,[status(thm)],[c_227,c_84]) ).
cnf(c_367,plain,
add(multiply(additive_identity,X0),multiply(X1,X0)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_346,c_229]) ).
cnf(c_369,plain,
add(multiply(X0,X1),multiply(additive_inverse(X0),X1)) = multiply(additive_identity,X1),
inference(superposition,[status(thm)],[c_84,c_229]) ).
cnf(c_397,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_363,c_346]) ).
cnf(c_402,plain,
additive_inverse(additive_inverse(X0)) = add(X0,additive_identity),
inference(superposition,[status(thm)],[c_84,c_397]) ).
cnf(c_403,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_220,c_397]) ).
cnf(c_415,plain,
additive_inverse(additive_inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_402,c_80]) ).
cnf(c_468,plain,
add(X0,additive_inverse(add(additive_inverse(X1),X0))) = add(X1,additive_identity),
inference(superposition,[status(thm)],[c_365,c_397]) ).
cnf(c_520,plain,
add(X0,add(X1,additive_inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_345,c_403]) ).
cnf(c_530,plain,
add(multiply(additive_identity,b),c) = c,
inference(superposition,[status(thm)],[c_77,c_367]) ).
cnf(c_544,plain,
add(c,multiply(additive_identity,b)) = c,
inference(theory_normalisation,[status(thm)],[c_530,c_227,c_220]) ).
cnf(c_649,plain,
add(X0,additive_inverse(add(additive_inverse(X1),X0))) = X1,
inference(demodulation,[status(thm)],[c_468,c_80]) ).
cnf(c_663,plain,
add(X0,additive_inverse(add(X1,X0))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_415,c_649]) ).
cnf(c_752,plain,
add(multiply(additive_identity,b),additive_inverse(c)) = additive_inverse(c),
inference(superposition,[status(thm)],[c_544,c_663]) ).
cnf(c_830,plain,
add(multiply(a,b),c) = multiply(additive_identity,b),
inference(superposition,[status(thm)],[c_77,c_369]) ).
cnf(c_845,plain,
add(c,multiply(a,b)) = multiply(additive_identity,b),
inference(theory_normalisation,[status(thm)],[c_830,c_227,c_220]) ).
cnf(c_846,plain,
multiply(additive_identity,b) = add(c,d),
inference(light_normalisation,[status(thm)],[c_845,c_76]) ).
cnf(c_847,plain,
multiply(additive_identity,b) = add(d,c),
inference(theory_normalisation,[status(thm)],[c_846,c_227,c_220]) ).
cnf(c_904,plain,
add(add(d,c),additive_inverse(c)) = additive_inverse(c),
inference(light_normalisation,[status(thm)],[c_752,c_847]) ).
cnf(c_905,plain,
add(d,add(c,additive_inverse(c))) = additive_inverse(c),
inference(theory_normalisation,[status(thm)],[c_904,c_227,c_220]) ).
cnf(c_906,plain,
additive_inverse(c) = d,
inference(demodulation,[status(thm)],[c_905,c_520]) ).
cnf(c_911,plain,
add(c,d) = additive_identity,
inference(superposition,[status(thm)],[c_906,c_84]) ).
cnf(c_912,plain,
add(d,c) = additive_identity,
inference(theory_normalisation,[status(thm)],[c_911,c_227,c_220]) ).
cnf(c_913,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_912,c_221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n025.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 : Sun Aug 27 01:47:08 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.75/1.11 % SZS status Started for theBenchmark.p
% 3.75/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.75/1.11
% 3.75/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.75/1.11
% 3.75/1.11 ------ iProver source info
% 3.75/1.11
% 3.75/1.11 git: date: 2023-05-31 18:12:56 +0000
% 3.75/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.75/1.11 git: non_committed_changes: false
% 3.75/1.11 git: last_make_outside_of_git: false
% 3.75/1.11
% 3.75/1.11 ------ Parsing...successful
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11 ------ Preprocessing... sup_sim: 16 sf_s rm: 0 0s sf_e pe_s pe_e 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.75/1.11
% 3.75/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.75/1.11
% 3.75/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.75/1.11 ------ Proving...
% 3.75/1.11 ------ Problem Properties
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11 clauses 10
% 3.75/1.11 conjectures 0
% 3.75/1.11 EPR 0
% 3.75/1.11 Horn 10
% 3.75/1.11 unary 10
% 3.75/1.11 binary 0
% 3.75/1.11 lits 10
% 3.75/1.11 lits eq 10
% 3.75/1.11 fd_pure 0
% 3.75/1.11 fd_pseudo 0
% 3.75/1.11 fd_cond 0
% 3.75/1.11 fd_pseudo_cond 0
% 3.75/1.11 AC symbols 1
% 3.75/1.11
% 3.75/1.11 ------ Schedule UEQ
% 3.75/1.11
% 3.75/1.11 ------ Option_UEQ Time Limit: 10.
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11 ------
% 3.75/1.11 Current options:
% 3.75/1.11 ------
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11 ------ Proving...
% 3.75/1.11
% 3.75/1.11
% 3.75/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.75/1.11
% 3.75/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.11
% 3.75/1.11
%------------------------------------------------------------------------------