TSTP Solution File: RNG001-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:33 EDT 2023
% Result : Unsatisfiable 3.87s 1.21s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 30 ( 24 unt; 0 nHn; 10 RR)
% Number of literals : 46 ( 31 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ product(a,additive_identity,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_times_0_is_0) ).
cnf(c_51,plain,
sum(X0,additive_identity,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(c_55,plain,
sum(X0,additive_inverse(X0),additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
cnf(c_57,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X0,X3,X4)
| ~ sum(X1,X5,X3)
| sum(X2,X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(c_58,plain,
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(c_62,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ sum(X1,X3,X5)
| ~ sum(X2,X4,X6)
| product(X0,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity2) ).
cnf(c_74,plain,
multiply(a,additive_identity) != additive_identity,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_76,plain,
add(X0,additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_80,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_83,plain,
( add(X0,X1) != X2
| add(X0,X3) != X4
| add(X1,X5) != X3
| add(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_85,plain,
( add(X0,X1) != X2
| add(X1,X0) = X2 ),
inference(well_definedness,[status(thm)],[c_58]) ).
cnf(c_93,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_62]) ).
cnf(c_212,plain,
add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_85]) ).
cnf(c_218,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_83]) ).
cnf(c_222,plain,
add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_93]) ).
cnf(c_316,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_76,c_212]) ).
cnf(c_324,plain,
additive_inverse(additive_identity) = additive_identity,
inference(superposition,[status(thm)],[c_316,c_80]) ).
cnf(c_331,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_80,c_218]) ).
cnf(c_345,plain,
add(multiply(X0,additive_identity),multiply(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_316,c_222]) ).
cnf(c_356,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_331,c_316]) ).
cnf(c_361,plain,
add(X0,additive_identity) = additive_inverse(additive_inverse(X0)),
inference(superposition,[status(thm)],[c_80,c_356]) ).
cnf(c_362,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_212,c_356]) ).
cnf(c_368,plain,
add(X0,add(X1,add(additive_inverse(add(X0,X1)),X2))) = X2,
inference(superposition,[status(thm)],[c_356,c_218]) ).
cnf(c_374,plain,
additive_inverse(additive_inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_361,c_76]) ).
cnf(c_607,plain,
add(X0,additive_inverse(add(X0,X1))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_362,c_368]) ).
cnf(c_697,plain,
add(multiply(X0,additive_identity),additive_inverse(multiply(X0,X1))) = additive_inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_345,c_607]) ).
cnf(c_1206,plain,
additive_inverse(multiply(X0,additive_identity)) = additive_identity,
inference(superposition,[status(thm)],[c_697,c_80]) ).
cnf(c_1226,plain,
multiply(X0,additive_identity) = additive_inverse(additive_identity),
inference(superposition,[status(thm)],[c_1206,c_374]) ).
cnf(c_1231,plain,
multiply(X0,additive_identity) = additive_identity,
inference(light_normalisation,[status(thm)],[c_1226,c_324]) ).
cnf(c_1241,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_74,c_1231]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.18/0.36 % Computer : n018.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Sun Aug 27 02:42:15 EDT 2023
% 0.18/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.87/1.21 % SZS status Started for theBenchmark.p
% 3.87/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 3.87/1.21
% 3.87/1.21 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.87/1.21
% 3.87/1.21 ------ iProver source info
% 3.87/1.21
% 3.87/1.21 git: date: 2023-05-31 18:12:56 +0000
% 3.87/1.21 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.87/1.21 git: non_committed_changes: false
% 3.87/1.21 git: last_make_outside_of_git: false
% 3.87/1.21
% 3.87/1.21 ------ Parsing...successful
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21 ------ 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.87/1.21
% 3.87/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.87/1.21
% 3.87/1.21 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.87/1.21 ------ Proving...
% 3.87/1.21 ------ Problem Properties
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21 clauses 8
% 3.87/1.21 conjectures 0
% 3.87/1.21 EPR 0
% 3.87/1.21 Horn 8
% 3.87/1.21 unary 8
% 3.87/1.21 binary 0
% 3.87/1.21 lits 8
% 3.87/1.21 lits eq 8
% 3.87/1.21 fd_pure 0
% 3.87/1.21 fd_pseudo 0
% 3.87/1.21 fd_cond 0
% 3.87/1.21 fd_pseudo_cond 0
% 3.87/1.21 AC symbols 1
% 3.87/1.21
% 3.87/1.21 ------ Schedule UEQ
% 3.87/1.21
% 3.87/1.21 ------ Option_UEQ Time Limit: 10.
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21 ------
% 3.87/1.21 Current options:
% 3.87/1.21 ------
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21 ------ Proving...
% 3.87/1.21
% 3.87/1.21
% 3.87/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 3.87/1.21
% 3.87/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.87/1.21
% 3.87/1.21
%------------------------------------------------------------------------------