TSTP Solution File: FLD070-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : FLD070-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:30 EDT 2024
% Result : Unsatisfiable 3.50s 1.15s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 32 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_52,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_53,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(c_54,negated_conjecture,
sum(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_6) ).
cnf(c_55,negated_conjecture,
~ less_or_equal(additive_identity,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).
cnf(c_58,plain,
( ~ defined(X0)
| sum(additive_identity,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(c_77,plain,
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(c_79,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X1,X4)
| ~ less_or_equal(X0,X3)
| less_or_equal(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(c_310,plain,
( ~ less_or_equal(X0,c)
| ~ less_or_equal(additive_identity,X0) ),
inference(resolution,[status(thm)],[c_77,c_55]) ).
cnf(c_315,plain,
~ less_or_equal(b,c),
inference(resolution,[status(thm)],[c_310,c_53]) ).
cnf(c_460,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X1,c)
| ~ less_or_equal(X0,X3)
| less_or_equal(X2,c) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_1182,plain,
( ~ sum(X0,b,X1)
| ~ sum(a,b,c)
| ~ less_or_equal(X0,a)
| less_or_equal(X1,c) ),
inference(instantiation,[status(thm)],[c_460]) ).
cnf(c_3870,plain,
( ~ sum(a,b,c)
| ~ sum(additive_identity,b,b)
| ~ less_or_equal(additive_identity,a)
| less_or_equal(b,c) ),
inference(instantiation,[status(thm)],[c_1182]) ).
cnf(c_3871,plain,
( ~ defined(b)
| sum(additive_identity,b,b) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_3872,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3871,c_3870,c_315,c_54,c_52,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : FLD070-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 22:28:56 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.50/1.15 % SZS status Started for theBenchmark.p
% 3.50/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.15
% 3.50/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.50/1.15
% 3.50/1.15 ------ iProver source info
% 3.50/1.15
% 3.50/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.50/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.50/1.15 git: non_committed_changes: false
% 3.50/1.15
% 3.50/1.15 ------ Parsing...successful
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.50/1.15
% 3.50/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.50/1.15 ------ Proving...
% 3.50/1.15 ------ Problem Properties
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15 clauses 33
% 3.50/1.15 conjectures 4
% 3.50/1.15 EPR 25
% 3.50/1.15 Horn 30
% 3.50/1.15 unary 10
% 3.50/1.15 binary 6
% 3.50/1.15 lits 84
% 3.50/1.15 lits eq 0
% 3.50/1.15 fd_pure 0
% 3.50/1.15 fd_pseudo 0
% 3.50/1.15 fd_cond 0
% 3.50/1.15 fd_pseudo_cond 0
% 3.50/1.15 AC symbols 0
% 3.50/1.15
% 3.50/1.15 ------ Input Options Time Limit: Unbounded
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15 ------
% 3.50/1.15 Current options:
% 3.50/1.15 ------
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15 ------ Proving...
% 3.50/1.15
% 3.50/1.15
% 3.50/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.15
% 3.50/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.15
% 3.50/1.15
%------------------------------------------------------------------------------