TSTP Solution File: NUM024-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM024-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.W75Vj1ruoz true
% Computer : n008.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:01 EDT 2023
% Result : Unsatisfiable 2.49s 0.99s
% Output : Refutation 2.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.15 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.W75Vj1ruoz true
% 0.16/0.36 % Computer : n008.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri Aug 25 12:00:32 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.16/0.36 % Running portfolio for 300 s
% 0.16/0.36 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.36 % Number of cores: 8
% 0.16/0.37 % Python version: Python 3.6.8
% 0.16/0.37 % Running in FO mode
% 0.23/0.64 % Total configuration time : 435
% 0.23/0.64 % Estimated wc time : 1092
% 0.23/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.23/0.72 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.23/0.74 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.23/0.77 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.23/0.77 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.23/0.78 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.23/0.78 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.23/0.78 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 2.49/0.99 % Solved by fo/fo3_bce.sh.
% 2.49/0.99 % BCE start: 16
% 2.49/0.99 % BCE eliminated: 0
% 2.49/0.99 % PE start: 16
% 2.49/0.99 logic: neq
% 2.49/0.99 % PE eliminated: 0
% 2.49/0.99 % done 470 iterations in 0.227s
% 2.49/0.99 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 2.49/0.99 % SZS output start Refutation
% 2.49/0.99 thf(n0_type, type, n0: $i).
% 2.49/0.99 thf(successor_type, type, successor: $i > $i).
% 2.49/0.99 thf(add_type, type, add: $i > $i > $i).
% 2.49/0.99 thf(predecessor_of_1st_minus_2nd_type, type, predecessor_of_1st_minus_2nd:
% 2.49/0.99 $i > $i > $i).
% 2.49/0.99 thf(equalish_type, type, equalish: $i > $i > $o).
% 2.49/0.99 thf(less_type, type, less: $i > $i > $o).
% 2.49/0.99 thf(a_type, type, a: $i).
% 2.49/0.99 thf(adding_zero, axiom, (equalish @ ( add @ A @ n0 ) @ A)).
% 2.49/0.99 thf(zip_derived_cl0, plain, (![X0 : $i]: (equalish @ (add @ X0 @ n0) @ X0)),
% 2.49/0.99 inference('cnf', [status(esa)], [adding_zero])).
% 2.49/0.99 thf(symmetry, axiom, (( ~( equalish @ X @ Y ) ) | ( equalish @ Y @ X ))).
% 2.49/0.99 thf(zip_derived_cl10, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]: (~ (equalish @ X0 @ X1) | (equalish @ X1 @ X0))),
% 2.49/0.99 inference('cnf', [status(esa)], [symmetry])).
% 2.49/0.99 thf(zip_derived_cl19, plain,
% 2.49/0.99 (![X0 : $i]: (equalish @ X0 @ (add @ X0 @ n0))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl0, zip_derived_cl10])).
% 2.49/0.99 thf(transitivity, axiom,
% 2.49/0.99 (( ~( equalish @ X @ Y ) ) | ( ~( equalish @ Y @ Z ) ) |
% 2.49/0.99 ( equalish @ X @ Z ))).
% 2.49/0.99 thf(zip_derived_cl11, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i, X2 : $i]:
% 2.49/0.99 (~ (equalish @ X0 @ X1)
% 2.49/0.99 | ~ (equalish @ X1 @ X2)
% 2.49/0.99 | (equalish @ X0 @ X2))),
% 2.49/0.99 inference('cnf', [status(esa)], [transitivity])).
% 2.49/0.99 thf(zip_derived_cl68, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]:
% 2.49/0.99 ( (equalish @ X0 @ X1) | ~ (equalish @ (add @ X0 @ n0) @ X1))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl19, zip_derived_cl11])).
% 2.49/0.99 thf(commutativity_of_plus, axiom,
% 2.49/0.99 (equalish @ ( add @ A @ B ) @ ( add @ B @ A ))).
% 2.49/0.99 thf(zip_derived_cl13, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]: (equalish @ (add @ X0 @ X1) @ (add @ X1 @ X0))),
% 2.49/0.99 inference('cnf', [status(esa)], [commutativity_of_plus])).
% 2.49/0.99 thf(zip_derived_cl77, plain,
% 2.49/0.99 (![X0 : $i]: (equalish @ X0 @ (add @ n0 @ X0))),
% 2.49/0.99 inference('sup+', [status(thm)], [zip_derived_cl68, zip_derived_cl13])).
% 2.49/0.99 thf(less_lemma, axiom,
% 2.49/0.99 (( ~( less @ A @ B ) ) |
% 2.49/0.99 ( equalish @
% 2.49/0.99 ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @
% 2.49/0.99 B ))).
% 2.49/0.99 thf(zip_derived_cl8, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]:
% 2.49/0.99 (~ (less @ X0 @ X1)
% 2.49/0.99 | (equalish @
% 2.49/0.99 (add @ (successor @ (predecessor_of_1st_minus_2nd @ X1 @ X0)) @
% 2.49/0.99 X0) @
% 2.49/0.99 X1))),
% 2.49/0.99 inference('cnf', [status(esa)], [less_lemma])).
% 2.49/0.99 thf(zip_derived_cl11, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i, X2 : $i]:
% 2.49/0.99 (~ (equalish @ X0 @ X1)
% 2.49/0.99 | ~ (equalish @ X1 @ X2)
% 2.49/0.99 | (equalish @ X0 @ X2))),
% 2.49/0.99 inference('cnf', [status(esa)], [transitivity])).
% 2.49/0.99 thf(zip_derived_cl52, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i, X2 : $i]:
% 2.49/0.99 (~ (less @ X1 @ X0)
% 2.49/0.99 | (equalish @
% 2.49/0.99 (add @ (successor @ (predecessor_of_1st_minus_2nd @ X0 @ X1)) @
% 2.49/0.99 X1) @
% 2.49/0.99 X2)
% 2.49/0.99 | ~ (equalish @ X0 @ X2))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl8, zip_derived_cl11])).
% 2.49/0.99 thf(smaller_number, axiom,
% 2.49/0.99 (( ~( equalish @ ( add @ ( successor @ A ) @ B ) @ C ) ) | ( less @ B @ C ))).
% 2.49/0.99 thf(zip_derived_cl7, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i, X2 : $i]:
% 2.49/0.99 (~ (equalish @ (add @ (successor @ X0) @ X1) @ X2) | (less @ X1 @ X2))),
% 2.49/0.99 inference('cnf', [status(esa)], [smaller_number])).
% 2.49/0.99 thf(zip_derived_cl436, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i, X2 : $i]:
% 2.49/0.99 (~ (equalish @ X2 @ X0) | ~ (less @ X1 @ X2) | (less @ X1 @ X0))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl52, zip_derived_cl7])).
% 2.49/0.99 thf(zip_derived_cl459, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]:
% 2.49/0.99 ( (less @ X1 @ (add @ n0 @ X0)) | ~ (less @ X1 @ X0))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl77, zip_derived_cl436])).
% 2.49/0.99 thf(zip_derived_cl8, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]:
% 2.49/0.99 (~ (less @ X0 @ X1)
% 2.49/0.99 | (equalish @
% 2.49/0.99 (add @ (successor @ (predecessor_of_1st_minus_2nd @ X1 @ X0)) @
% 2.49/0.99 X0) @
% 2.49/0.99 X1))),
% 2.49/0.99 inference('cnf', [status(esa)], [less_lemma])).
% 2.49/0.99 thf(plus_substitution, axiom,
% 2.49/0.99 (( ~( equalish @ ( add @ A @ B ) @ ( add @ C @ B ) ) ) |
% 2.49/0.99 ( equalish @ A @ C ))).
% 2.49/0.99 thf(zip_derived_cl12, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i, X2 : $i]:
% 2.49/0.99 (~ (equalish @ (add @ X0 @ X1) @ (add @ X2 @ X1))
% 2.49/0.99 | (equalish @ X0 @ X2))),
% 2.49/0.99 inference('cnf', [status(esa)], [plus_substitution])).
% 2.49/0.99 thf(zip_derived_cl54, plain,
% 2.49/0.99 (![X0 : $i, X1 : $i]:
% 2.49/0.99 (~ (less @ X0 @ (add @ X1 @ X0))
% 2.49/0.99 | (equalish @
% 2.49/0.99 (successor @
% 2.49/0.99 (predecessor_of_1st_minus_2nd @ (add @ X1 @ X0) @ X0)) @
% 2.49/0.99 X1))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl8, zip_derived_cl12])).
% 2.49/0.99 thf(prove_a_contradiction, conjecture, (equalish @ ( successor @ A ) @ n0)).
% 2.49/0.99 thf(zf_stmt_0, negated_conjecture, (~( equalish @ ( successor @ A ) @ n0 )),
% 2.49/0.99 inference('cnf.neg', [status(esa)], [prove_a_contradiction])).
% 2.49/0.99 thf(zip_derived_cl15, plain,
% 2.49/0.99 (![X0 : $i]: ~ (equalish @ (successor @ X0) @ n0)),
% 2.49/0.99 inference('cnf', [status(esa)], [zf_stmt_0])).
% 2.49/0.99 thf(zip_derived_cl498, plain, (![X0 : $i]: ~ (less @ X0 @ (add @ n0 @ X0))),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl54, zip_derived_cl15])).
% 2.49/0.99 thf(zip_derived_cl1723, plain, (![X0 : $i]: ~ (less @ X0 @ X0)),
% 2.49/0.99 inference('sup-', [status(thm)], [zip_derived_cl459, zip_derived_cl498])).
% 2.49/0.99 thf(impossible_a_is_less_than_itself, axiom, (less @ a @ a)).
% 2.49/0.99 thf(zip_derived_cl14, plain, ( (less @ a @ a)),
% 2.49/0.99 inference('cnf', [status(esa)], [impossible_a_is_less_than_itself])).
% 2.49/0.99 thf(zip_derived_cl1731, plain, ($false),
% 2.49/0.99 inference('sup+', [status(thm)], [zip_derived_cl1723, zip_derived_cl14])).
% 2.49/0.99
% 2.49/0.99 % SZS output end Refutation
% 2.49/0.99
% 2.49/0.99
% 2.49/0.99 % Terminating...
% 3.06/1.06 % Runner terminated.
% 3.06/1.07 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------