TSTP Solution File: FLD068-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : FLD068-3 : 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 : Fri May 3 02:15:28 EDT 2024
% Result : Unsatisfiable 7.53s 1.62s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 5 unt; 0 nHn; 29 RR)
% Number of literals : 78 ( 0 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_50,plain,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_51,negated_conjecture,
less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(c_52,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(c_54,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X0,X3,X4)
| ~ sum(X3,X5,X1)
| sum(X4,X5,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).
cnf(c_55,plain,
( ~ defined(X0)
| sum(additive_identity,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(c_56,plain,
( ~ defined(X0)
| sum(additive_inverse(X0),X0,additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(c_57,plain,
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(c_67,plain,
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_71,plain,
( ~ defined(X0)
| ~ defined(X1)
| sum(X0,X1,add(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(c_76,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X1,X4)
| ~ less_or_equal(X0,X3)
| less_or_equal(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(c_254,plain,
( ~ sum(X0,X1,a)
| ~ sum(X2,X1,b)
| ~ less_or_equal(X0,X2)
| less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_261,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X1,X3,X4)
| ~ sum(X0,X4,b)
| sum(X2,X3,b) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_265,plain,
( ~ sum(X0,X1,b)
| sum(X1,X0,b) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_271,plain,
( ~ defined(b)
| sum(additive_identity,b,b) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_285,plain,
( ~ sum(additive_identity,b,b)
| sum(b,additive_identity,b) ),
inference(instantiation,[status(thm)],[c_265]) ).
cnf(c_337,plain,
( ~ sum(X0,X1,additive_identity)
| ~ sum(b,X0,X2)
| ~ sum(b,additive_identity,b)
| sum(X2,X1,b) ),
inference(instantiation,[status(thm)],[c_261]) ).
cnf(c_393,plain,
( ~ defined(a)
| sum(additive_identity,a,a) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_685,plain,
( ~ sum(b,X0,X1)
| ~ sum(X0,a,additive_identity)
| ~ sum(b,additive_identity,b)
| sum(X1,a,b) ),
inference(instantiation,[status(thm)],[c_337]) ).
cnf(c_731,plain,
( ~ sum(X0,a,b)
| ~ sum(additive_identity,a,a)
| ~ less_or_equal(additive_identity,X0)
| less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_254]) ).
cnf(c_886,plain,
( ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_942,plain,
( ~ defined(X0)
| ~ defined(b)
| sum(b,X0,add(b,X0)) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_1777,plain,
( ~ sum(add(b,X0),a,b)
| ~ less_or_equal(additive_identity,add(b,X0))
| ~ sum(additive_identity,a,a)
| less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_731]) ).
cnf(c_2682,plain,
( ~ sum(b,additive_inverse(a),X0)
| ~ sum(additive_inverse(a),a,additive_identity)
| ~ sum(b,additive_identity,b)
| sum(X0,a,b) ),
inference(instantiation,[status(thm)],[c_685]) ).
cnf(c_3217,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_3775,plain,
( ~ sum(add(b,additive_inverse(a)),a,b)
| ~ less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ sum(additive_identity,a,a)
| less_or_equal(a,b) ),
inference(instantiation,[status(thm)],[c_1777]) ).
cnf(c_4094,plain,
( ~ sum(b,additive_inverse(a),add(b,additive_inverse(a)))
| ~ sum(additive_inverse(a),a,additive_identity)
| ~ sum(b,additive_identity,b)
| sum(add(b,additive_inverse(a)),a,b) ),
inference(instantiation,[status(thm)],[c_2682]) ).
cnf(c_8602,plain,
( ~ defined(additive_inverse(a))
| ~ defined(b)
| sum(b,additive_inverse(a),add(b,additive_inverse(a))) ),
inference(instantiation,[status(thm)],[c_942]) ).
cnf(c_8603,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8602,c_4094,c_3775,c_3217,c_886,c_393,c_285,c_271,c_51,c_52,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : FLD068-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:01:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 7.53/1.62 % SZS status Started for theBenchmark.p
% 7.53/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 7.53/1.62
% 7.53/1.62 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.53/1.62
% 7.53/1.62 ------ iProver source info
% 7.53/1.62
% 7.53/1.62 git: date: 2024-05-02 19:28:25 +0000
% 7.53/1.62 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.53/1.62 git: non_committed_changes: false
% 7.53/1.62
% 7.53/1.62 ------ Parsing...successful
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 7.53/1.62
% 7.53/1.62 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.53/1.62 ------ Proving...
% 7.53/1.62 ------ Problem Properties
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62 clauses 30
% 7.53/1.62 conjectures 2
% 7.53/1.62 EPR 21
% 7.53/1.62 Horn 27
% 7.53/1.62 unary 7
% 7.53/1.62 binary 6
% 7.53/1.62 lits 81
% 7.53/1.62 lits eq 0
% 7.53/1.62 fd_pure 0
% 7.53/1.62 fd_pseudo 0
% 7.53/1.62 fd_cond 0
% 7.53/1.62 fd_pseudo_cond 0
% 7.53/1.62 AC symbols 0
% 7.53/1.62
% 7.53/1.62 ------ Input Options Time Limit: Unbounded
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62 ------
% 7.53/1.62 Current options:
% 7.53/1.62 ------
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62 ------ Proving...
% 7.53/1.62
% 7.53/1.62
% 7.53/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 7.53/1.62
% 7.53/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.53/1.62
% 7.53/1.62
%------------------------------------------------------------------------------