TSTP Solution File: ANA002-4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ANA002-4 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 17:17:55 EDT 2023
% Result : Unsatisfiable 7.86s 1.68s
% Output : CNFRefutation 7.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 47 ( 6 unt; 22 nHn; 39 RR)
% Number of literals : 137 ( 0 equ; 69 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
( less_than_or_equal(X0,X1)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_less) ).
cnf(c_51,plain,
( ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,X2)
| less_than_or_equal(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(c_52,plain,
( ~ less_than_or_equal(X0,q(X1,X0))
| less_than_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interpolation1) ).
cnf(c_53,plain,
( ~ less_than_or_equal(q(X0,X1),X0)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interpolation2) ).
cnf(c_54,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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity1) ).
cnf(c_55,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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity2) ).
cnf(c_56,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)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity3) ).
cnf(c_57,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)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity4) ).
cnf(c_58,plain,
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,upper_bound)
| less_than_or_equal(X0,l) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover1) ).
cnf(c_59,plain,
( less_than_or_equal(g(X0),upper_bound)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover2_and_g_function1) ).
cnf(c_60,plain,
( less_than_or_equal(f(g(X0)),n0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
cnf(c_61,plain,
( ~ less_than_or_equal(g(X0),X0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover4_and_g_function3) ).
cnf(c_62,plain,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_interval) ).
cnf(c_63,plain,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_mapping) ).
cnf(c_64,plain,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_mapping) ).
cnf(c_65,negated_conjecture,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
cnf(c_166,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_58]) ).
cnf(c_183,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_54]) ).
cnf(c_275,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_56]) ).
cnf(c_288,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_55]) ).
cnf(c_297,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_57]) ).
cnf(c_322,plain,
( ~ less_than_or_equal(k(l),q(l,k(l)))
| less_than_or_equal(k(l),l) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_324,plain,
( ~ less_than_or_equal(q(l,k(l)),l)
| less_than_or_equal(k(l),l) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_386,plain,
( ~ less_than_or_equal(X0,X1)
| less_than_or_equal(X0,X2)
| less_than_or_equal(X2,X1) ),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_468,plain,
( ~ less_than_or_equal(g(h(l)),h(l))
| less_than_or_equal(l,h(l)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_469,plain,
( less_than_or_equal(f(g(h(l))),n0)
| less_than_or_equal(l,h(l)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_470,plain,
( less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(l,h(l)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_519,plain,
( less_than_or_equal(X0,l)
| less_than_or_equal(l,X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_540,plain,
less_than_or_equal(l,upper_bound),
inference(superposition,[status(thm)],[c_59,c_61]) ).
cnf(c_726,plain,
( ~ less_than_or_equal(upper_bound,X0)
| less_than_or_equal(l,X0) ),
inference(superposition,[status(thm)],[c_540,c_51]) ).
cnf(c_908,plain,
( less_than_or_equal(X0,upper_bound)
| less_than_or_equal(l,X0) ),
inference(superposition,[status(thm)],[c_50,c_726]) ).
cnf(c_1196,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_58]) ).
cnf(c_1411,plain,
( less_than_or_equal(X0,X1)
| less_than_or_equal(X1,upper_bound)
| less_than_or_equal(l,X0) ),
inference(superposition,[status(thm)],[c_908,c_386]) ).
cnf(c_1708,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_58]) ).
cnf(c_3834,plain,
( less_than_or_equal(q(l,k(l)),l)
| less_than_or_equal(l,q(l,k(l))) ),
inference(instantiation,[status(thm)],[c_519]) ).
cnf(c_5056,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_288]) ).
cnf(c_5417,plain,
( ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(l,f(l))
| less_than_or_equal(n0,upper_bound) ),
inference(superposition,[status(thm)],[c_1411,c_65]) ).
cnf(c_6386,plain,
~ less_than_or_equal(n0,f(l)),
inference(global_subsumption_just,[status(thm)],[c_5417,c_62,c_63,c_65,c_166,c_183,c_470,c_469,c_468,c_540,c_1196,c_5056]) ).
cnf(c_8512,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_297]) ).
cnf(c_36526,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_57]) ).
cnf(c_36639,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_51]) ).
cnf(c_36640,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_36526]) ).
cnf(c_37071,plain,
( less_than_or_equal(X0,upper_bound)
| less_than_or_equal(upper_bound,X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_37279,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_50]) ).
cnf(c_37934,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_36639]) ).
cnf(c_37935,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_37071]) ).
cnf(c_37936,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_37935,c_37934,c_37279,c_36640,c_8512,c_6386,c_3834,c_1708,c_540,c_324,c_322,c_275,c_166,c_63,c_64,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA002-4 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n016.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 : Fri Aug 25 19:20:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.86/1.68 % SZS status Started for theBenchmark.p
% 7.86/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 7.86/1.68
% 7.86/1.68 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.86/1.68
% 7.86/1.68 ------ iProver source info
% 7.86/1.68
% 7.86/1.68 git: date: 2023-05-31 18:12:56 +0000
% 7.86/1.68 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.86/1.68 git: non_committed_changes: false
% 7.86/1.68 git: last_make_outside_of_git: false
% 7.86/1.68
% 7.86/1.68 ------ Parsing...successful
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 7.86/1.68
% 7.86/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.86/1.68 ------ Proving...
% 7.86/1.68 ------ Problem Properties
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68 clauses 17
% 7.86/1.68 conjectures 1
% 7.86/1.68 EPR 4
% 7.86/1.68 Horn 12
% 7.86/1.68 unary 4
% 7.86/1.68 binary 7
% 7.86/1.68 lits 44
% 7.86/1.68 lits eq 0
% 7.86/1.68 fd_pure 0
% 7.86/1.68 fd_pseudo 0
% 7.86/1.68 fd_cond 0
% 7.86/1.68 fd_pseudo_cond 0
% 7.86/1.68 AC symbols 0
% 7.86/1.68
% 7.86/1.68 ------ Schedule dynamic 5 is on
% 7.86/1.68
% 7.86/1.68 ------ no equalities: superposition off
% 7.86/1.68
% 7.86/1.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68 ------
% 7.86/1.68 Current options:
% 7.86/1.68 ------
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68 ------ Proving...
% 7.86/1.68
% 7.86/1.68
% 7.86/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 7.86/1.68
% 7.86/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.86/1.68
% 7.86/1.68
%------------------------------------------------------------------------------