TSTP Solution File: NUM021-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.NT3zVIiS0o true
% Computer : n012.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 Aug 31 12:39:00 EDT 2023
% Result : Unsatisfiable 1.30s 0.97s
% Output : Refutation 1.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.NT3zVIiS0o true
% 0.13/0.35 % Computer : n012.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 : 300
% 0.13/0.35 % DateTime : Fri Aug 25 10:10:41 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.36 % Running in FO mode
% 0.21/0.65 % Total configuration time : 435
% 0.21/0.65 % Estimated wc time : 1092
% 0.21/0.65 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.73 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.74 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 1.07/0.76 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 1.07/0.76 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 1.07/0.77 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.07/0.78 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.30/0.97 % Solved by fo/fo6_bce.sh.
% 1.30/0.97 % BCE start: 19
% 1.30/0.97 % BCE eliminated: 0
% 1.30/0.97 % PE start: 19
% 1.30/0.97 logic: neq
% 1.30/0.97 % PE eliminated: 3
% 1.30/0.97 % done 315 iterations in 0.236s
% 1.30/0.97 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.30/0.97 % SZS output start Refutation
% 1.30/0.97 thf(successor_type, type, successor: $i > $i).
% 1.30/0.97 thf(add_type, type, add: $i > $i > $i).
% 1.30/0.97 thf(divides_type, type, divides: $i > $i > $o).
% 1.30/0.97 thf(predecessor_of_1st_minus_2nd_type, type, predecessor_of_1st_minus_2nd:
% 1.30/0.97 $i > $i > $i).
% 1.30/0.97 thf(a_type, type, a: $i).
% 1.30/0.97 thf(equalish_type, type, equalish: $i > $i > $o).
% 1.30/0.97 thf(less_type, type, less: $i > $i > $o).
% 1.30/0.97 thf(b_type, type, b: $i).
% 1.30/0.97 thf(c_type, type, c: $i).
% 1.30/0.97 thf(less_lemma, axiom,
% 1.30/0.97 (( ~( less @ A @ B ) ) |
% 1.30/0.97 ( equalish @
% 1.30/0.97 ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @
% 1.30/0.97 B ))).
% 1.30/0.97 thf(zip_derived_cl8, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i]:
% 1.30/0.97 (~ (less @ X0 @ X1)
% 1.30/0.97 | (equalish @
% 1.30/0.97 (add @ (successor @ (predecessor_of_1st_minus_2nd @ X1 @ X0)) @
% 1.30/0.97 X0) @
% 1.30/0.97 X1))),
% 1.30/0.97 inference('cnf', [status(esa)], [less_lemma])).
% 1.30/0.97 thf(impossible_c_divides_a, conjecture, (~( divides @ c @ a ))).
% 1.30/0.97 thf(zf_stmt_0, negated_conjecture, (divides @ c @ a),
% 1.30/0.97 inference('cnf.neg', [status(esa)], [impossible_c_divides_a])).
% 1.30/0.97 thf(zip_derived_cl17, plain, ( (divides @ c @ a)),
% 1.30/0.97 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.30/0.97 thf(divides_only_less_or_equal, axiom,
% 1.30/0.97 (( ~( divides @ A @ B ) ) | ( less @ A @ B ) | ( equalish @ A @ B ))).
% 1.30/0.97 thf(zip_derived_cl9, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i]:
% 1.30/0.97 (~ (divides @ X0 @ X1) | (less @ X0 @ X1) | (equalish @ X0 @ X1))),
% 1.30/0.97 inference('cnf', [status(esa)], [divides_only_less_or_equal])).
% 1.30/0.97 thf(zip_derived_cl21, plain, (( (equalish @ c @ a) | (less @ c @ a))),
% 1.30/0.97 inference('dp-resolution', [status(thm)],
% 1.30/0.97 [zip_derived_cl17, zip_derived_cl9])).
% 1.30/0.97 thf(transitivity_of_less, axiom,
% 1.30/0.97 (( ~( less @ A @ B ) ) | ( ~( less @ C @ A ) ) | ( less @ C @ B ))).
% 1.30/0.97 thf(zip_derived_cl6, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.30/0.97 (~ (less @ X0 @ X1) | ~ (less @ X2 @ X0) | (less @ X2 @ X1))),
% 1.30/0.97 inference('cnf', [status(esa)], [transitivity_of_less])).
% 1.30/0.97 thf(zip_derived_cl28, plain,
% 1.30/0.97 (![X0 : $i]: ( (equalish @ c @ a) | ~ (less @ X0 @ c) | (less @ X0 @ a))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl21, zip_derived_cl6])).
% 1.30/0.97 thf(b_greater_equal_a, axiom, (~( less @ b @ a ))).
% 1.30/0.97 thf(zip_derived_cl16, plain, (~ (less @ b @ a)),
% 1.30/0.97 inference('cnf', [status(esa)], [b_greater_equal_a])).
% 1.30/0.97 thf(zip_derived_cl64, plain, ((~ (less @ b @ c) | (equalish @ c @ a))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl28, zip_derived_cl16])).
% 1.30/0.97 thf(b_less_than_c, axiom, (less @ b @ c)).
% 1.30/0.97 thf(zip_derived_cl15, plain, ( (less @ b @ c)),
% 1.30/0.97 inference('cnf', [status(esa)], [b_less_than_c])).
% 1.30/0.97 thf(zip_derived_cl65, plain, ( (equalish @ c @ a)),
% 1.30/0.97 inference('demod', [status(thm)], [zip_derived_cl64, zip_derived_cl15])).
% 1.30/0.97 thf(successor_substitution, axiom,
% 1.30/0.97 (( ~( equalish @ A @ B ) ) |
% 1.30/0.97 ( equalish @ ( successor @ A ) @ ( successor @ B ) ))).
% 1.30/0.97 thf(zip_derived_cl5, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i]:
% 1.30/0.97 (~ (equalish @ X0 @ X1)
% 1.30/0.97 | (equalish @ (successor @ X0) @ (successor @ X1)))),
% 1.30/0.97 inference('cnf', [status(esa)], [successor_substitution])).
% 1.30/0.97 thf(zip_derived_cl5, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i]:
% 1.30/0.97 (~ (equalish @ X0 @ X1)
% 1.30/0.97 | (equalish @ (successor @ X0) @ (successor @ X1)))),
% 1.30/0.97 inference('cnf', [status(esa)], [successor_substitution])).
% 1.30/0.97 thf(transitivity, axiom,
% 1.30/0.97 (( ~( equalish @ X @ Y ) ) | ( ~( equalish @ Y @ Z ) ) |
% 1.30/0.97 ( equalish @ X @ Z ))).
% 1.30/0.97 thf(zip_derived_cl14, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.30/0.97 (~ (equalish @ X0 @ X1)
% 1.30/0.97 | ~ (equalish @ X1 @ X2)
% 1.30/0.97 | (equalish @ X0 @ X2))),
% 1.30/0.97 inference('cnf', [status(esa)], [transitivity])).
% 1.30/0.97 thf(zip_derived_cl42, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.30/0.97 (~ (equalish @ X1 @ X0)
% 1.30/0.97 | ~ (equalish @ (successor @ X0) @ X2)
% 1.30/0.97 | (equalish @ (successor @ X1) @ X2))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl5, zip_derived_cl14])).
% 1.30/0.97 thf(zip_derived_cl49, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.30/0.97 (~ (equalish @ X1 @ X0)
% 1.30/0.97 | ~ (equalish @ X2 @ X1)
% 1.30/0.97 | (equalish @ (successor @ X2) @ (successor @ X0)))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl5, zip_derived_cl42])).
% 1.30/0.97 thf(zip_derived_cl77, plain,
% 1.30/0.97 (![X0 : $i]:
% 1.30/0.97 (~ (equalish @ X0 @ c)
% 1.30/0.97 | (equalish @ (successor @ X0) @ (successor @ a)))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl65, zip_derived_cl49])).
% 1.30/0.97 thf(successor_equality1, axiom,
% 1.30/0.97 (( ~( equalish @ ( successor @ A ) @ ( successor @ B ) ) ) |
% 1.30/0.97 ( equalish @ A @ B ))).
% 1.30/0.97 thf(zip_derived_cl4, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i]:
% 1.30/0.97 (~ (equalish @ (successor @ X0) @ (successor @ X1))
% 1.30/0.97 | (equalish @ X0 @ X1))),
% 1.30/0.97 inference('cnf', [status(esa)], [successor_equality1])).
% 1.30/0.97 thf(zip_derived_cl88, plain,
% 1.30/0.97 (![X0 : $i]: (~ (equalish @ X0 @ c) | (equalish @ X0 @ a))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl77, zip_derived_cl4])).
% 1.30/0.97 thf(smaller_number, axiom,
% 1.30/0.97 (( ~( equalish @ ( add @ ( successor @ A ) @ B ) @ C ) ) | ( less @ B @ C ))).
% 1.30/0.97 thf(zip_derived_cl7, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.30/0.97 (~ (equalish @ (add @ (successor @ X0) @ X1) @ X2) | (less @ X1 @ X2))),
% 1.30/0.97 inference('cnf', [status(esa)], [smaller_number])).
% 1.30/0.97 thf(zip_derived_cl196, plain,
% 1.30/0.97 (![X0 : $i, X1 : $i]:
% 1.30/0.97 (~ (equalish @ (add @ (successor @ X1) @ X0) @ c) | (less @ X0 @ a))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl88, zip_derived_cl7])).
% 1.30/0.97 thf(zip_derived_cl1425, plain,
% 1.30/0.97 (![X0 : $i]: (~ (less @ X0 @ c) | (less @ X0 @ a))),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl8, zip_derived_cl196])).
% 1.30/0.97 thf(zip_derived_cl16, plain, (~ (less @ b @ a)),
% 1.30/0.97 inference('cnf', [status(esa)], [b_greater_equal_a])).
% 1.30/0.97 thf(zip_derived_cl1430, plain, (~ (less @ b @ c)),
% 1.30/0.97 inference('s_sup-', [status(thm)], [zip_derived_cl1425, zip_derived_cl16])).
% 1.30/0.97 thf(zip_derived_cl15, plain, ( (less @ b @ c)),
% 1.30/0.97 inference('cnf', [status(esa)], [b_less_than_c])).
% 1.30/0.97 thf(zip_derived_cl1431, plain, ($false),
% 1.30/0.97 inference('demod', [status(thm)], [zip_derived_cl1430, zip_derived_cl15])).
% 1.30/0.97
% 1.30/0.97 % SZS output end Refutation
% 1.30/0.97
% 1.30/0.97
% 1.30/0.97 % Terminating...
% 1.87/1.05 % Runner terminated.
% 1.87/1.07 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------