%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : HEN012-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %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  : 600s
% DateTime : Sat Jul 16 13:02:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ less_equal(x,x),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_X_less_than_or_equal_to_X)]) ).

cnf(g1,plain,
    ( ~ quotient(x,x,zero)
    | less_equal(x,x) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).

cnf(g2,plain,
    less_equal(zero,x),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).

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

cnf(g4,plain,
    quotient(x,x,divide(x,x)),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).

cnf(g5,plain,
    ( ~ sPE(x,x)
    | ~ sPE(x,x)
    | ~ sPE(divide(x,x),zero)
    | ~ quotient(x,x,divide(x,x))
    | quotient(x,x,zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(zero,divide(x,x))
    | sPE(divide(x,x),zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ sPE(x,x)
    | ~ sPE(x,x)
    | sPE(divide(x,x),divide(x,x)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ less_equal(zero,x)
    | quotient(zero,x,zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).

cnf(g9,plain,
    ( ~ quotient(divide(x,x),zero,zero)
    | less_equal(divide(x,x),zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).

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

cnf(g11,plain,
    less_equal(zero,divide(x,x)),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).

cnf(g12,plain,
    quotient(zero,x,divide(zero,x)),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).

cnf(g13,plain,
    quotient(x,zero,divide(x,zero)),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).

cnf(g14,plain,
    ( ~ quotient(zero,x,divide(zero,x))
    | ~ quotient(zero,x,zero)
    | sPE(divide(zero,x),zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',well_defined)]) ).

cnf(g15,plain,
    ( ~ less_equal(divide(x,zero),x)
    | quotient(divide(x,zero),x,zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).

cnf(g16,plain,
    ( ~ quotient(x,zero,divide(x,zero))
    | less_equal(divide(x,zero),x) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',divisor_existence)]) ).

cnf(g17,plain,
    quotient(divide(x,x),divide(zero,x),divide(divide(x,x),divide(zero,x))),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).

cnf(g18,plain,
    ( ~ less_equal(divide(divide(x,x),divide(zero,x)),zero)
    | ~ less_equal(zero,divide(divide(x,x),divide(zero,x)))
    | sPE(divide(divide(x,x),divide(zero,x)),zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).

cnf(g19,plain,
    ( ~ quotient(x,zero,divide(x,zero))
    | ~ quotient(x,x,divide(x,x))
    | ~ quotient(zero,x,divide(zero,x))
    | ~ quotient(divide(x,zero),x,zero)
    | ~ quotient(divide(x,x),divide(zero,x),divide(divide(x,x),divide(zero,x)))
    | less_equal(divide(divide(x,x),divide(zero,x)),zero) ),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_property)]) ).

cnf(g20,plain,
    less_equal(zero,divide(divide(x,x),divide(zero,x))),
    inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).

cnf(g21,plain,
    ( ~ sPE(divide(x,x),divide(x,x))
    | ~ sPE(divide(zero,x),zero)
    | ~ sPE(divide(divide(x,x),divide(zero,x)),zero)
    | ~ quotient(divide(x,x),divide(zero,x),divide(divide(x,x),divide(zero,x)))
    | quotient(divide(x,x),zero,zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : HEN012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.12/0.31  % Computer : n009.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  1 12:53:37 EDT 2022
% 0.12/0.31  % CPUTime  : 
% 8.57/1.39  % symbols: 8
% 8.57/1.39  % clauses: 16
% 8.57/1.39  % start clauses: 1
% 8.57/1.39  % iterative deepening steps: 831
% 8.57/1.39  % maximum path limit: 8
% 8.57/1.39  % literal attempts: 1192327
% 8.57/1.39  % depth failures: 657566
% 8.57/1.39  % regularity failures: 65112
% 8.57/1.39  % tautology failures: 71210
% 8.57/1.39  % reductions: 0
% 8.57/1.39  % extensions: 1191701
% 8.57/1.39  % SAT variables: 22376
% 8.57/1.39  % SAT clauses: 77613
% 8.57/1.39  % WalkSAT solutions: 77610
% 8.57/1.39  % CDCL solutions: 2
% 8.57/1.39  % SZS status Unsatisfiable for theBenchmark
% 8.57/1.39  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------