TSTP Solution File: FLD003-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : FLD003-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:15:05 EDT 2024
% Result : Unsatisfiable 7.34s 1.68s
% Output : CNFRefutation 7.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 7 unt; 0 nHn; 32 RR)
% Number of literals : 73 ( 0 equ; 52 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_50,plain,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_51,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_not_equal_to_a_3) ).
cnf(c_53,plain,
( ~ defined(X0)
| equalish(add(additive_identity,X0),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(c_54,plain,
( ~ defined(X0)
| equalish(add(X0,additive_inverse(X0)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(c_55,plain,
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(X0,X1),add(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(c_61,plain,
( ~ defined(X0)
| ~ defined(X1)
| defined(add(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
cnf(c_63,plain,
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_74,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(c_75,plain,
( ~ equalish(X0,X1)
| ~ defined(X2)
| equalish(add(X0,X2),add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(c_327,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),X0)
| ~ equalish(X0,a) ),
inference(resolution,[status(thm)],[c_74,c_51]) ).
cnf(c_344,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),X0)
| ~ equalish(X0,X1)
| ~ equalish(X1,a) ),
inference(resolution,[status(thm)],[c_327,c_74]) ).
cnf(c_367,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),X0)
| ~ equalish(X0,a)
| equalish(add(a,add(b,additive_inverse(b))),a) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_381,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),add(additive_identity,a))
| ~ equalish(add(additive_identity,a),a)
| equalish(add(a,add(b,additive_inverse(b))),a) ),
inference(instantiation,[status(thm)],[c_367]) ).
cnf(c_382,plain,
( ~ defined(a)
| equalish(add(additive_identity,a),a) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_518,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),X0)
| ~ equalish(X0,add(additive_identity,a))
| equalish(add(a,add(b,additive_inverse(b))),add(additive_identity,a)) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_873,plain,
( ~ defined(additive_inverse(b))
| ~ defined(b)
| defined(add(b,additive_inverse(b))) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_1030,plain,
( ~ defined(add(b,additive_inverse(b)))
| ~ defined(a)
| equalish(add(a,add(b,additive_inverse(b))),add(add(b,additive_inverse(b)),a)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_1134,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),add(X0,a))
| ~ equalish(add(X0,a),add(additive_identity,a))
| equalish(add(a,add(b,additive_inverse(b))),add(additive_identity,a)) ),
inference(instantiation,[status(thm)],[c_518]) ).
cnf(c_1135,plain,
( ~ equalish(X0,additive_identity)
| ~ defined(a)
| equalish(add(X0,a),add(additive_identity,a)) ),
inference(instantiation,[status(thm)],[c_75]) ).
cnf(c_2171,plain,
( ~ defined(b)
| defined(additive_inverse(b)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_3445,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),add(add(b,additive_inverse(b)),a))
| ~ equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a))
| equalish(add(a,add(b,additive_inverse(b))),add(additive_identity,a)) ),
inference(instantiation,[status(thm)],[c_1134]) ).
cnf(c_6344,plain,
( ~ equalish(add(b,additive_inverse(b)),additive_identity)
| ~ defined(a)
| equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a)) ),
inference(instantiation,[status(thm)],[c_1135]) ).
cnf(c_12295,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),X0)
| ~ equalish(X0,add(additive_identity,a))
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_344,c_53]) ).
cnf(c_12297,plain,
( ~ equalish(X0,add(additive_identity,a))
| ~ equalish(add(a,add(b,additive_inverse(b))),X0) ),
inference(global_subsumption_just,[status(thm)],[c_12295,c_49,c_12295]) ).
cnf(c_12298,plain,
( ~ equalish(add(a,add(b,additive_inverse(b))),X0)
| ~ equalish(X0,add(additive_identity,a)) ),
inference(renaming,[status(thm)],[c_12297]) ).
cnf(c_12380,plain,
( ~ equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a))
| ~ defined(add(b,additive_inverse(b)))
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_12298,c_55]) ).
cnf(c_12381,plain,
~ equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a)),
inference(global_subsumption_just,[status(thm)],[c_12380,c_50,c_49,c_51,c_381,c_382,c_873,c_1030,c_2171,c_3445]) ).
cnf(c_12411,plain,
( ~ equalish(add(b,additive_inverse(b)),additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_12381,c_75]) ).
cnf(c_12412,plain,
~ equalish(add(b,additive_inverse(b)),additive_identity),
inference(global_subsumption_just,[status(thm)],[c_12411,c_50,c_49,c_51,c_381,c_382,c_873,c_1030,c_2171,c_3445,c_6344]) ).
cnf(c_12441,plain,
~ defined(b),
inference(resolution,[status(thm)],[c_12412,c_54]) ).
cnf(c_12442,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12441,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD003-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n026.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 : Thu May 2 22:56:06 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 7.34/1.68 % SZS status Started for theBenchmark.p
% 7.34/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 7.34/1.68
% 7.34/1.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.34/1.68
% 7.34/1.68 ------ iProver source info
% 7.34/1.68
% 7.34/1.68 git: date: 2024-05-02 19:28:25 +0000
% 7.34/1.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.34/1.68 git: non_committed_changes: false
% 7.34/1.68
% 7.34/1.68 ------ Parsing...successful
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 7.34/1.68
% 7.34/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.34/1.68 ------ Proving...
% 7.34/1.68 ------ Problem Properties
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68 clauses 30
% 7.34/1.68 conjectures 1
% 7.34/1.68 EPR 12
% 7.34/1.68 Horn 27
% 7.34/1.68 unary 6
% 7.34/1.68 binary 6
% 7.34/1.68 lits 76
% 7.34/1.68 lits eq 0
% 7.34/1.68 fd_pure 0
% 7.34/1.68 fd_pseudo 0
% 7.34/1.68 fd_cond 0
% 7.34/1.68 fd_pseudo_cond 0
% 7.34/1.68 AC symbols 0
% 7.34/1.68
% 7.34/1.68 ------ Input Options Time Limit: Unbounded
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68 ------
% 7.34/1.68 Current options:
% 7.34/1.68 ------
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68 ------ Proving...
% 7.34/1.68
% 7.34/1.68
% 7.34/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 7.34/1.68
% 7.34/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.34/1.68
% 7.34/1.68
%------------------------------------------------------------------------------