TSTP Solution File: FLD067-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : FLD067-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 2.30s 1.14s
% Output : CNFRefutation 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 4 unt; 0 nHn; 14 RR)
% Number of literals : 30 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_51,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(c_52,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(c_55,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_64,plain,
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_71,plain,
( ~ less_or_equal(X0,X1)
| ~ defined(X2)
| less_or_equal(add(X0,X2),add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(c_78,plain,
( ~ less_or_equal(X0,X1)
| ~ equalish(X0,X2)
| less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(c_255,plain,
( ~ less_or_equal(X0,add(b,additive_inverse(a)))
| ~ equalish(X0,additive_identity)
| less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_261,plain,
( ~ less_or_equal(X0,b)
| ~ defined(additive_inverse(a))
| less_or_equal(add(X0,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_290,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_341,plain,
( ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b)
| less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_261]) ).
cnf(c_559,plain,
( ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_255]) ).
cnf(c_1703,plain,
( ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_1704,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1703,c_559,c_341,c_290,c_52,c_51,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD067-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.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 : Mon Aug 28 01:04:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.45 Running first-order theorem proving
% 0.20/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.30/1.14 % SZS status Started for theBenchmark.p
% 2.30/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.30/1.14
% 2.30/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.30/1.14
% 2.30/1.14 ------ iProver source info
% 2.30/1.14
% 2.30/1.14 git: date: 2023-05-31 18:12:56 +0000
% 2.30/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.30/1.14 git: non_committed_changes: false
% 2.30/1.14 git: last_make_outside_of_git: false
% 2.30/1.14
% 2.30/1.14 ------ Parsing...successful
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.30/1.14
% 2.30/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.30/1.14 ------ Proving...
% 2.30/1.14 ------ Problem Properties
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14 clauses 31
% 2.30/1.14 conjectures 2
% 2.30/1.14 EPR 13
% 2.30/1.14 Horn 28
% 2.30/1.14 unary 7
% 2.30/1.14 binary 6
% 2.30/1.14 lits 77
% 2.30/1.14 lits eq 0
% 2.30/1.14 fd_pure 0
% 2.30/1.14 fd_pseudo 0
% 2.30/1.14 fd_cond 0
% 2.30/1.14 fd_pseudo_cond 0
% 2.30/1.14 AC symbols 0
% 2.30/1.14
% 2.30/1.14 ------ Schedule dynamic 5 is on
% 2.30/1.14
% 2.30/1.14 ------ no equalities: superposition off
% 2.30/1.14
% 2.30/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14 ------
% 2.30/1.14 Current options:
% 2.30/1.14 ------
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14 ------ Proving...
% 2.30/1.14
% 2.30/1.14
% 2.30/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.30/1.14
% 2.30/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.30/1.14
% 2.30/1.14
%------------------------------------------------------------------------------