TSTP Solution File: ANA002-4 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : ANA002-4 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 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 : Wed May 31 12:01:22 EDT 2023
% Result : Unsatisfiable 5.65s 1.09s
% Output : CNFRefutation 5.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : ANA002-4 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31 % Computer : n009.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue May 30 09:58:46 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.09/0.32 % Drodi V3.5.1
% 5.65/1.09 % Refutation found
% 5.65/1.09 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 5.65/1.09 % SZS output start CNFRefutation for theBenchmark
% 5.65/1.09 fof(f1,axiom,(
% 5.65/1.09 (![X]: (less_than_or_equal(X,X) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f2,axiom,(
% 5.65/1.09 (![X,Y]: (( less_than_or_equal(X,Y)| less_than_or_equal(Y,X) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f3,axiom,(
% 5.65/1.09 (![X,Z,Y]: (( less_than_or_equal(X,Z)| ~ less_than_or_equal(X,Y)| ~ less_than_or_equal(Y,Z) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f4,axiom,(
% 5.65/1.09 (![X,Y]: (( ~ less_than_or_equal(X,q(Y,X))| less_than_or_equal(X,Y) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f5,axiom,(
% 5.65/1.09 (![X,Y]: (( ~ less_than_or_equal(q(X,Y),X)| less_than_or_equal(Y,X) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f6,axiom,(
% 5.65/1.09 (![X]: (( less_than_or_equal(f(X),n0)| ~ less_than_or_equal(X,h(X))| ~ less_than_or_equal(lower_bound,X)| ~ less_than_or_equal(X,upper_bound) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f7,axiom,(
% 5.65/1.09 (![X,Y]: (( less_than_or_equal(f(X),n0)| ~ less_than_or_equal(Y,X)| ~ less_than_or_equal(f(Y),n0)| less_than_or_equal(Y,h(X))| ~ less_than_or_equal(lower_bound,X)| ~ less_than_or_equal(X,upper_bound) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f8,axiom,(
% 5.65/1.09 (![X]: (( less_than_or_equal(n0,f(X))| ~ less_than_or_equal(k(X),X)| ~ less_than_or_equal(lower_bound,X)| ~ less_than_or_equal(X,upper_bound) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f9,axiom,(
% 5.65/1.09 (![X,Y]: (( less_than_or_equal(n0,f(X))| ~ less_than_or_equal(X,Y)| ~ less_than_or_equal(n0,f(Y))| less_than_or_equal(k(X),Y)| ~ less_than_or_equal(lower_bound,X)| ~ less_than_or_equal(X,upper_bound) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f10,axiom,(
% 5.65/1.09 (![X]: (( less_than_or_equal(X,l)| ~ less_than_or_equal(X,upper_bound)| ~ less_than_or_equal(f(X),n0) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f11,axiom,(
% 5.65/1.09 (![X]: (( less_than_or_equal(g(X),upper_bound)| less_than_or_equal(l,X) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f12,axiom,(
% 5.65/1.09 (![X]: (( less_than_or_equal(f(g(X)),n0)| less_than_or_equal(l,X) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f13,axiom,(
% 5.65/1.09 (![X]: (( ~ less_than_or_equal(g(X),X)| less_than_or_equal(l,X) ) ))),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f14,hypothesis,(
% 5.65/1.09 less_than_or_equal(lower_bound,upper_bound) ),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f15,hypothesis,(
% 5.65/1.09 less_than_or_equal(f(lower_bound),n0) ),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f16,hypothesis,(
% 5.65/1.09 less_than_or_equal(n0,f(upper_bound)) ),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f17,negated_conjecture,(
% 5.65/1.09 ( ~ less_than_or_equal(f(l),n0)| ~ less_than_or_equal(n0,f(l)) ) ),
% 5.65/1.09 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.65/1.09 fof(f18,plain,(
% 5.65/1.09 ![X0]: (less_than_or_equal(X0,X0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f1])).
% 5.65/1.09 fof(f19,plain,(
% 5.65/1.09 ![X0,X1]: (less_than_or_equal(X0,X1)|less_than_or_equal(X1,X0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f2])).
% 5.65/1.09 fof(f20,plain,(
% 5.65/1.09 ![Z,Y]: ((![X]: (less_than_or_equal(X,Z)|~less_than_or_equal(X,Y)))|~less_than_or_equal(Y,Z))),
% 5.65/1.09 inference(miniscoping,[status(esa)],[f3])).
% 5.65/1.09 fof(f21,plain,(
% 5.65/1.09 ![X0,X1,X2]: (less_than_or_equal(X0,X1)|~less_than_or_equal(X0,X2)|~less_than_or_equal(X2,X1))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f20])).
% 5.65/1.09 fof(f22,plain,(
% 5.65/1.09 ![X0,X1]: (~less_than_or_equal(X0,q(X1,X0))|less_than_or_equal(X0,X1))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f4])).
% 5.65/1.09 fof(f23,plain,(
% 5.65/1.09 ![X0,X1]: (~less_than_or_equal(q(X0,X1),X0)|less_than_or_equal(X1,X0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f5])).
% 5.65/1.09 fof(f24,plain,(
% 5.65/1.09 ![X0]: (less_than_or_equal(f(X0),n0)|~less_than_or_equal(X0,h(X0))|~less_than_or_equal(lower_bound,X0)|~less_than_or_equal(X0,upper_bound))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f6])).
% 5.65/1.09 fof(f25,plain,(
% 5.65/1.09 ![X]: (((![Y]: (((less_than_or_equal(f(X),n0)|~less_than_or_equal(Y,X))|~less_than_or_equal(f(Y),n0))|less_than_or_equal(Y,h(X))))|~less_than_or_equal(lower_bound,X))|~less_than_or_equal(X,upper_bound))),
% 5.65/1.09 inference(miniscoping,[status(esa)],[f7])).
% 5.65/1.09 fof(f26,plain,(
% 5.65/1.09 ![X0,X1]: (less_than_or_equal(f(X0),n0)|~less_than_or_equal(X1,X0)|~less_than_or_equal(f(X1),n0)|less_than_or_equal(X1,h(X0))|~less_than_or_equal(lower_bound,X0)|~less_than_or_equal(X0,upper_bound))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f25])).
% 5.65/1.09 fof(f27,plain,(
% 5.65/1.09 ![X0]: (less_than_or_equal(n0,f(X0))|~less_than_or_equal(k(X0),X0)|~less_than_or_equal(lower_bound,X0)|~less_than_or_equal(X0,upper_bound))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f8])).
% 5.65/1.09 fof(f28,plain,(
% 5.65/1.09 ![X]: (((![Y]: (((less_than_or_equal(n0,f(X))|~less_than_or_equal(X,Y))|~less_than_or_equal(n0,f(Y)))|less_than_or_equal(k(X),Y)))|~less_than_or_equal(lower_bound,X))|~less_than_or_equal(X,upper_bound))),
% 5.65/1.09 inference(miniscoping,[status(esa)],[f9])).
% 5.65/1.09 fof(f29,plain,(
% 5.65/1.09 ![X0,X1]: (less_than_or_equal(n0,f(X0))|~less_than_or_equal(X0,X1)|~less_than_or_equal(n0,f(X1))|less_than_or_equal(k(X0),X1)|~less_than_or_equal(lower_bound,X0)|~less_than_or_equal(X0,upper_bound))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f28])).
% 5.65/1.09 fof(f30,plain,(
% 5.65/1.09 ![X0]: (less_than_or_equal(X0,l)|~less_than_or_equal(X0,upper_bound)|~less_than_or_equal(f(X0),n0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f10])).
% 5.65/1.09 fof(f31,plain,(
% 5.65/1.09 ![X0]: (less_than_or_equal(g(X0),upper_bound)|less_than_or_equal(l,X0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f11])).
% 5.65/1.09 fof(f32,plain,(
% 5.65/1.09 ![X0]: (less_than_or_equal(f(g(X0)),n0)|less_than_or_equal(l,X0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f12])).
% 5.65/1.09 fof(f33,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(g(X0),X0)|less_than_or_equal(l,X0))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f13])).
% 5.65/1.09 fof(f34,plain,(
% 5.65/1.09 less_than_or_equal(lower_bound,upper_bound)),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f14])).
% 5.65/1.09 fof(f35,plain,(
% 5.65/1.09 less_than_or_equal(f(lower_bound),n0)),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f15])).
% 5.65/1.09 fof(f36,plain,(
% 5.65/1.09 less_than_or_equal(n0,f(upper_bound))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f16])).
% 5.65/1.09 fof(f37,plain,(
% 5.65/1.09 ~less_than_or_equal(f(l),n0)|~less_than_or_equal(n0,f(l))),
% 5.65/1.09 inference(cnf_transformation,[status(esa)],[f17])).
% 5.65/1.09 fof(f38,plain,(
% 5.65/1.09 spl0_0 <=> less_than_or_equal(f(l),n0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f40,plain,(
% 5.65/1.09 ~less_than_or_equal(f(l),n0)|spl0_0),
% 5.65/1.09 inference(component_clause,[status(thm)],[f38])).
% 5.65/1.09 fof(f41,plain,(
% 5.65/1.09 spl0_1 <=> less_than_or_equal(n0,f(l))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f43,plain,(
% 5.65/1.09 ~less_than_or_equal(n0,f(l))|spl0_1),
% 5.65/1.09 inference(component_clause,[status(thm)],[f41])).
% 5.65/1.09 fof(f44,plain,(
% 5.65/1.09 ~spl0_0|~spl0_1),
% 5.65/1.09 inference(split_clause,[status(thm)],[f37,f38,f41])).
% 5.65/1.09 fof(f45,plain,(
% 5.65/1.09 spl0_2 <=> ~less_than_or_equal(X0,l)|~less_than_or_equal(f(X0),n0)|less_than_or_equal(X0,h(l))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f46,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(X0,l)|~less_than_or_equal(f(X0),n0)|less_than_or_equal(X0,h(l))|~spl0_2)),
% 5.65/1.09 inference(component_clause,[status(thm)],[f45])).
% 5.65/1.09 fof(f48,plain,(
% 5.65/1.09 spl0_3 <=> less_than_or_equal(lower_bound,l)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f50,plain,(
% 5.65/1.09 ~less_than_or_equal(lower_bound,l)|spl0_3),
% 5.65/1.09 inference(component_clause,[status(thm)],[f48])).
% 5.65/1.09 fof(f51,plain,(
% 5.65/1.09 spl0_4 <=> less_than_or_equal(l,upper_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f53,plain,(
% 5.65/1.09 ~less_than_or_equal(l,upper_bound)|spl0_4),
% 5.65/1.09 inference(component_clause,[status(thm)],[f51])).
% 5.65/1.09 fof(f54,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(X0,l)|~less_than_or_equal(f(X0),n0)|less_than_or_equal(X0,h(l))|~less_than_or_equal(lower_bound,l)|~less_than_or_equal(l,upper_bound)|spl0_0)),
% 5.65/1.09 inference(resolution,[status(thm)],[f40,f26])).
% 5.65/1.09 fof(f55,plain,(
% 5.65/1.09 spl0_2|~spl0_3|~spl0_4|spl0_0),
% 5.65/1.09 inference(split_clause,[status(thm)],[f54,f45,f48,f51,f38])).
% 5.65/1.09 fof(f56,plain,(
% 5.65/1.09 spl0_5 <=> less_than_or_equal(l,h(l))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f58,plain,(
% 5.65/1.09 ~less_than_or_equal(l,h(l))|spl0_5),
% 5.65/1.09 inference(component_clause,[status(thm)],[f56])).
% 5.65/1.09 fof(f59,plain,(
% 5.65/1.09 ~less_than_or_equal(l,h(l))|~less_than_or_equal(lower_bound,l)|~less_than_or_equal(l,upper_bound)|spl0_0),
% 5.65/1.09 inference(resolution,[status(thm)],[f40,f24])).
% 5.65/1.09 fof(f60,plain,(
% 5.65/1.09 ~spl0_5|~spl0_3|~spl0_4|spl0_0),
% 5.65/1.09 inference(split_clause,[status(thm)],[f59,f56,f48,f51,f38])).
% 5.65/1.09 fof(f65,plain,(
% 5.65/1.09 spl0_6 <=> ~less_than_or_equal(l,X0)|~less_than_or_equal(n0,f(X0))|less_than_or_equal(k(l),X0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f66,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(l,X0)|~less_than_or_equal(n0,f(X0))|less_than_or_equal(k(l),X0)|~spl0_6)),
% 5.65/1.09 inference(component_clause,[status(thm)],[f65])).
% 5.65/1.09 fof(f68,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(l,X0)|~less_than_or_equal(n0,f(X0))|less_than_or_equal(k(l),X0)|~less_than_or_equal(lower_bound,l)|~less_than_or_equal(l,upper_bound)|spl0_1)),
% 5.65/1.09 inference(resolution,[status(thm)],[f43,f29])).
% 5.65/1.09 fof(f69,plain,(
% 5.65/1.09 spl0_6|~spl0_3|~spl0_4|spl0_1),
% 5.65/1.09 inference(split_clause,[status(thm)],[f68,f65,f48,f51,f41])).
% 5.65/1.09 fof(f70,plain,(
% 5.65/1.09 spl0_7 <=> less_than_or_equal(k(l),l)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f72,plain,(
% 5.65/1.09 ~less_than_or_equal(k(l),l)|spl0_7),
% 5.65/1.09 inference(component_clause,[status(thm)],[f70])).
% 5.65/1.09 fof(f73,plain,(
% 5.65/1.09 ~less_than_or_equal(k(l),l)|~less_than_or_equal(lower_bound,l)|~less_than_or_equal(l,upper_bound)|spl0_1),
% 5.65/1.09 inference(resolution,[status(thm)],[f43,f27])).
% 5.65/1.09 fof(f74,plain,(
% 5.65/1.09 ~spl0_7|~spl0_3|~spl0_4|spl0_1),
% 5.65/1.09 inference(split_clause,[status(thm)],[f73,f70,f48,f51,f41])).
% 5.65/1.09 fof(f79,plain,(
% 5.65/1.09 ~less_than_or_equal(g(upper_bound),upper_bound)|spl0_4),
% 5.65/1.09 inference(resolution,[status(thm)],[f53,f33])).
% 5.65/1.09 fof(f84,plain,(
% 5.65/1.09 ~less_than_or_equal(g(h(l)),h(l))|spl0_5),
% 5.65/1.09 inference(resolution,[status(thm)],[f58,f33])).
% 5.65/1.09 fof(f89,plain,(
% 5.65/1.09 spl0_8 <=> less_than_or_equal(k(l),upper_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f91,plain,(
% 5.65/1.09 ~less_than_or_equal(k(l),upper_bound)|spl0_8),
% 5.65/1.09 inference(component_clause,[status(thm)],[f89])).
% 5.65/1.09 fof(f97,plain,(
% 5.65/1.09 ~less_than_or_equal(q(l,k(l)),l)|spl0_7),
% 5.65/1.09 inference(resolution,[status(thm)],[f72,f23])).
% 5.65/1.09 fof(f98,plain,(
% 5.65/1.09 ~less_than_or_equal(k(l),q(l,k(l)))|spl0_7),
% 5.65/1.09 inference(resolution,[status(thm)],[f72,f22])).
% 5.65/1.09 fof(f109,plain,(
% 5.65/1.09 less_than_or_equal(l,upper_bound)|spl0_4),
% 5.65/1.09 inference(resolution,[status(thm)],[f79,f31])).
% 5.65/1.09 fof(f110,plain,(
% 5.65/1.09 $false|spl0_4),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f109,f53])).
% 5.65/1.09 fof(f111,plain,(
% 5.65/1.09 spl0_4),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f110])).
% 5.65/1.09 fof(f112,plain,(
% 5.65/1.09 spl0_10 <=> less_than_or_equal(lower_bound,upper_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f114,plain,(
% 5.65/1.09 ~less_than_or_equal(lower_bound,upper_bound)|spl0_10),
% 5.65/1.09 inference(component_clause,[status(thm)],[f112])).
% 5.65/1.09 fof(f115,plain,(
% 5.65/1.09 spl0_11 <=> less_than_or_equal(f(lower_bound),n0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f117,plain,(
% 5.65/1.09 ~less_than_or_equal(f(lower_bound),n0)|spl0_11),
% 5.65/1.09 inference(component_clause,[status(thm)],[f115])).
% 5.65/1.09 fof(f118,plain,(
% 5.65/1.09 ~less_than_or_equal(lower_bound,upper_bound)|~less_than_or_equal(f(lower_bound),n0)|spl0_3),
% 5.65/1.09 inference(resolution,[status(thm)],[f50,f30])).
% 5.65/1.09 fof(f119,plain,(
% 5.65/1.09 ~spl0_10|~spl0_11|spl0_3),
% 5.65/1.09 inference(split_clause,[status(thm)],[f118,f112,f115,f48])).
% 5.65/1.09 fof(f124,plain,(
% 5.65/1.09 $false|spl0_10),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f114,f34])).
% 5.65/1.09 fof(f125,plain,(
% 5.65/1.09 spl0_10),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f124])).
% 5.65/1.09 fof(f126,plain,(
% 5.65/1.09 $false|spl0_11),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f117,f35])).
% 5.65/1.09 fof(f127,plain,(
% 5.65/1.09 spl0_11),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f126])).
% 5.65/1.09 fof(f166,plain,(
% 5.65/1.09 spl0_15 <=> less_than_or_equal(n0,n0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f168,plain,(
% 5.65/1.09 ~less_than_or_equal(n0,n0)|spl0_15),
% 5.65/1.09 inference(component_clause,[status(thm)],[f166])).
% 5.65/1.09 fof(f202,plain,(
% 5.65/1.09 spl0_19 <=> less_than_or_equal(l,l)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f204,plain,(
% 5.65/1.09 ~less_than_or_equal(l,l)|spl0_19),
% 5.65/1.09 inference(component_clause,[status(thm)],[f202])).
% 5.65/1.09 fof(f207,plain,(
% 5.65/1.09 spl0_20 <=> less_than_or_equal(n0,f(upper_bound))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f209,plain,(
% 5.65/1.09 ~less_than_or_equal(n0,f(upper_bound))|spl0_20),
% 5.65/1.09 inference(component_clause,[status(thm)],[f207])).
% 5.65/1.09 fof(f210,plain,(
% 5.65/1.09 ~less_than_or_equal(l,upper_bound)|~less_than_or_equal(n0,f(upper_bound))|~spl0_6|spl0_8),
% 5.65/1.09 inference(resolution,[status(thm)],[f66,f91])).
% 5.65/1.09 fof(f211,plain,(
% 5.65/1.09 ~spl0_4|~spl0_20|~spl0_6|spl0_8),
% 5.65/1.09 inference(split_clause,[status(thm)],[f210,f51,f207,f65,f89])).
% 5.65/1.09 fof(f212,plain,(
% 5.65/1.09 $false|spl0_20),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f209,f36])).
% 5.65/1.09 fof(f213,plain,(
% 5.65/1.09 spl0_20),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f212])).
% 5.65/1.09 fof(f278,plain,(
% 5.65/1.09 spl0_28 <=> less_than_or_equal(q(l,k(l)),upper_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f280,plain,(
% 5.65/1.09 ~less_than_or_equal(q(l,k(l)),upper_bound)|spl0_28),
% 5.65/1.09 inference(component_clause,[status(thm)],[f278])).
% 5.65/1.09 fof(f281,plain,(
% 5.65/1.09 spl0_29 <=> less_than_or_equal(f(q(l,k(l))),n0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f283,plain,(
% 5.65/1.09 ~less_than_or_equal(f(q(l,k(l))),n0)|spl0_29),
% 5.65/1.09 inference(component_clause,[status(thm)],[f281])).
% 5.65/1.09 fof(f284,plain,(
% 5.65/1.09 ~less_than_or_equal(q(l,k(l)),upper_bound)|~less_than_or_equal(f(q(l,k(l))),n0)|spl0_7),
% 5.65/1.09 inference(resolution,[status(thm)],[f97,f30])).
% 5.65/1.09 fof(f285,plain,(
% 5.65/1.09 ~spl0_28|~spl0_29|spl0_7),
% 5.65/1.09 inference(split_clause,[status(thm)],[f284,f278,f281,f70])).
% 5.65/1.09 fof(f289,plain,(
% 5.65/1.09 less_than_or_equal(l,q(l,k(l)))|spl0_7),
% 5.65/1.09 inference(resolution,[status(thm)],[f97,f19])).
% 5.65/1.09 fof(f307,plain,(
% 5.65/1.09 $false|spl0_19),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f204,f18])).
% 5.65/1.09 fof(f308,plain,(
% 5.65/1.09 spl0_19),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f307])).
% 5.65/1.09 fof(f343,plain,(
% 5.65/1.09 spl0_33 <=> less_than_or_equal(l,q(l,k(l)))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f345,plain,(
% 5.65/1.09 ~less_than_or_equal(l,q(l,k(l)))|spl0_33),
% 5.65/1.09 inference(component_clause,[status(thm)],[f343])).
% 5.65/1.09 fof(f346,plain,(
% 5.65/1.09 spl0_34 <=> less_than_or_equal(n0,f(q(l,k(l))))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f348,plain,(
% 5.65/1.09 ~less_than_or_equal(n0,f(q(l,k(l))))|spl0_34),
% 5.65/1.09 inference(component_clause,[status(thm)],[f346])).
% 5.65/1.09 fof(f349,plain,(
% 5.65/1.09 ~less_than_or_equal(l,q(l,k(l)))|~less_than_or_equal(n0,f(q(l,k(l))))|spl0_7|~spl0_6),
% 5.65/1.09 inference(resolution,[status(thm)],[f98,f66])).
% 5.65/1.09 fof(f350,plain,(
% 5.65/1.09 ~spl0_33|~spl0_34|spl0_7|~spl0_6),
% 5.65/1.09 inference(split_clause,[status(thm)],[f349,f343,f346,f70,f65])).
% 5.65/1.09 fof(f353,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(k(l),X0)|~less_than_or_equal(X0,q(l,k(l)))|spl0_7)),
% 5.65/1.09 inference(resolution,[status(thm)],[f98,f21])).
% 5.65/1.09 fof(f355,plain,(
% 5.65/1.09 $false|spl0_7|spl0_33),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f345,f289])).
% 5.65/1.09 fof(f356,plain,(
% 5.65/1.09 spl0_7|spl0_33),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f355])).
% 5.65/1.09 fof(f375,plain,(
% 5.65/1.09 spl0_35 <=> less_than_or_equal(upper_bound,upper_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f377,plain,(
% 5.65/1.09 ~less_than_or_equal(upper_bound,upper_bound)|spl0_35),
% 5.65/1.09 inference(component_clause,[status(thm)],[f375])).
% 5.65/1.09 fof(f386,plain,(
% 5.65/1.09 $false|spl0_35),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f377,f18])).
% 5.65/1.09 fof(f387,plain,(
% 5.65/1.09 spl0_35),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f386])).
% 5.65/1.09 fof(f454,plain,(
% 5.65/1.09 $false|spl0_15),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f168,f18])).
% 5.65/1.09 fof(f455,plain,(
% 5.65/1.09 spl0_15),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f454])).
% 5.65/1.09 fof(f642,plain,(
% 5.65/1.09 spl0_60 <=> ~less_than_or_equal(n0,X0)|~less_than_or_equal(X0,n0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f643,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(n0,X0)|~less_than_or_equal(X0,n0)|~spl0_60)),
% 5.65/1.09 inference(component_clause,[status(thm)],[f642])).
% 5.65/1.09 fof(f729,plain,(
% 5.65/1.09 ~less_than_or_equal(n0,n0)|~spl0_60),
% 5.65/1.09 inference(resolution,[status(thm)],[f643,f18])).
% 5.65/1.09 fof(f730,plain,(
% 5.65/1.09 ~spl0_15|~spl0_60),
% 5.65/1.09 inference(split_clause,[status(thm)],[f729,f166,f642])).
% 5.65/1.09 fof(f880,plain,(
% 5.65/1.09 spl0_71 <=> less_than_or_equal(g(h(l)),l)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f882,plain,(
% 5.65/1.09 ~less_than_or_equal(g(h(l)),l)|spl0_71),
% 5.65/1.09 inference(component_clause,[status(thm)],[f880])).
% 5.65/1.09 fof(f883,plain,(
% 5.65/1.09 spl0_72 <=> less_than_or_equal(f(g(h(l))),n0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f885,plain,(
% 5.65/1.09 ~less_than_or_equal(f(g(h(l))),n0)|spl0_72),
% 5.65/1.09 inference(component_clause,[status(thm)],[f883])).
% 5.65/1.09 fof(f886,plain,(
% 5.65/1.09 ~less_than_or_equal(g(h(l)),l)|~less_than_or_equal(f(g(h(l))),n0)|spl0_5|~spl0_2),
% 5.65/1.09 inference(resolution,[status(thm)],[f84,f46])).
% 5.65/1.09 fof(f887,plain,(
% 5.65/1.09 ~spl0_71|~spl0_72|spl0_5|~spl0_2),
% 5.65/1.09 inference(split_clause,[status(thm)],[f886,f880,f883,f56,f45])).
% 5.65/1.09 fof(f941,plain,(
% 5.65/1.09 spl0_75 <=> less_than_or_equal(h(l),h(l))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f943,plain,(
% 5.65/1.09 ~less_than_or_equal(h(l),h(l))|spl0_75),
% 5.65/1.09 inference(component_clause,[status(thm)],[f941])).
% 5.65/1.09 fof(f954,plain,(
% 5.65/1.09 $false|spl0_75),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f943,f18])).
% 5.65/1.09 fof(f955,plain,(
% 5.65/1.09 spl0_75),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f954])).
% 5.65/1.09 fof(f1081,plain,(
% 5.65/1.09 spl0_81 <=> less_than_or_equal(g(h(l)),upper_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f1083,plain,(
% 5.65/1.09 ~less_than_or_equal(g(h(l)),upper_bound)|spl0_81),
% 5.65/1.09 inference(component_clause,[status(thm)],[f1081])).
% 5.65/1.09 fof(f1084,plain,(
% 5.65/1.09 ~less_than_or_equal(g(h(l)),upper_bound)|~less_than_or_equal(f(g(h(l))),n0)|spl0_71),
% 5.65/1.09 inference(resolution,[status(thm)],[f882,f30])).
% 5.65/1.09 fof(f1085,plain,(
% 5.65/1.09 ~spl0_81|~spl0_72|spl0_71),
% 5.65/1.09 inference(split_clause,[status(thm)],[f1084,f1081,f883,f880])).
% 5.65/1.09 fof(f1134,plain,(
% 5.65/1.09 less_than_or_equal(l,h(l))|spl0_81),
% 5.65/1.09 inference(resolution,[status(thm)],[f1083,f31])).
% 5.65/1.09 fof(f1135,plain,(
% 5.65/1.09 spl0_5|spl0_81),
% 5.65/1.09 inference(split_clause,[status(thm)],[f1134,f56,f1081])).
% 5.65/1.09 fof(f1354,plain,(
% 5.65/1.09 less_than_or_equal(upper_bound,q(l,k(l)))|spl0_28),
% 5.65/1.09 inference(resolution,[status(thm)],[f280,f19])).
% 5.65/1.09 fof(f1540,plain,(
% 5.65/1.09 less_than_or_equal(f(q(l,k(l))),n0)|spl0_34),
% 5.65/1.09 inference(resolution,[status(thm)],[f348,f19])).
% 5.65/1.09 fof(f1541,plain,(
% 5.65/1.09 $false|spl0_29|spl0_34),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f1540,f283])).
% 5.65/1.09 fof(f1542,plain,(
% 5.65/1.09 spl0_29|spl0_34),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f1541])).
% 5.65/1.09 fof(f1875,plain,(
% 5.65/1.09 less_than_or_equal(l,h(l))|spl0_72),
% 5.65/1.09 inference(resolution,[status(thm)],[f885,f32])).
% 5.65/1.09 fof(f1876,plain,(
% 5.65/1.09 spl0_5|spl0_72),
% 5.65/1.09 inference(split_clause,[status(thm)],[f1875,f56,f883])).
% 5.65/1.09 fof(f2023,plain,(
% 5.65/1.09 spl0_172 <=> less_than_or_equal(k(l),k(l))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f2025,plain,(
% 5.65/1.09 ~less_than_or_equal(k(l),k(l))|spl0_172),
% 5.65/1.09 inference(component_clause,[status(thm)],[f2023])).
% 5.65/1.09 fof(f2037,plain,(
% 5.65/1.09 $false|spl0_172),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f2025,f18])).
% 5.65/1.09 fof(f2038,plain,(
% 5.65/1.09 spl0_172),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f2037])).
% 5.65/1.09 fof(f2061,plain,(
% 5.65/1.09 spl0_176 <=> less_than_or_equal(lower_bound,lower_bound)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f2063,plain,(
% 5.65/1.09 ~less_than_or_equal(lower_bound,lower_bound)|spl0_176),
% 5.65/1.09 inference(component_clause,[status(thm)],[f2061])).
% 5.65/1.09 fof(f2075,plain,(
% 5.65/1.09 $false|spl0_176),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f2063,f18])).
% 5.65/1.09 fof(f2076,plain,(
% 5.65/1.09 spl0_176),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f2075])).
% 5.65/1.09 fof(f2784,plain,(
% 5.65/1.09 spl0_212 <=> less_than_or_equal(f(l),f(l))),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f2786,plain,(
% 5.65/1.09 ~less_than_or_equal(f(l),f(l))|spl0_212),
% 5.65/1.09 inference(component_clause,[status(thm)],[f2784])).
% 5.65/1.09 fof(f2827,plain,(
% 5.65/1.09 $false|spl0_212),
% 5.65/1.09 inference(forward_subsumption_resolution,[status(thm)],[f2786,f18])).
% 5.65/1.09 fof(f2828,plain,(
% 5.65/1.09 spl0_212),
% 5.65/1.09 inference(contradiction_clause,[status(thm)],[f2827])).
% 5.65/1.09 fof(f3518,plain,(
% 5.65/1.09 spl0_252 <=> ~less_than_or_equal(X0,l)|~less_than_or_equal(l,X0)),
% 5.65/1.09 introduced(split_symbol_definition)).
% 5.65/1.09 fof(f3519,plain,(
% 5.65/1.09 ![X0]: (~less_than_or_equal(X0,l)|~less_than_or_equal(l,X0)|~spl0_252)),
% 5.65/1.09 inference(component_clause,[status(thm)],[f3518])).
% 5.65/1.09 fof(f3915,plain,(
% 5.65/1.09 ~less_than_or_equal(l,l)|~spl0_252),
% 5.65/1.09 inference(resolution,[status(thm)],[f3519,f18])).
% 5.65/1.10 fof(f3916,plain,(
% 5.65/1.10 ~spl0_19|~spl0_252),
% 5.65/1.10 inference(split_clause,[status(thm)],[f3915,f202,f3518])).
% 5.65/1.10 fof(f5103,plain,(
% 5.65/1.10 ~less_than_or_equal(k(l),upper_bound)|spl0_28|spl0_7),
% 5.65/1.10 inference(resolution,[status(thm)],[f1354,f353])).
% 5.65/1.10 fof(f5104,plain,(
% 5.65/1.10 ~spl0_8|spl0_28|spl0_7),
% 5.65/1.10 inference(split_clause,[status(thm)],[f5103,f89,f278,f70])).
% 5.65/1.10 fof(f5105,plain,(
% 5.65/1.10 $false),
% 5.65/1.10 inference(sat_refutation,[status(thm)],[f44,f55,f60,f69,f74,f111,f119,f125,f127,f211,f213,f285,f308,f350,f356,f387,f455,f730,f887,f955,f1085,f1135,f1542,f1876,f2038,f2076,f2828,f3916,f5104])).
% 5.65/1.10 % SZS output end CNFRefutation for theBenchmark.p
% 5.65/1.11 % Elapsed time: 0.787819 seconds
% 5.65/1.11 % CPU time: 5.779678 seconds
% 5.65/1.11 % Memory used: 27.622 MB
%------------------------------------------------------------------------------