TSTP Solution File: RNG006-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG006-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:37 EDT 2023
% Result : Unsatisfiable 3.86s 1.16s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of clauses : 45 ( 39 unt; 0 nHn; 28 RR)
% Number of literals : 61 ( 42 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
sum(b,additive_inverse(c),bS_Ic),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_plus_inverse_c) ).
cnf(c_50,plain,
product(a,b,aPb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).
cnf(c_51,plain,
product(a,c,aPc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_c) ).
cnf(c_52,plain,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aPb_plus_IaPc) ).
cnf(c_53,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_times_bS_Ic_is_aPb_S__IaPc) ).
cnf(c_55,plain,
sum(X0,additive_identity,X0),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(c_59,plain,
sum(X0,additive_inverse(X0),additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
cnf(c_61,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_62,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,
( ~ 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_78,plain,
add(b,additive_inverse(c)) = bS_Ic,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_79,plain,
multiply(a,b) = aPb,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_80,plain,
multiply(a,c) = aPc,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_81,plain,
add(aPb,additive_inverse(aPc)) = aPb_S_IaPc,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_82,plain,
multiply(a,bS_Ic) != aPb_S_IaPc,
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_84,plain,
add(X0,additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_88,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_59]) ).
cnf(c_91,plain,
( add(X0,X1) != X2
| add(X0,X3) != X4
| add(X1,X5) != X3
| add(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_61]) ).
cnf(c_93,plain,
( add(X0,X1) != X2
| add(X1,X0) = X2 ),
inference(well_definedness,[status(thm)],[c_62]) ).
cnf(c_101,plain,
( multiply(X0,X1) != X2
| multiply(X0,X3) != X4
| add(X1,X3) != X5
| add(X2,X4) != X6
| multiply(X0,X5) = X6 ),
inference(well_definedness,[status(thm)],[c_66]) ).
cnf(c_228,plain,
add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_93]) ).
cnf(c_234,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_91]) ).
cnf(c_238,plain,
add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_101]) ).
cnf(c_365,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_84,c_228]) ).
cnf(c_373,plain,
add(b,add(additive_inverse(c),X0)) = add(bS_Ic,X0),
inference(superposition,[status(thm)],[c_78,c_234]) ).
cnf(c_374,plain,
add(aPb,add(additive_inverse(aPc),X0)) = add(aPb_S_IaPc,X0),
inference(superposition,[status(thm)],[c_81,c_234]) ).
cnf(c_376,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_88,c_234]) ).
cnf(c_428,plain,
add(bS_Ic,additive_inverse(additive_inverse(c))) = add(b,additive_identity),
inference(superposition,[status(thm)],[c_88,c_373]) ).
cnf(c_435,plain,
add(bS_Ic,additive_inverse(additive_inverse(c))) = add(additive_identity,b),
inference(theory_normalisation,[status(thm)],[c_428,c_234,c_228]) ).
cnf(c_437,plain,
add(bS_Ic,additive_inverse(additive_inverse(c))) = b,
inference(demodulation,[status(thm)],[c_435,c_365]) ).
cnf(c_460,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_376,c_365]) ).
cnf(c_465,plain,
additive_inverse(additive_inverse(X0)) = add(X0,additive_identity),
inference(superposition,[status(thm)],[c_88,c_460]) ).
cnf(c_466,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_228,c_460]) ).
cnf(c_480,plain,
additive_inverse(additive_inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_465,c_84]) ).
cnf(c_482,plain,
add(bS_Ic,c) = b,
inference(demodulation,[status(thm)],[c_437,c_480]) ).
cnf(c_485,plain,
add(c,bS_Ic) = b,
inference(theory_normalisation,[status(thm)],[c_482,c_234,c_228]) ).
cnf(c_503,plain,
add(multiply(X0,c),multiply(X0,bS_Ic)) = multiply(X0,b),
inference(superposition,[status(thm)],[c_485,c_238]) ).
cnf(c_527,plain,
add(aPb_S_IaPc,additive_inverse(aPb)) = additive_inverse(aPc),
inference(superposition,[status(thm)],[c_466,c_374]) ).
cnf(c_1269,plain,
add(aPc,multiply(a,bS_Ic)) = multiply(a,b),
inference(superposition,[status(thm)],[c_80,c_503]) ).
cnf(c_1284,plain,
add(aPc,multiply(a,bS_Ic)) = aPb,
inference(light_normalisation,[status(thm)],[c_1269,c_79]) ).
cnf(c_1291,plain,
add(aPc,add(multiply(a,bS_Ic),X0)) = add(aPb,X0),
inference(superposition,[status(thm)],[c_1284,c_234]) ).
cnf(c_1959,plain,
add(aPb,additive_inverse(aPc)) = multiply(a,bS_Ic),
inference(superposition,[status(thm)],[c_1291,c_466]) ).
cnf(c_1962,plain,
add(aPb,add(aPb_S_IaPc,additive_inverse(aPb))) = multiply(a,bS_Ic),
inference(light_normalisation,[status(thm)],[c_1959,c_527]) ).
cnf(c_2046,plain,
multiply(a,bS_Ic) = aPb_S_IaPc,
inference(demodulation,[status(thm)],[c_1962,c_466]) ).
cnf(c_2047,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2046,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG006-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 02:47:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.86/1.16 % SZS status Started for theBenchmark.p
% 3.86/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.16
% 3.86/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.86/1.16
% 3.86/1.16 ------ iProver source info
% 3.86/1.16
% 3.86/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.86/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.86/1.16 git: non_committed_changes: false
% 3.86/1.16 git: last_make_outside_of_git: false
% 3.86/1.16
% 3.86/1.16 ------ Parsing...successful
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16 ------ Preprocessing... sup_sim: 15 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.86/1.16
% 3.86/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.86/1.16
% 3.86/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.86/1.16 ------ Proving...
% 3.86/1.16 ------ Problem Properties
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16 clauses 12
% 3.86/1.16 conjectures 0
% 3.86/1.16 EPR 0
% 3.86/1.16 Horn 12
% 3.86/1.16 unary 12
% 3.86/1.16 binary 0
% 3.86/1.16 lits 12
% 3.86/1.16 lits eq 12
% 3.86/1.16 fd_pure 0
% 3.86/1.16 fd_pseudo 0
% 3.86/1.16 fd_cond 0
% 3.86/1.16 fd_pseudo_cond 0
% 3.86/1.16 AC symbols 1
% 3.86/1.16
% 3.86/1.16 ------ Schedule UEQ
% 3.86/1.16
% 3.86/1.16 ------ Option_UEQ Time Limit: 10.
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16 ------
% 3.86/1.16 Current options:
% 3.86/1.16 ------
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16 ------ Proving...
% 3.86/1.16
% 3.86/1.16
% 3.86/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.16
% 3.86/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.86/1.17
% 3.86/1.17
%------------------------------------------------------------------------------