TSTP Solution File: RNG008-5 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG008-5 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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:38 EDT 2023
% Result : Unsatisfiable 3.79s 1.17s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 13
% Syntax : Number of clauses : 61 ( 53 unt; 0 nHn; 22 RR)
% Number of literals : 85 ( 59 equ; 27 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
sum(additive_inverse(additive_inverse(X0)),additive_identity,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_additive_inverse) ).
cnf(c_52,plain,
product(additive_identity,X0,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_additive_id2) ).
cnf(c_53,plain,
sum(additive_inverse(X0),additive_inverse(X1),additive_inverse(add(X0,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distribute_additive_inverse) ).
cnf(c_54,plain,
product(X0,additive_inverse(X1),additive_inverse(multiply(X0,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_additive_inverse) ).
cnf(c_55,plain,
product(X0,X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_squared_is_x) ).
cnf(c_56,plain,
product(a,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b_is_c) ).
cnf(c_57,negated_conjecture,
~ product(b,a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_times_a_is_c) ).
cnf(c_59,plain,
sum(X0,additive_identity,X0),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(c_63,plain,
sum(X0,additive_inverse(X0),additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
cnf(c_65,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_66,plain,
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(c_70,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X4,X5)
| ~ product(X6,X0,X3)
| ~ product(X6,X1,X4)
| product(X6,X2,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity2) ).
cnf(c_72,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X4,X5)
| ~ product(X0,X6,X3)
| ~ product(X1,X6,X4)
| product(X2,X6,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity4) ).
cnf(c_87,plain,
add(additive_inverse(additive_inverse(X0)),additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_89,plain,
multiply(additive_identity,X0) = additive_identity,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_90,plain,
add(additive_inverse(X0),additive_inverse(X1)) = additive_inverse(add(X0,X1)),
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_91,plain,
additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
inference(well_definedness,[status(thm)],[c_54]) ).
cnf(c_92,plain,
multiply(X0,X0) = X0,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_93,plain,
multiply(a,b) = c,
inference(well_definedness,[status(thm)],[c_56]) ).
cnf(c_94,plain,
multiply(b,a) != c,
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_96,plain,
add(X0,additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_59]) ).
cnf(c_100,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_63]) ).
cnf(c_103,plain,
( add(X0,X1) != X2
| add(X0,X3) != X4
| add(X1,X5) != X3
| add(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_65]) ).
cnf(c_105,plain,
( add(X0,X1) != X2
| add(X1,X0) = X2 ),
inference(well_definedness,[status(thm)],[c_66]) ).
cnf(c_113,plain,
( add(X0,X1) != X2
| add(X3,X4) != X5
| multiply(X6,X0) != X3
| multiply(X6,X1) != X4
| multiply(X6,X2) = X5 ),
inference(well_definedness,[status(thm)],[c_70]) ).
cnf(c_117,plain,
( add(X0,X1) != X2
| add(X3,X4) != X5
| multiply(X0,X6) != X3
| multiply(X1,X6) != X4
| multiply(X2,X6) = X5 ),
inference(well_definedness,[status(thm)],[c_72]) ).
cnf(c_249,plain,
additive_inverse(additive_inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_87,c_96]) ).
cnf(c_250,plain,
add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_105]) ).
cnf(c_256,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_103]) ).
cnf(c_258,plain,
add(multiply(X0,X1),multiply(X2,X1)) = multiply(add(X0,X2),X1),
inference(unflattening,[status(thm)],[c_117]) ).
cnf(c_260,plain,
add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_113]) ).
cnf(c_421,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_250,c_96]) ).
cnf(c_424,plain,
multiply(X0,additive_inverse(X0)) = additive_inverse(X0),
inference(superposition,[status(thm)],[c_92,c_91]) ).
cnf(c_442,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_100,c_256]) ).
cnf(c_464,plain,
multiply(additive_inverse(X0),X0) = X0,
inference(superposition,[status(thm)],[c_249,c_424]) ).
cnf(c_477,plain,
multiply(add(additive_inverse(X0),additive_inverse(X1)),add(X0,X1)) = add(X0,X1),
inference(superposition,[status(thm)],[c_90,c_464]) ).
cnf(c_517,plain,
add(multiply(X0,X1),multiply(additive_inverse(X0),X1)) = multiply(additive_identity,X1),
inference(superposition,[status(thm)],[c_100,c_258]) ).
cnf(c_661,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_442,c_421]) ).
cnf(c_670,plain,
add(additive_inverse(X0),add(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_249,c_661]) ).
cnf(c_685,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(theory_normalisation,[status(thm)],[c_670,c_256,c_250]) ).
cnf(c_1039,plain,
add(multiply(X0,X1),multiply(additive_inverse(X0),X1)) = additive_identity,
inference(demodulation,[status(thm)],[c_517,c_89]) ).
cnf(c_1065,plain,
add(multiply(X0,X0),X0) = additive_identity,
inference(superposition,[status(thm)],[c_464,c_1039]) ).
cnf(c_1084,plain,
add(X0,multiply(X0,X0)) = additive_identity,
inference(theory_normalisation,[status(thm)],[c_1065,c_256,c_250]) ).
cnf(c_1085,plain,
add(X0,X0) = additive_identity,
inference(light_normalisation,[status(thm)],[c_1084,c_92]) ).
cnf(c_1129,plain,
add(X0,add(X0,X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_1085,c_256]) ).
cnf(c_1140,plain,
add(X0,additive_identity) = additive_inverse(X0),
inference(superposition,[status(thm)],[c_1085,c_685]) ).
cnf(c_1142,plain,
additive_inverse(X0) = X0,
inference(light_normalisation,[status(thm)],[c_1140,c_96]) ).
cnf(c_1157,plain,
add(X0,add(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_661,c_1142]) ).
cnf(c_1233,plain,
multiply(add(X0,additive_inverse(X1)),add(X0,X1)) = add(X0,X1),
inference(light_normalisation,[status(thm)],[c_477,c_1142]) ).
cnf(c_1234,plain,
add(add(X0,multiply(X0,X1)),add(multiply(X1,X0),X1)) = add(X0,X1),
inference(demodulation,[status(thm)],[c_1233,c_92,c_258,c_260,c_1142]) ).
cnf(c_1235,plain,
add(X0,add(X1,add(multiply(X0,X1),multiply(X1,X0)))) = add(X0,X1),
inference(theory_normalisation,[status(thm)],[c_1234,c_256,c_250]) ).
cnf(c_1261,plain,
add(b,add(a,add(multiply(b,a),c))) = add(b,a),
inference(superposition,[status(thm)],[c_93,c_1235]) ).
cnf(c_1288,plain,
add(a,add(b,add(c,multiply(b,a)))) = add(a,b),
inference(theory_normalisation,[status(thm)],[c_1261,c_256,c_250]) ).
cnf(c_1371,plain,
add(b,add(c,multiply(b,a))) = add(a,add(a,b)),
inference(superposition,[status(thm)],[c_1288,c_1157]) ).
cnf(c_1394,plain,
add(b,add(c,multiply(b,a))) = b,
inference(demodulation,[status(thm)],[c_1371,c_421,c_1129]) ).
cnf(c_1395,plain,
add(c,multiply(b,a)) = add(b,b),
inference(superposition,[status(thm)],[c_1394,c_1157]) ).
cnf(c_1403,plain,
add(c,multiply(b,a)) = additive_identity,
inference(demodulation,[status(thm)],[c_1395,c_1085]) ).
cnf(c_1404,plain,
add(c,additive_identity) = multiply(b,a),
inference(superposition,[status(thm)],[c_1403,c_1157]) ).
cnf(c_1410,plain,
add(additive_identity,c) = multiply(b,a),
inference(theory_normalisation,[status(thm)],[c_1404,c_256,c_250]) ).
cnf(c_1419,plain,
add(additive_identity,c) != c,
inference(demodulation,[status(thm)],[c_94,c_1410]) ).
cnf(c_1420,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1419,c_421]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG008-5 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n001.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 03:16:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.79/1.17 % SZS status Started for theBenchmark.p
% 3.79/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.79/1.17
% 3.79/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.79/1.17
% 3.79/1.17 ------ iProver source info
% 3.79/1.17
% 3.79/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.79/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.79/1.17 git: non_committed_changes: false
% 3.79/1.17 git: last_make_outside_of_git: false
% 3.79/1.17
% 3.79/1.17 ------ Parsing...successful
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 ------ 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.79/1.17
% 3.79/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.79/1.17
% 3.79/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.79/1.17 ------ Proving...
% 3.79/1.17 ------ Problem Properties
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 clauses 15
% 3.79/1.17 conjectures 0
% 3.79/1.17 EPR 0
% 3.79/1.17 Horn 15
% 3.79/1.17 unary 15
% 3.79/1.17 binary 0
% 3.79/1.17 lits 15
% 3.79/1.17 lits eq 15
% 3.79/1.17 fd_pure 0
% 3.79/1.17 fd_pseudo 0
% 3.79/1.17 fd_cond 0
% 3.79/1.17 fd_pseudo_cond 0
% 3.79/1.17 AC symbols 1
% 3.79/1.17
% 3.79/1.17 ------ Schedule UEQ
% 3.79/1.17
% 3.79/1.17 ------ Option_UEQ Time Limit: 10.
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 ------
% 3.79/1.17 Current options:
% 3.79/1.17 ------
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 ------ Proving...
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.79/1.17
% 3.79/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.79/1.17
% 3.79/1.17
%------------------------------------------------------------------------------