TSTP Solution File: RNG002-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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.51s 1.11s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 22 unt; 0 nHn; 14 RR)
% Number of literals : 34 ( 23 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
sum(a,b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_b_is_d) ).
cnf(c_50,plain,
sum(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_c_is_d) ).
cnf(c_51,negated_conjecture,
b != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_equals_c) ).
cnf(c_53,plain,
sum(X0,additive_identity,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(c_57,plain,
sum(X0,additive_inverse(X0),additive_identity),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(c_60,plain,
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(c_76,plain,
add(a,b) = d,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_77,plain,
add(a,c) = d,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_79,plain,
add(X0,additive_identity) = X0,
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_83,plain,
add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_86,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_88,plain,
( add(X0,X1) != X2
| add(X1,X0) = X2 ),
inference(well_definedness,[status(thm)],[c_60]) ).
cnf(c_219,plain,
add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_88]) ).
cnf(c_225,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_86]) ).
cnf(c_289,negated_conjecture,
b != c,
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_336,plain,
add(a,b) = add(a,c),
inference(light_normalisation,[status(thm)],[c_77,c_76]) ).
cnf(c_337,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_79,c_219]) ).
cnf(c_350,plain,
add(add(a,b),X0) = add(a,add(c,X0)),
inference(superposition,[status(thm)],[c_336,c_225]) ).
cnf(c_353,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_83,c_225]) ).
cnf(c_356,plain,
add(a,add(b,X0)) = add(a,add(c,X0)),
inference(theory_normalisation,[status(thm)],[c_350,c_225,c_219]) ).
cnf(c_381,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_353,c_337]) ).
cnf(c_387,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_219,c_381]) ).
cnf(c_532,plain,
add(a,add(b,additive_inverse(a))) = c,
inference(superposition,[status(thm)],[c_356,c_387]) ).
cnf(c_600,plain,
b = c,
inference(demodulation,[status(thm)],[c_532,c_387]) ).
cnf(c_601,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_600,c_289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 21:14:03 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.51/1.11 % SZS status Started for theBenchmark.p
% 3.51/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.51/1.11
% 3.51/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.51/1.11
% 3.51/1.11 ------ iProver source info
% 3.51/1.11
% 3.51/1.11 git: date: 2024-05-02 19:28:25 +0000
% 3.51/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.51/1.11 git: non_committed_changes: false
% 3.51/1.11
% 3.51/1.11 ------ Parsing...successful
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11 ------ 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.51/1.11
% 3.51/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.51/1.11
% 3.51/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.51/1.11 ------ Proving...
% 3.51/1.11 ------ Problem Properties
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11 clauses 10
% 3.51/1.11 conjectures 1
% 3.51/1.11 EPR 1
% 3.51/1.11 Horn 10
% 3.51/1.11 unary 10
% 3.51/1.11 binary 0
% 3.51/1.11 lits 10
% 3.51/1.11 lits eq 10
% 3.51/1.11 fd_pure 0
% 3.51/1.11 fd_pseudo 0
% 3.51/1.11 fd_cond 0
% 3.51/1.11 fd_pseudo_cond 0
% 3.51/1.11 AC symbols 1
% 3.51/1.11
% 3.51/1.11 ------ Schedule UEQ
% 3.51/1.11
% 3.51/1.11 ------ Option_UEQ Time Limit: 10.
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11 ------
% 3.51/1.11 Current options:
% 3.51/1.11 ------
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11 ------ Proving...
% 3.51/1.11
% 3.51/1.11
% 3.51/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.51/1.11
% 3.51/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.51/1.12
% 3.51/1.12
%------------------------------------------------------------------------------