TSTP Solution File: FLD067-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : FLD067-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Wed Aug 30 22:33:22 EDT 2023
% Result : Unsatisfiable 0.51s 1.19s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 16 unt; 3 nHn; 44 RR)
% Number of literals : 89 ( 0 equ; 55 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_51,plain,
defined(u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).
cnf(c_52,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_53,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_5) ).
cnf(c_54,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_6) ).
cnf(c_57,plain,
( ~ defined(X0)
| equalish(add(X0,additive_inverse(X0)),additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(c_65,plain,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(c_66,plain,
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_70,plain,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(c_72,plain,
( ~ defined(X0)
| ~ defined(X1)
| less_or_equal(X0,X1)
| less_or_equal(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(c_73,plain,
( ~ less_or_equal(X0,X1)
| ~ defined(X2)
| less_or_equal(add(X0,X2),add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(c_76,plain,
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(c_77,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(c_80,plain,
( ~ less_or_equal(X0,X1)
| ~ equalish(X0,X2)
| less_or_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(c_81,plain,
~ equalish(additive_identity,multiplicative_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',different_identities) ).
cnf(c_331,plain,
( ~ equalish(X0,multiplicative_identity)
| ~ equalish(additive_identity,X0) ),
inference(resolution,[status(thm)],[c_77,c_81]) ).
cnf(c_339,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,multiplicative_identity)
| ~ equalish(additive_identity,X0) ),
inference(resolution,[status(thm)],[c_331,c_77]) ).
cnf(c_354,plain,
( ~ defined(u)
| ~ defined(additive_identity)
| less_or_equal(u,additive_identity)
| less_or_equal(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_360,plain,
( ~ less_or_equal(X0,u)
| ~ equalish(X0,additive_identity)
| less_or_equal(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_365,plain,
( ~ defined(X0)
| ~ defined(u)
| less_or_equal(X0,u)
| less_or_equal(u,X0) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_423,plain,
equalish(u,add(b,additive_inverse(a))),
inference(superposition,[status(thm)],[c_53,c_76]) ).
cnf(c_456,plain,
( ~ defined(u)
| less_or_equal(u,u) ),
inference(instantiation,[status(thm)],[c_365]) ).
cnf(c_457,plain,
( ~ less_or_equal(u,u)
| ~ equalish(u,additive_identity)
| less_or_equal(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_360]) ).
cnf(c_515,plain,
( ~ equalish(add(b,additive_inverse(a)),X0)
| equalish(u,X0) ),
inference(superposition,[status(thm)],[c_423,c_77]) ).
cnf(c_519,plain,
( ~ equalish(add(b,additive_inverse(a)),additive_identity)
| equalish(u,additive_identity) ),
inference(instantiation,[status(thm)],[c_515]) ).
cnf(c_624,plain,
( ~ equalish(additive_identity,u)
| equalish(u,additive_identity) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_1158,plain,
( ~ equalish(X0,u)
| ~ equalish(additive_identity,X0)
| equalish(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_1564,plain,
equalish(u,add(b,additive_inverse(a))),
inference(superposition,[status(thm)],[c_53,c_76]) ).
cnf(c_1929,plain,
( ~ defined(u)
| ~ defined(additive_identity)
| less_or_equal(u,additive_identity) ),
inference(superposition,[status(thm)],[c_72,c_54]) ).
cnf(c_2230,plain,
less_or_equal(u,additive_identity),
inference(global_subsumption_just,[status(thm)],[c_1929,c_65,c_51,c_54,c_354]) ).
cnf(c_2234,plain,
( ~ equalish(u,X0)
| less_or_equal(X0,additive_identity) ),
inference(superposition,[status(thm)],[c_2230,c_80]) ).
cnf(c_2311,plain,
less_or_equal(add(b,additive_inverse(a)),additive_identity),
inference(superposition,[status(thm)],[c_1564,c_2234]) ).
cnf(c_2421,plain,
( ~ less_or_equal(additive_identity,add(b,additive_inverse(a)))
| equalish(add(b,additive_inverse(a)),additive_identity) ),
inference(superposition,[status(thm)],[c_2311,c_70]) ).
cnf(c_2621,plain,
( ~ equalish(add(b,additive_inverse(a)),u)
| ~ equalish(additive_identity,add(b,additive_inverse(a)))
| equalish(additive_identity,u) ),
inference(instantiation,[status(thm)],[c_1158]) ).
cnf(c_4896,plain,
( ~ equalish(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(u,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_339,c_53]) ).
cnf(c_4897,plain,
~ equalish(additive_identity,add(b,additive_inverse(a))),
inference(global_subsumption_just,[status(thm)],[c_4896,c_51,c_54,c_53,c_456,c_457,c_624,c_2621]) ).
cnf(c_4958,plain,
( ~ less_or_equal(add(b,additive_inverse(a)),additive_identity)
| ~ less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(resolution,[status(thm)],[c_4897,c_70]) ).
cnf(c_4959,plain,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(global_subsumption_just,[status(thm)],[c_4958,c_51,c_54,c_456,c_457,c_519,c_2421]) ).
cnf(c_4968,plain,
( ~ less_or_equal(X0,add(b,additive_inverse(a)))
| ~ equalish(X0,additive_identity) ),
inference(resolution,[status(thm)],[c_4959,c_80]) ).
cnf(c_5551,plain,
( ~ less_or_equal(add(X0,additive_inverse(X0)),add(b,additive_inverse(a)))
| ~ defined(X0) ),
inference(resolution,[status(thm)],[c_4968,c_57]) ).
cnf(c_7964,plain,
( ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_5551,c_73]) ).
cnf(c_7965,plain,
~ defined(additive_inverse(a)),
inference(global_subsumption_just,[status(thm)],[c_7964,c_49,c_52,c_7964]) ).
cnf(c_7969,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_7965,c_66]) ).
cnf(c_7970,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7969,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD067-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 23:40:57 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.51/1.19 % SZS status Started for theBenchmark.p
% 0.51/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 0.51/1.19
% 0.51/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.51/1.19
% 0.51/1.19 ------ iProver source info
% 0.51/1.19
% 0.51/1.19 git: date: 2023-05-31 18:12:56 +0000
% 0.51/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.51/1.19 git: non_committed_changes: false
% 0.51/1.19 git: last_make_outside_of_git: false
% 0.51/1.19
% 0.51/1.19 ------ Parsing...successful
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.51/1.19
% 0.51/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.51/1.19 ------ Proving...
% 0.51/1.19 ------ Problem Properties
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19 clauses 33
% 0.51/1.19 conjectures 3
% 0.51/1.19 EPR 15
% 0.51/1.19 Horn 30
% 0.51/1.19 unary 9
% 0.51/1.19 binary 6
% 0.51/1.19 lits 79
% 0.51/1.19 lits eq 0
% 0.51/1.19 fd_pure 0
% 0.51/1.19 fd_pseudo 0
% 0.51/1.19 fd_cond 0
% 0.51/1.19 fd_pseudo_cond 0
% 0.51/1.19 AC symbols 0
% 0.51/1.19
% 0.51/1.19 ------ Input Options Time Limit: Unbounded
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19 ------
% 0.51/1.19 Current options:
% 0.51/1.19 ------
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19 ------ Proving...
% 0.51/1.19
% 0.51/1.19
% 0.51/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 0.51/1.19
% 0.51/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/1.19
% 1.49/1.19
%------------------------------------------------------------------------------