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

% Computer : n020.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 : Sat Jul 16 13:02:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ less_equal(divide(a,c),divide(b,c)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_divide_c_LE_b_divide_c)]) ).

cnf(g1,plain,
    ( ~ sPE(divide(divide(a,c),divide(b,c)),zero)
    | less_equal(divide(a,c),divide(b,c)) ),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_less_equal2)]) ).

cnf(g2,plain,
    ( ~ sPE(zero,divide(divide(a,c),divide(b,c)))
    | sPE(divide(divide(a,c),divide(b,c)),zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(c,c),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ less_equal(zero,divide(divide(a,c),divide(b,c)))
    | ~ less_equal(divide(divide(a,c),divide(b,c)),zero)
    | sPE(zero,divide(divide(a,c),divide(b,c))) ),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',less_equal_and_equal)]) ).

cnf(g5,plain,
    less_equal(zero,divide(divide(a,c),divide(b,c))),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',zero_is_smallest)]) ).

cnf(g6,plain,
    less_equal(zero,c),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',zero_is_smallest)]) ).

cnf(g7,plain,
    less_equal(a,b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_LE_b)]) ).

cnf(g8,plain,
    sPE(divide(divide(a,c),divide(b,c)),divide(divide(a,c),divide(b,c))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    less_equal(divide(divide(a,c),divide(b,c)),divide(divide(a,b),c)),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_property)]) ).

cnf(g10,plain,
    ( ~ less_equal(zero,c)
    | sPE(divide(zero,c),zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_less_equal1)]) ).

cnf(g11,plain,
    ( ~ sPE(divide(divide(a,c),divide(b,c)),divide(divide(a,c),divide(b,c)))
    | ~ sPE(divide(divide(a,b),c),divide(zero,c))
    | ~ less_equal(divide(divide(a,c),divide(b,c)),divide(divide(a,b),c))
    | less_equal(divide(divide(a,c),divide(b,c)),divide(zero,c)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(divide(a,b),zero)
    | ~ sPE(c,c)
    | sPE(divide(divide(a,b),c),divide(zero,c)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ less_equal(a,b)
    | sPE(divide(a,b),zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_less_equal1)]) ).

cnf(g14,plain,
    ( ~ sPE(divide(divide(a,c),divide(b,c)),divide(divide(a,c),divide(b,c)))
    | ~ sPE(divide(zero,c),zero)
    | ~ less_equal(divide(divide(a,c),divide(b,c)),divide(zero,c))
    | less_equal(divide(divide(a,c),divide(b,c)),zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : HEN008-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n020.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  1 13:09:15 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.39  % symbols: 9
% 0.13/0.39  % clauses: 14
% 0.13/0.39  % start clauses: 1
% 0.13/0.39  % iterative deepening steps: 403
% 0.13/0.39  % maximum path limit: 5
% 0.13/0.39  % literal attempts: 45653
% 0.13/0.39  % depth failures: 25838
% 0.13/0.39  % regularity failures: 3919
% 0.13/0.39  % tautology failures: 4103
% 0.13/0.39  % reductions: 0
% 0.13/0.39  % extensions: 45337
% 0.13/0.39  % SAT variables: 5053
% 0.13/0.39  % SAT clauses: 9248
% 0.13/0.39  % WalkSAT solutions: 9248
% 0.13/0.39  % CDCL solutions: 0
% 0.13/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.39  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------