%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : ANA002-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n013.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  : 600s
% DateTime : Thu Jul 14 19:25:27 EDT 2022

% Result   : Unsatisfiable 0.18s 0.52s
% Output   : Proof 0.18s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( ~ less_than_or_equal(f(l),n0)
    | ~ less_than_or_equal(n0,f(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_x_which_crosses)]) ).

cnf(g1,plain,
    ( ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(lower_bound,l)
    | ~ less_than_or_equal(k(l),l)
    | less_than_or_equal(n0,f(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity3)]) ).

cnf(g2,plain,
    ( ~ less_than_or_equal(k(l),upper_bound)
    | ~ less_than_or_equal(f(k(l)),n0)
    | less_than_or_equal(k(l),l) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover1)]) ).

cnf(g3,plain,
    ( ~ less_than_or_equal(g(upper_bound),upper_bound)
    | less_than_or_equal(l,upper_bound) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover4_and_g_function3)]) ).

cnf(g4,plain,
    ( less_than_or_equal(l,upper_bound)
    | less_than_or_equal(g(upper_bound),upper_bound) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover2_and_g_function1)]) ).

cnf(g5,plain,
    ( ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(n0,f(upper_bound))
    | ~ less_than_or_equal(lower_bound,l)
    | less_than_or_equal(n0,f(l))
    | less_than_or_equal(k(l),upper_bound) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity4)]) ).

cnf(g6,plain,
    ( ~ less_than_or_equal(k(l),h(k(l)))
    | ~ less_than_or_equal(k(l),upper_bound)
    | ~ less_than_or_equal(lower_bound,k(l))
    | less_than_or_equal(f(k(l)),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity1)]) ).

cnf(g7,plain,
    ( ~ less_than_or_equal(k(l),upper_bound)
    | ~ less_than_or_equal(l,k(l))
    | ~ less_than_or_equal(f(l),n0)
    | ~ less_than_or_equal(lower_bound,k(l))
    | less_than_or_equal(l,h(k(l)))
    | less_than_or_equal(f(k(l)),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2)]) ).

cnf(g8,plain,
    less_than_or_equal(f(lower_bound),n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_mapping)]) ).

cnf(g9,plain,
    ( ~ less_than_or_equal(l,h(l))
    | ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(lower_bound,l)
    | less_than_or_equal(f(l),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity1)]) ).

cnf(g10,plain,
    ( less_than_or_equal(f(g(h(l))),n0)
    | less_than_or_equal(l,h(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover3_and_g_function2)]) ).

cnf(g11,plain,
    ( ~ less_than_or_equal(g(h(l)),h(l))
    | less_than_or_equal(l,h(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover4_and_g_function3)]) ).

cnf(g12,plain,
    ( less_than_or_equal(l,h(l))
    | less_than_or_equal(g(h(l)),upper_bound) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover2_and_g_function1)]) ).

cnf(g13,plain,
    ( ~ less_than_or_equal(lower_bound,upper_bound)
    | ~ less_than_or_equal(f(lower_bound),n0)
    | less_than_or_equal(lower_bound,l) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover1)]) ).

cnf(g14,plain,
    less_than_or_equal(lower_bound,upper_bound),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_interval)]) ).

cnf(g15,plain,
    less_than_or_equal(n0,f(upper_bound)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upper_mapping)]) ).

cnf(g16,plain,
    ( ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(g(h(l)),l)
    | ~ less_than_or_equal(f(g(h(l))),n0)
    | ~ less_than_or_equal(lower_bound,l)
    | less_than_or_equal(g(h(l)),h(l))
    | less_than_or_equal(f(l),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2)]) ).

cnf(g17,plain,
    ( ~ less_than_or_equal(g(h(l)),upper_bound)
    | ~ less_than_or_equal(f(g(h(l))),n0)
    | less_than_or_equal(g(h(l)),l) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover1)]) ).

cnf(g18,plain,
    ( less_than_or_equal(k(l),l)
    | less_than_or_equal(l,k(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less)]) ).

cnf(g19,plain,
    ( less_than_or_equal(lower_bound,k(l))
    | less_than_or_equal(k(l),lower_bound) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less)]) ).

cnf(g20,plain,
    ( ~ less_than_or_equal(q(h(k(l)),k(l)),h(k(l)))
    | less_than_or_equal(k(l),h(k(l))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation2)]) ).

cnf(g21,plain,
    ( ~ less_than_or_equal(k(l),q(h(k(l)),k(l)))
    | less_than_or_equal(k(l),h(k(l))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation1)]) ).

cnf(g22,plain,
    ( ~ less_than_or_equal(k(l),lower_bound)
    | ~ less_than_or_equal(lower_bound,l)
    | less_than_or_equal(k(l),l) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less)]) ).

cnf(g23,plain,
    ( ~ less_than_or_equal(q(h(k(l)),k(l)),l)
    | ~ less_than_or_equal(l,h(k(l)))
    | less_than_or_equal(q(h(k(l)),k(l)),h(k(l))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less)]) ).

cnf(g24,plain,
    ( ~ less_than_or_equal(k(l),upper_bound)
    | ~ less_than_or_equal(q(h(k(l)),k(l)),k(l))
    | ~ less_than_or_equal(f(q(h(k(l)),k(l))),n0)
    | ~ less_than_or_equal(lower_bound,k(l))
    | less_than_or_equal(q(h(k(l)),k(l)),h(k(l)))
    | less_than_or_equal(f(k(l)),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2)]) ).

cnf(g25,plain,
    ( less_than_or_equal(k(l),q(h(k(l)),k(l)))
    | less_than_or_equal(q(h(k(l)),k(l)),k(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less)]) ).

cnf(g26,plain,
    ( ~ less_than_or_equal(l,q(h(k(l)),k(l)))
    | ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(n0,f(q(h(k(l)),k(l))))
    | ~ less_than_or_equal(lower_bound,l)
    | less_than_or_equal(n0,f(l))
    | less_than_or_equal(k(l),q(h(k(l)),k(l))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity4)]) ).

cnf(g27,plain,
    ( less_than_or_equal(n0,f(q(h(k(l)),k(l))))
    | less_than_or_equal(f(q(h(k(l)),k(l))),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less)]) ).

cnf(g28,plain,
    ( less_than_or_equal(l,q(h(k(l)),k(l)))
    | less_than_or_equal(q(h(k(l)),k(l)),l) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : ANA002-4 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jul  8 06:43:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.52  % symbols: 12
% 0.18/0.52  % clauses: 17
% 0.18/0.52  % start clauses: 1
% 0.18/0.52  % iterative deepening steps: 248
% 0.18/0.52  % maximum path limit: 4
% 0.18/0.52  % literal attempts: 187061
% 0.18/0.52  % depth failures: 150551
% 0.18/0.52  % regularity failures: 3987
% 0.18/0.52  % tautology failures: 24752
% 0.18/0.52  % reductions: 2749
% 0.18/0.52  % extensions: 184222
% 0.18/0.52  % SAT variables: 14831
% 0.18/0.52  % SAT clauses: 19889
% 0.18/0.52  % WalkSAT solutions: 19879
% 0.18/0.52  % CDCL solutions: 8
% 0.18/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.52  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------