TSTP Solution File: RNG004-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG004-2 : 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 : Fri May 3 02:57:11 EDT 2024
% Result : Unsatisfiable 3.61s 1.15s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 43 ( 31 unt; 0 nHn; 24 RR)
% Number of literals : 73 ( 50 equ; 33 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 : 91 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X1,X2)
| X0 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cancellation2) ).
cnf(c_51,plain,
product(a,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).
cnf(c_52,plain,
product(additive_inverse(a),additive_inverse(b),d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b_inverse) ).
cnf(c_53,negated_conjecture,
c != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
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_68,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_80,plain,
( add(X0,X1) != X2
| add(X3,X1) != X2
| X0 = X3 ),
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_82,plain,
multiply(a,b) = c,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_83,plain,
multiply(additive_inverse(a),additive_inverse(b)) = d,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_85,plain,
add(X0,additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_89,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_59]) ).
cnf(c_92,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_94,plain,
( add(X0,X1) != X2
| add(X1,X0) = X2 ),
inference(well_definedness,[status(thm)],[c_62]) ).
cnf(c_102,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_106,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_68]) ).
cnf(c_237,plain,
add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_94]) ).
cnf(c_241,plain,
( add(X0,X1) != add(X2,X1)
| X0 = X2 ),
inference(unflattening,[status(thm)],[c_80]) ).
cnf(c_251,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_92]) ).
cnf(c_253,plain,
add(multiply(X0,X1),multiply(X2,X1)) = multiply(add(X0,X2),X1),
inference(unflattening,[status(thm)],[c_106]) ).
cnf(c_255,plain,
add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_102]) ).
cnf(c_347,negated_conjecture,
c != d,
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_410,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_85,c_237]) ).
cnf(c_429,plain,
( add(X0,X1) != X1
| X0 = additive_identity ),
inference(superposition,[status(thm)],[c_410,c_241]) ).
cnf(c_488,plain,
add(multiply(additive_identity,X0),multiply(X1,X0)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_410,c_253]) ).
cnf(c_490,plain,
add(multiply(X0,X1),multiply(additive_inverse(X0),X1)) = multiply(additive_identity,X1),
inference(superposition,[status(thm)],[c_89,c_253]) ).
cnf(c_730,plain,
add(multiply(X0,additive_identity),multiply(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_410,c_255]) ).
cnf(c_732,plain,
add(multiply(X0,X1),multiply(X0,additive_inverse(X1))) = multiply(X0,additive_identity),
inference(superposition,[status(thm)],[c_89,c_255]) ).
cnf(c_1316,plain,
multiply(additive_identity,X0) = additive_identity,
inference(superposition,[status(thm)],[c_488,c_429]) ).
cnf(c_1500,plain,
multiply(X0,additive_identity) = additive_identity,
inference(superposition,[status(thm)],[c_730,c_429]) ).
cnf(c_1795,plain,
add(multiply(X0,X1),multiply(additive_inverse(X0),X1)) = additive_identity,
inference(demodulation,[status(thm)],[c_490,c_1316]) ).
cnf(c_1796,plain,
add(c,multiply(additive_inverse(a),b)) = additive_identity,
inference(superposition,[status(thm)],[c_82,c_1795]) ).
cnf(c_2005,plain,
add(c,add(multiply(additive_inverse(a),b),X0)) = add(additive_identity,X0),
inference(superposition,[status(thm)],[c_1796,c_251]) ).
cnf(c_2024,plain,
add(c,add(multiply(additive_inverse(a),b),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_2005,c_410]) ).
cnf(c_3174,plain,
add(multiply(X0,X1),multiply(X0,additive_inverse(X1))) = additive_identity,
inference(light_normalisation,[status(thm)],[c_732,c_1500]) ).
cnf(c_3214,plain,
multiply(additive_inverse(a),additive_inverse(b)) = add(c,additive_identity),
inference(superposition,[status(thm)],[c_3174,c_2024]) ).
cnf(c_3224,plain,
multiply(additive_inverse(a),additive_inverse(b)) = add(additive_identity,c),
inference(theory_normalisation,[status(thm)],[c_3214,c_251,c_237]) ).
cnf(c_3253,plain,
add(additive_identity,c) = d,
inference(demodulation,[status(thm)],[c_83,c_3224]) ).
cnf(c_3261,plain,
add(additive_identity,c) != c,
inference(demodulation,[status(thm)],[c_347,c_3253]) ).
cnf(c_3262,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3261,c_410]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG004-2 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 21:17:49 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.61/1.15 % SZS status Started for theBenchmark.p
% 3.61/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.15
% 3.61/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.61/1.15
% 3.61/1.15 ------ iProver source info
% 3.61/1.15
% 3.61/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.61/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.61/1.15 git: non_committed_changes: false
% 3.61/1.15
% 3.61/1.15 ------ Parsing...successful
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15 ------ Preprocessing... sup_sim: 17 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.61/1.15
% 3.61/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.61/1.15
% 3.61/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.61/1.15 ------ Proving...
% 3.61/1.15 ------ Problem Properties
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15 clauses 12
% 3.61/1.15 conjectures 1
% 3.61/1.15 EPR 1
% 3.61/1.15 Horn 12
% 3.61/1.15 unary 10
% 3.61/1.15 binary 2
% 3.61/1.15 lits 14
% 3.61/1.15 lits eq 14
% 3.61/1.15 fd_pure 0
% 3.61/1.15 fd_pseudo 0
% 3.61/1.15 fd_cond 0
% 3.61/1.15 fd_pseudo_cond 2
% 3.61/1.15 AC symbols 1
% 3.61/1.15
% 3.61/1.15 ------ Schedule dynamic 5 is on
% 3.61/1.15
% 3.61/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15 ------
% 3.61/1.15 Current options:
% 3.61/1.15 ------
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15 ------ Proving...
% 3.61/1.15
% 3.61/1.15
% 3.61/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.15
% 3.61/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.61/1.15
% 3.61/1.15
%------------------------------------------------------------------------------