TSTP Solution File: ANA002-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ANA002-2 : TPTP v8.1.2. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:05:27 EDT 2024
% Result : Unsatisfiable 12.23s 2.68s
% Output : CNFRefutation 12.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of clauses : 50 ( 7 unt; 22 nHn; 42 RR)
% Number of literals : 147 ( 0 equ; 77 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,X2)
| in_interval(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_interval) ).
cnf(c_51,plain,
( less_than_or_equal(X0,X1)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less) ).
cnf(c_52,plain,
( ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,X2)
| less_than_or_equal(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(c_53,plain,
( ~ less_than_or_equal(X0,q(X1,X0))
| less_than_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation1) ).
cnf(c_54,plain,
( ~ less_than_or_equal(q(X0,X1),X0)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation2) ).
cnf(c_55,plain,
( ~ less_than_or_equal(X0,h(X0))
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(f(X0),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity1) ).
cnf(c_56,plain,
( ~ in_interval(lower_bound,X0,upper_bound)
| ~ less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,X0)
| less_than_or_equal(X1,h(X0))
| less_than_or_equal(f(X0),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2) ).
cnf(c_57,plain,
( ~ less_than_or_equal(k(X0),X0)
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(n0,f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity3) ).
cnf(c_58,plain,
( ~ in_interval(lower_bound,X0,upper_bound)
| ~ less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(X0,X1)
| less_than_or_equal(k(X0),X1)
| less_than_or_equal(n0,f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity4) ).
cnf(c_59,plain,
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,upper_bound)
| less_than_or_equal(X0,l) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover1) ).
cnf(c_60,plain,
( less_than_or_equal(g(X0),upper_bound)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover2_and_g_function1) ).
cnf(c_61,plain,
( less_than_or_equal(f(g(X0)),n0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
cnf(c_62,plain,
( ~ less_than_or_equal(g(X0),X0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover4_and_g_function3) ).
cnf(c_63,plain,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_interval) ).
cnf(c_64,plain,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_mapping) ).
cnf(c_65,plain,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upper_mapping) ).
cnf(c_66,negated_conjecture,
~ in_interval(f(l),n0,f(l)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
cnf(c_159,plain,
( ~ less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(X1,X0)
| ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| less_than_or_equal(k(X1),X0)
| less_than_or_equal(n0,f(X1)) ),
inference(resolution,[status(thm)],[c_49,c_58]) ).
cnf(c_178,plain,
( ~ less_than_or_equal(k(X0),X0)
| ~ less_than_or_equal(X0,upper_bound)
| ~ less_than_or_equal(lower_bound,X0)
| less_than_or_equal(n0,f(X0)) ),
inference(resolution,[status(thm)],[c_49,c_57]) ).
cnf(c_192,plain,
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| less_than_or_equal(X0,h(X1))
| less_than_or_equal(f(X1),n0) ),
inference(resolution,[status(thm)],[c_49,c_56]) ).
cnf(c_211,plain,
( ~ less_than_or_equal(X0,h(X0))
| ~ less_than_or_equal(X0,upper_bound)
| ~ less_than_or_equal(lower_bound,X0)
| less_than_or_equal(f(X0),n0) ),
inference(resolution,[status(thm)],[c_49,c_55]) ).
cnf(c_225,plain,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
inference(resolution,[status(thm)],[c_49,c_66]) ).
cnf(c_347,plain,
( ~ less_than_or_equal(f(lower_bound),n0)
| ~ less_than_or_equal(lower_bound,upper_bound)
| less_than_or_equal(lower_bound,l) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_350,plain,
( less_than_or_equal(X0,upper_bound)
| less_than_or_equal(upper_bound,X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_363,plain,
( ~ less_than_or_equal(k(l),l)
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(n0,f(l)) ),
inference(instantiation,[status(thm)],[c_178]) ).
cnf(c_469,plain,
( ~ less_than_or_equal(l,h(l))
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(f(l),n0) ),
inference(instantiation,[status(thm)],[c_211]) ).
cnf(c_477,plain,
( ~ less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(l,X0)
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(k(l),X0)
| less_than_or_equal(n0,f(l)) ),
inference(instantiation,[status(thm)],[c_159]) ).
cnf(c_486,plain,
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,l)
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(X0,h(l))
| less_than_or_equal(f(l),n0) ),
inference(instantiation,[status(thm)],[c_192]) ).
cnf(c_497,plain,
( ~ less_than_or_equal(k(l),q(l,k(l)))
| less_than_or_equal(k(l),l) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_499,plain,
( ~ less_than_or_equal(q(l,k(l)),l)
| less_than_or_equal(k(l),l) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_614,plain,
( ~ less_than_or_equal(g(h(l)),h(l))
| less_than_or_equal(l,h(l)) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_615,plain,
( less_than_or_equal(f(g(h(l))),n0)
| less_than_or_equal(l,h(l)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_616,plain,
( less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(l,h(l)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_642,plain,
less_than_or_equal(l,upper_bound),
inference(superposition,[status(thm)],[c_60,c_62]) ).
cnf(c_735,plain,
( ~ less_than_or_equal(X0,X1)
| less_than_or_equal(X0,X2)
| less_than_or_equal(X2,X1) ),
inference(superposition,[status(thm)],[c_51,c_52]) ).
cnf(c_818,plain,
( less_than_or_equal(X0,l)
| less_than_or_equal(l,X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1109,plain,
( ~ less_than_or_equal(f(g(h(l))),n0)
| ~ less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(g(h(l)),l) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_2043,plain,
( less_than_or_equal(X0,X1)
| less_than_or_equal(X1,X2)
| less_than_or_equal(X2,X0) ),
inference(superposition,[status(thm)],[c_51,c_735]) ).
cnf(c_2584,plain,
( ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(X0,f(l))
| less_than_or_equal(n0,X0) ),
inference(superposition,[status(thm)],[c_2043,c_225]) ).
cnf(c_2727,plain,
( ~ less_than_or_equal(f(g(h(l))),n0)
| ~ less_than_or_equal(g(h(l)),l)
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(g(h(l)),h(l))
| less_than_or_equal(f(l),n0) ),
inference(instantiation,[status(thm)],[c_486]) ).
cnf(c_2744,plain,
~ less_than_or_equal(n0,f(l)),
inference(global_subsumption_just,[status(thm)],[c_2584,c_63,c_64,c_225,c_347,c_469,c_616,c_615,c_614,c_642,c_1109,c_2727]) ).
cnf(c_3857,plain,
( less_than_or_equal(q(l,k(l)),l)
| less_than_or_equal(l,q(l,k(l))) ),
inference(instantiation,[status(thm)],[c_818]) ).
cnf(c_4723,plain,
( ~ less_than_or_equal(n0,f(upper_bound))
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(n0,f(l)) ),
inference(instantiation,[status(thm)],[c_477]) ).
cnf(c_12399,plain,
( ~ less_than_or_equal(n0,f(q(l,k(l))))
| ~ less_than_or_equal(l,q(l,k(l)))
| ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| less_than_or_equal(k(l),q(l,k(l)))
| less_than_or_equal(n0,f(l)) ),
inference(instantiation,[status(thm)],[c_477]) ).
cnf(c_20909,plain,
( less_than_or_equal(f(q(l,k(l))),n0)
| less_than_or_equal(n0,f(q(l,k(l)))) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_32443,plain,
( ~ less_than_or_equal(f(q(l,k(l))),n0)
| ~ less_than_or_equal(q(l,k(l)),upper_bound)
| less_than_or_equal(q(l,k(l)),l) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_32513,plain,
( less_than_or_equal(q(l,k(l)),upper_bound)
| less_than_or_equal(upper_bound,q(l,k(l))) ),
inference(instantiation,[status(thm)],[c_350]) ).
cnf(c_43027,plain,
( ~ less_than_or_equal(X0,q(l,k(l)))
| ~ less_than_or_equal(k(l),X0)
| less_than_or_equal(k(l),q(l,k(l))) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_44108,plain,
( ~ less_than_or_equal(upper_bound,q(l,k(l)))
| ~ less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(k(l),q(l,k(l))) ),
inference(instantiation,[status(thm)],[c_43027]) ).
cnf(c_44109,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_44108,c_32513,c_32443,c_20909,c_12399,c_4723,c_3857,c_2744,c_642,c_499,c_497,c_363,c_347,c_64,c_65,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA002-2 : TPTP v8.1.2. Bugfixed v1.0.1.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n006.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 : Thu May 2 19:45:34 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 12.23/2.68 % SZS status Started for theBenchmark.p
% 12.23/2.68 % SZS status Unsatisfiable for theBenchmark.p
% 12.23/2.68
% 12.23/2.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 12.23/2.68
% 12.23/2.68 ------ iProver source info
% 12.23/2.68
% 12.23/2.68 git: date: 2024-05-02 19:28:25 +0000
% 12.23/2.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 12.23/2.68 git: non_committed_changes: false
% 12.23/2.68
% 12.23/2.68 ------ Parsing...successful
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 12.23/2.68
% 12.23/2.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 12.23/2.68 ------ Proving...
% 12.23/2.68 ------ Problem Properties
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68 clauses 17
% 12.23/2.68 conjectures 0
% 12.23/2.68 EPR 4
% 12.23/2.68 Horn 12
% 12.23/2.68 unary 4
% 12.23/2.68 binary 7
% 12.23/2.68 lits 44
% 12.23/2.68 lits eq 0
% 12.23/2.68 fd_pure 0
% 12.23/2.68 fd_pseudo 0
% 12.23/2.68 fd_cond 0
% 12.23/2.68 fd_pseudo_cond 0
% 12.23/2.68 AC symbols 0
% 12.23/2.68
% 12.23/2.68 ------ Schedule dynamic 5 is on
% 12.23/2.68
% 12.23/2.68 ------ no conjectures: strip conj schedule
% 12.23/2.68
% 12.23/2.68 ------ no equalities: superposition off
% 12.23/2.68
% 12.23/2.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68 ------
% 12.23/2.68 Current options:
% 12.23/2.68 ------
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68 ------ Proving...
% 12.23/2.68
% 12.23/2.68
% 12.23/2.68 % SZS status Unsatisfiable for theBenchmark.p
% 12.23/2.68
% 12.23/2.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 12.23/2.68
% 12.23/2.69
%------------------------------------------------------------------------------