%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n003.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 : Mon Jul 18 13:33:59 EDT 2022

% Result   : Unsatisfiable 0.92s 1.08s
% Output   : Refutation 0.92s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
cnf(b_greater_equal_a,plain,
    ~ less(b,a),
    input ).

cnf(smaller_number,axiom,
    ( ~ equalish(add(successor(X37),X36),X38)
    | less(X36,X38) ),
    input ).

cnf(transitivity,axiom,
    ( ~ equalish(X56,X55)
    | ~ equalish(X55,X54)
    | equalish(X56,X54) ),
    input ).

cnf(b_less_than_c,plain,
    less(b,c),
    input ).

cnf(transitivity_of_less,axiom,
    ( ~ less(X33,X32)
    | ~ less(X34,X33)
    | less(X34,X32) ),
    input ).

cnf(c23,plain,
    ( ~ less(c,X35)
    | less(b,X35) ),
    inference(resolution,status(thm),[transitivity_of_less,b_less_than_c]) ).

cnf(impossible_c_divides_a,negated_conjecture,
    divides(c,a),
    input ).

cnf(divides_only_less_or_equal,axiom,
    ( ~ divides(X52,X51)
    | less(X52,X51)
    | equalish(X52,X51) ),
    input ).

cnf(c42,plain,
    ( less(c,a)
    | equalish(c,a) ),
    inference(resolution,status(thm),[divides_only_less_or_equal,impossible_c_divides_a]) ).

cnf(c77,plain,
    ( equalish(c,a)
    | less(b,a) ),
    inference(resolution,status(thm),[c42,c23]) ).

cnf(c114,plain,
    equalish(c,a),
    inference(resolution,status(thm),[c77,b_greater_equal_a]) ).

cnf(c116,plain,
    ( ~ equalish(X90,c)
    | equalish(X90,a) ),
    inference(resolution,status(thm),[c114,transitivity]) ).

cnf(less_lemma,axiom,
    ( ~ less(X48,X47)
    | equalish(add(successor(predecessor_of_1st_minus_2nd(X47,X48)),X48),X47) ),
    input ).

cnf(c35,plain,
    equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),c),
    inference(resolution,status(thm),[less_lemma,b_less_than_c]) ).

cnf(c221,plain,
    equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),a),
    inference(resolution,status(thm),[c35,c116]) ).

cnf(c722,plain,
    less(b,a),
    inference(resolution,status(thm),[c221,smaller_number]) ).

cnf(c727,plain,
    $false,
    inference(resolution,status(thm),[c722,b_greater_equal_a]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n003.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 : Tue Jul  5 20:04:26 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.92/1.08  # Version:  1.3
% 0.92/1.08  # SZS status Unsatisfiable
% 0.92/1.08  # SZS output start CNFRefutation
% See solution above
% 0.92/1.08  
% 0.92/1.08  # Initial clauses    : 19
% 0.92/1.08  # Processed clauses  : 193
% 0.92/1.08  # Factors computed   : 0
% 0.92/1.08  # Resolvents computed: 736
% 0.92/1.08  # Tautologies deleted: 1
% 0.92/1.08  # Forward subsumed   : 196
% 0.92/1.08  # Backward subsumed  : 2
% 0.92/1.08  # -------- CPU Time ---------
% 0.92/1.08  # User time          : 0.713 s
% 0.92/1.08  # System time        : 0.020 s
% 0.92/1.08  # Total time         : 0.733 s
%------------------------------------------------------------------------------