TSTP Solution File: FLD061-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : FLD061-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:19 EDT 2023
% Result : Unsatisfiable 13.45s 2.72s
% Output : CNFRefutation 13.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 28 ( 8 unt; 0 nHn; 28 RR)
% Number of literals : 74 ( 0 equ; 47 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 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,plain,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(c_52,plain,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
cnf(c_53,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(c_54,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_6) ).
cnf(c_55,negated_conjecture,
~ less_or_equal(add(a,c),add(d,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).
cnf(c_60,plain,
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(c_74,plain,
( ~ defined(X0)
| ~ defined(X1)
| sum(X0,X1,add(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_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_260,plain,
( ~ less_or_equal(add(a,c),X0)
| ~ less_or_equal(X0,add(d,b))
| less_or_equal(add(a,c),add(d,b)) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_283,plain,
( ~ sum(X0,X1,add(a,c))
| ~ sum(X2,X1,X3)
| ~ less_or_equal(X0,X2)
| less_or_equal(add(a,c),X3) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_294,plain,
( ~ defined(a)
| ~ defined(c)
| sum(a,c,add(a,c)) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_438,plain,
( ~ sum(a,c,add(a,c))
| ~ sum(X0,c,X1)
| ~ less_or_equal(a,X0)
| less_or_equal(add(a,c),X1) ),
inference(instantiation,[status(thm)],[c_283]) ).
cnf(c_1844,plain,
( ~ sum(X0,X1,add(d,b))
| ~ sum(X2,X1,X3)
| ~ less_or_equal(X2,X0)
| less_or_equal(X3,add(d,b)) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_10529,plain,
( ~ defined(X0)
| ~ defined(c)
| sum(X0,c,add(X0,c)) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_11326,plain,
( ~ defined(b)
| ~ defined(d)
| sum(d,b,add(d,b)) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_11673,plain,
( ~ sum(a,c,add(a,c))
| ~ sum(b,c,X0)
| ~ less_or_equal(a,b)
| less_or_equal(add(a,c),X0) ),
inference(instantiation,[status(thm)],[c_438]) ).
cnf(c_27623,plain,
( ~ sum(d,b,add(d,b))
| ~ sum(X0,b,X1)
| ~ less_or_equal(X0,d)
| less_or_equal(X1,add(d,b)) ),
inference(instantiation,[status(thm)],[c_1844]) ).
cnf(c_30058,plain,
( ~ defined(b)
| ~ defined(c)
| sum(b,c,add(b,c)) ),
inference(instantiation,[status(thm)],[c_10529]) ).
cnf(c_30060,plain,
( ~ sum(a,c,add(a,c))
| ~ sum(b,c,add(b,c))
| ~ less_or_equal(a,b)
| less_or_equal(add(a,c),add(b,c)) ),
inference(instantiation,[status(thm)],[c_11673]) ).
cnf(c_34418,plain,
( ~ less_or_equal(add(a,c),add(b,c))
| ~ less_or_equal(add(b,c),add(d,b))
| less_or_equal(add(a,c),add(d,b)) ),
inference(instantiation,[status(thm)],[c_260]) ).
cnf(c_36975,plain,
( ~ sum(d,b,add(d,b))
| ~ sum(c,b,X0)
| ~ less_or_equal(c,d)
| less_or_equal(X0,add(d,b)) ),
inference(instantiation,[status(thm)],[c_27623]) ).
cnf(c_44717,plain,
( ~ sum(c,b,add(b,c))
| ~ sum(d,b,add(d,b))
| ~ less_or_equal(c,d)
| less_or_equal(add(b,c),add(d,b)) ),
inference(instantiation,[status(thm)],[c_36975]) ).
cnf(c_93253,plain,
( ~ sum(b,c,X0)
| sum(c,b,X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_100644,plain,
( ~ sum(b,c,add(b,c))
| sum(c,b,add(b,c)) ),
inference(instantiation,[status(thm)],[c_93253]) ).
cnf(c_100646,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_100644,c_44717,c_34418,c_30060,c_30058,c_11326,c_294,c_55,c_53,c_54,c_49,c_50,c_51,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD061-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 00:25:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 13.45/2.72 % SZS status Started for theBenchmark.p
% 13.45/2.72 % SZS status Unsatisfiable for theBenchmark.p
% 13.45/2.72
% 13.45/2.72 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 13.45/2.72
% 13.45/2.72 ------ iProver source info
% 13.45/2.72
% 13.45/2.72 git: date: 2023-05-31 18:12:56 +0000
% 13.45/2.72 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 13.45/2.72 git: non_committed_changes: false
% 13.45/2.72 git: last_make_outside_of_git: false
% 13.45/2.72
% 13.45/2.72 ------ Parsing...successful
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 13.45/2.72
% 13.45/2.72 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 13.45/2.72 ------ Proving...
% 13.45/2.72 ------ Problem Properties
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72 clauses 33
% 13.45/2.72 conjectures 3
% 13.45/2.72 EPR 24
% 13.45/2.72 Horn 30
% 13.45/2.72 unary 10
% 13.45/2.72 binary 6
% 13.45/2.72 lits 84
% 13.45/2.72 lits eq 0
% 13.45/2.72 fd_pure 0
% 13.45/2.72 fd_pseudo 0
% 13.45/2.72 fd_cond 0
% 13.45/2.72 fd_pseudo_cond 0
% 13.45/2.72 AC symbols 0
% 13.45/2.72
% 13.45/2.72 ------ Schedule dynamic 5 is on
% 13.45/2.72
% 13.45/2.72 ------ no equalities: superposition off
% 13.45/2.72
% 13.45/2.72 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72 ------
% 13.45/2.72 Current options:
% 13.45/2.72 ------
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72 ------ Proving...
% 13.45/2.72
% 13.45/2.72
% 13.45/2.72 % SZS status Unsatisfiable for theBenchmark.p
% 13.45/2.72
% 13.45/2.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.45/2.72
% 13.45/2.72
%------------------------------------------------------------------------------