%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : NUM022-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n016.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 : 300s
% DateTime : Thu May 9 17:35:02 EDT 2024
% Result : Unsatisfiable 0.39s 0.56s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 8 unt; 3 nHn; 17 RR)
% Number of literals : 29 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_a_less_than_d,negated_conjecture,
~ less(a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_less_than_d) ).
cnf(smaller_number,axiom,
( ~ equalish(add(successor(X18),X17),X16)
| less(X17,X16) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
cnf(a_less_than_b,plain,
less(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_less_than_b) ).
cnf(transitivity_of_less,axiom,
( ~ less(X6,X5)
| ~ less(X4,X6)
| less(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
cnf(c2,plain,
( ~ less(b,X10)
| less(a,X10) ),
inference(resolution,[status(thm)],[transitivity_of_less,a_less_than_b]) ).
cnf(b_divides_d,plain,
divides(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_divides_d) ).
cnf(divides_only_less_or_equal,axiom,
( ~ divides(X12,X11)
| less(X12,X11)
| equalish(X12,X11) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-2.ax',divides_only_less_or_equal) ).
cnf(c3,plain,
( less(b,d)
| equalish(b,d) ),
inference(resolution,[status(thm)],[divides_only_less_or_equal,b_divides_d]) ).
cnf(c6,plain,
( equalish(b,d)
| less(a,d) ),
inference(resolution,[status(thm)],[c3,c2]) ).
cnf(c13,plain,
equalish(b,d),
inference(resolution,[status(thm)],[c6,prove_a_less_than_d]) ).
cnf(transitivity,axiom,
( ~ equalish(X15,X14)
| ~ equalish(X13,X15)
| equalish(X13,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
cnf(less_lemma,axiom,
( ~ less(X21,X20)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X20,X21)),X21),X20) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',less_lemma) ).
cnf(c18,plain,
equalish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),b),
inference(resolution,[status(thm)],[less_lemma,a_less_than_b]) ).
cnf(c20,plain,
( ~ equalish(b,X27)
| equalish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),X27) ),
inference(resolution,[status(thm)],[c18,transitivity]) ).
cnf(c23,plain,
equalish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),d),
inference(resolution,[status(thm)],[c20,c13]) ).
cnf(c24,plain,
less(a,d),
inference(resolution,[status(thm)],[c23,smaller_number]) ).
cnf(c29,plain,
$false,
inference(resolution,[status(thm)],[c24,prove_a_less_than_d]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM022-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Wed May 8 16:12:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.39/0.56 % Version: 1.5
% 0.39/0.56 % SZS status Unsatisfiable
% 0.39/0.56 % SZS output start CNFRefutation
% See solution above
% 0.39/0.56
% 0.39/0.56 % Initial clauses : 10
% 0.39/0.56 % Processed clauses : 21
% 0.39/0.56 % Factors computed : 2
% 0.39/0.56 % Resolvents computed: 29
% 0.39/0.56 % Tautologies deleted: 2
% 0.39/0.56 % Forward subsumed : 11
% 0.39/0.56 % Backward subsumed : 2
% 0.39/0.56 % -------- CPU Time ---------
% 0.39/0.56 % User time : 0.189 s
% 0.39/0.56 % System time : 0.015 s
% 0.39/0.56 % Total time : 0.205 s
%------------------------------------------------------------------------------