%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ANA002-3 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n015.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.20s 0.46s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
less_than_or_equal(n0,f(upper_bound)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_mapping)]) ).
cnf(g1,plain,
less_than_or_equal(lower_bound,upper_bound),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_interval)]) ).
cnf(g2,plain,
less_than_or_equal(f(lower_bound),n0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_mapping)]) ).
cnf(g3,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/sandbox/benchmark/theBenchmark.p',crossover1)]) ).
cnf(g4,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/sandbox/benchmark/theBenchmark.p',continuity4)]) ).
cnf(g5,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/sandbox/benchmark/theBenchmark.p',crossover1)]) ).
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/sandbox/benchmark/theBenchmark.p',continuity1)]) ).
cnf(g7,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/sandbox/benchmark/theBenchmark.p',continuity1)]) ).
cnf(g8,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/sandbox/benchmark/theBenchmark.p',continuity3)]) ).
cnf(g9,plain,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_x_which_crosses)]) ).
cnf(g10,plain,
( less_than_or_equal(l,upper_bound)
| less_than_or_equal(g(upper_bound),upper_bound) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover2_and_g_function1)]) ).
cnf(g11,plain,
( ~ less_than_or_equal(g(upper_bound),upper_bound)
| less_than_or_equal(l,upper_bound) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover4_and_g_function3)]) ).
cnf(g12,plain,
( less_than_or_equal(f(g(h(l))),n0)
| less_than_or_equal(l,h(l)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover3_and_g_function2)]) ).
cnf(g13,plain,
( ~ less_than_or_equal(g(h(l)),h(l))
| less_than_or_equal(l,h(l)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover4_and_g_function3)]) ).
cnf(g14,plain,
( less_than_or_equal(l,h(l))
| less_than_or_equal(g(h(l)),upper_bound) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover2_and_g_function1)]) ).
cnf(g15,plain,
( less_than_or_equal(l,k(l))
| less_than_or_equal(k(l),l) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_less)]) ).
cnf(g16,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/sandbox/benchmark/theBenchmark.p',crossover1)]) ).
cnf(g17,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/sandbox/benchmark/theBenchmark.p',continuity2)]) ).
cnf(g18,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/sandbox/benchmark/theBenchmark.p',continuity2)]) ).
cnf(g19,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/sandbox/benchmark/theBenchmark.p',continuity4)]) ).
cnf(g20,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/sandbox/benchmark/theBenchmark.p',interpolation1)]) ).
cnf(g21,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/sandbox/benchmark/theBenchmark.p',interpolation2)]) ).
cnf(g22,plain,
( ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,k(l))
| less_than_or_equal(lower_bound,k(l)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less)]) ).
cnf(g23,plain,
( less_than_or_equal(h(k(l)),q(h(k(l)),k(l)))
| less_than_or_equal(q(h(k(l)),k(l)),h(k(l))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_less)]) ).
cnf(g24,plain,
( ~ less_than_or_equal(l,h(k(l)))
| ~ less_than_or_equal(h(k(l)),q(h(k(l)),k(l)))
| less_than_or_equal(l,q(h(k(l)),k(l))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less)]) ).
cnf(g25,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/sandbox/benchmark/theBenchmark.p',totality_of_less)]) ).
cnf(g26,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/sandbox/benchmark/theBenchmark.p',continuity2)]) ).
cnf(g27,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/sandbox/benchmark/theBenchmark.p',totality_of_less)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA002-3 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n015.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 : 600
% 0.13/0.34 % DateTime : Fri Jul 8 06:50:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 % symbols: 12
% 0.20/0.46 % clauses: 17
% 0.20/0.46 % start clauses: 1
% 0.20/0.46 % iterative deepening steps: 354
% 0.20/0.46 % maximum path limit: 5
% 0.20/0.46 % literal attempts: 93982
% 0.20/0.46 % depth failures: 73267
% 0.20/0.46 % regularity failures: 1844
% 0.20/0.46 % tautology failures: 12281
% 0.20/0.46 % reductions: 2218
% 0.20/0.46 % extensions: 91662
% 0.20/0.46 % SAT variables: 19006
% 0.20/0.46 % SAT clauses: 25101
% 0.20/0.46 % WalkSAT solutions: 25097
% 0.20/0.46 % CDCL solutions: 1
% 0.20/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.46 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------