TSTP Solution File: ANA002-2 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : ANA002-2 : TPTP v8.1.0. Bugfixed v1.0.1.
% 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:26 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ in_interval(f(l),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(f(l),n0)
    | ~ less_than_or_equal(n0,f(l))
    | in_interval(f(l),n0,f(l)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_interval)]) ).

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

cnf(g3,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(g4,plain,
    ( ~ less_than_or_equal(lower_bound,l)
    | ~ less_than_or_equal(l,upper_bound)
    | in_interval(lower_bound,l,upper_bound) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_interval)]) ).

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

cnf(g6,plain,
    ( ~ in_interval(lower_bound,l,upper_bound)
    | ~ 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(g7,plain,
    ( ~ less_than_or_equal(k(l),q(l,k(l)))
    | less_than_or_equal(k(l),l) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation1)]) ).

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

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

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

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

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

cnf(g13,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(g14,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(g15,plain,
    ( ~ in_interval(lower_bound,l,upper_bound)
    | ~ less_than_or_equal(l,upper_bound)
    | ~ less_than_or_equal(n0,f(upper_bound))
    | 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(g16,plain,
    less_than_or_equal(lower_bound,upper_bound),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_interval)]) ).

cnf(g17,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(g18,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(g19,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(g20,plain,
    ( ~ in_interval(lower_bound,l,upper_bound)
    | ~ less_than_or_equal(g(h(l)),l)
    | ~ less_than_or_equal(f(g(h(l))),n0)
    | 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(g21,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(g22,plain,
    ( less_than_or_equal(q(l,k(l)),upper_bound)
    | less_than_or_equal(upper_bound,q(l,k(l))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less)]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : ANA002-2 : TPTP v8.1.0. Bugfixed v1.0.1.
% 0.10/0.12  % Command  : satcop --statistics %s
% 0.12/0.31  % Computer : n013.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit : 300
% 0.12/0.31  % WCLimit  : 600
% 0.12/0.31  % DateTime : Fri Jul  8 04:11:14 EDT 2022
% 0.12/0.31  % CPUTime  : 
% 0.16/0.40  % symbols: 13
% 0.16/0.40  % clauses: 18
% 0.16/0.40  % start clauses: 1
% 0.16/0.40  % iterative deepening steps: 240
% 0.16/0.40  % maximum path limit: 5
% 0.16/0.40  % literal attempts: 108746
% 0.16/0.40  % depth failures: 83919
% 0.16/0.40  % regularity failures: 1438
% 0.16/0.40  % tautology failures: 14393
% 0.16/0.40  % reductions: 2995
% 0.16/0.40  % extensions: 105695
% 0.16/0.40  % SAT variables: 12244
% 0.16/0.40  % SAT clauses: 16076
% 0.16/0.40  % WalkSAT solutions: 16067
% 0.16/0.40  % CDCL solutions: 8
% 0.16/0.40  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------