%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : FLD067-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n027.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 02:26:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    less_or_equal(a,b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4)]) ).

cnf(g1,plain,
    equalish(add(b,additive_inverse(a)),u),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_5)]) ).

cnf(g2,plain,
    ~ less_or_equal(additive_identity,u),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6)]) ).

cnf(g3,plain,
    ( ~ equalish(add(b,additive_inverse(a)),u)
    | equalish(u,add(b,additive_inverse(a))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).

cnf(g4,plain,
    defined(u),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined)]) ).

cnf(g5,plain,
    defined(a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined)]) ).

cnf(g6,plain,
    ( ~ defined(u)
    | ~ defined(u)
    | less_or_equal(u,u)
    | less_or_equal(u,u) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).

cnf(g7,plain,
    ( ~ defined(a)
    | equalish(add(a,additive_inverse(a)),additive_identity) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_addition)]) ).

cnf(g8,plain,
    ( ~ equalish(u,add(b,additive_inverse(a)))
    | ~ less_or_equal(u,u)
    | less_or_equal(add(b,additive_inverse(a)),u) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).

cnf(g9,plain,
    ( ~ defined(a)
    | defined(additive_inverse(a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_additive_inverse)]) ).

cnf(g10,plain,
    ( ~ defined(additive_inverse(a))
    | ~ less_or_equal(a,b)
    | less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).

cnf(g11,plain,
    ( ~ equalish(add(a,additive_inverse(a)),additive_identity)
    | ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
    | less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).

cnf(g12,plain,
    ( ~ less_or_equal(additive_identity,add(b,additive_inverse(a)))
    | ~ less_or_equal(add(b,additive_inverse(a)),u)
    | less_or_equal(additive_identity,u) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : FLD067-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jun  6 21:35:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.45  % symbols: 14
% 0.20/0.45  % clauses: 33
% 0.20/0.45  % start clauses: 3
% 0.20/0.45  % iterative deepening steps: 271
% 0.20/0.45  % maximum path limit: 3
% 0.20/0.45  % literal attempts: 122618
% 0.20/0.45  % depth failures: 80717
% 0.20/0.45  % regularity failures: 7331
% 0.20/0.45  % tautology failures: 15842
% 0.20/0.45  % reductions: 10055
% 0.20/0.45  % extensions: 111869
% 0.20/0.45  % SAT variables: 8108
% 0.20/0.45  % SAT clauses: 11815
% 0.20/0.45  % WalkSAT solutions: 11810
% 0.20/0.45  % CDCL solutions: 0
% 0.20/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.45  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------