TSTP Solution File: FLD065-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : FLD065-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.6cWQ58HPL9 true
% Computer : n006.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 : Wed Aug 30 22:39:35 EDT 2023
% Result : Unsatisfiable 1.34s 1.32s
% Output : Refutation 1.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : FLD065-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.14 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.6cWQ58HPL9 true
% 0.13/0.35 % Computer : n006.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 : Mon Aug 28 00:42:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.36 % Python version: Python 3.6.8
% 0.13/0.36 % Running in FO mode
% 0.21/0.64 % Total configuration time : 435
% 0.21/0.64 % Estimated wc time : 1092
% 0.21/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.73 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.73 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.76 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.76 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.77 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.79 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 1.34/1.32 % Solved by fo/fo13.sh.
% 1.34/1.32 % done 596 iterations in 0.538s
% 1.34/1.32 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.34/1.32 % SZS output start Refutation
% 1.34/1.32 thf(defined_type, type, defined: $i > $o).
% 1.34/1.32 thf(additive_identity_type, type, additive_identity: $i).
% 1.34/1.32 thf(add_type, type, add: $i > $i > $i).
% 1.34/1.32 thf(less_or_equal_type, type, less_or_equal: $i > $i > $o).
% 1.34/1.32 thf(equalish_type, type, equalish: $i > $i > $o).
% 1.34/1.32 thf(a_type, type, a: $i).
% 1.34/1.32 thf(additive_inverse_type, type, additive_inverse: $i > $i).
% 1.34/1.32 thf(not_less_or_equal_3, conjecture, (less_or_equal @ additive_identity @ a)).
% 1.34/1.32 thf(zf_stmt_0, negated_conjecture,
% 1.34/1.32 (~( less_or_equal @ additive_identity @ a )),
% 1.34/1.32 inference('cnf.neg', [status(esa)], [not_less_or_equal_3])).
% 1.34/1.32 thf(zip_derived_cl29, plain, (~ (less_or_equal @ additive_identity @ a)),
% 1.34/1.32 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.34/1.32 thf(well_definedness_of_additive_inverse, axiom,
% 1.34/1.32 (( defined @ ( additive_inverse @ X ) ) | ( ~( defined @ X ) ))).
% 1.34/1.32 thf(zip_derived_cl11, plain,
% 1.34/1.32 (![X0 : $i]: ( (defined @ (additive_inverse @ X0)) | ~ (defined @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)], [well_definedness_of_additive_inverse])).
% 1.34/1.32 thf(totality_of_order_relation, axiom,
% 1.34/1.32 (( less_or_equal @ X @ Y ) | ( less_or_equal @ Y @ X ) |
% 1.34/1.32 ( ~( defined @ X ) ) | ( ~( defined @ Y ) ))).
% 1.34/1.32 thf(zip_derived_cl17, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i]:
% 1.34/1.32 ( (less_or_equal @ X0 @ X1)
% 1.34/1.32 | (less_or_equal @ X1 @ X0)
% 1.34/1.32 | ~ (defined @ X0)
% 1.34/1.32 | ~ (defined @ X1))),
% 1.34/1.32 inference('cnf', [status(esa)], [totality_of_order_relation])).
% 1.34/1.32 thf(zip_derived_cl58, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 (~ (defined @ X0) | ~ (defined @ X0) | (less_or_equal @ X0 @ X0))),
% 1.34/1.32 inference('eq_fact', [status(thm)], [zip_derived_cl17])).
% 1.34/1.32 thf(zip_derived_cl60, plain,
% 1.34/1.32 (![X0 : $i]: ( (less_or_equal @ X0 @ X0) | ~ (defined @ X0))),
% 1.34/1.32 inference('simplify', [status(thm)], [zip_derived_cl58])).
% 1.34/1.32 thf(existence_of_identity_addition, axiom,
% 1.34/1.32 (( equalish @ ( add @ additive_identity @ X ) @ X ) | ( ~( defined @ X ) ))).
% 1.34/1.32 thf(zip_derived_cl1, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (equalish @ (add @ additive_identity @ X0) @ X0) | ~ (defined @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)], [existence_of_identity_addition])).
% 1.34/1.32 thf(symmetry_of_equality, axiom,
% 1.34/1.32 (( equalish @ X @ Y ) | ( ~( equalish @ Y @ X ) ))).
% 1.34/1.32 thf(zip_derived_cl21, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)], [symmetry_of_equality])).
% 1.34/1.32 thf(zip_derived_cl31, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 (~ (defined @ X0) | (equalish @ X0 @ (add @ additive_identity @ X0)))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl1, zip_derived_cl21])).
% 1.34/1.32 thf(compatibility_of_equality_and_order_relation, axiom,
% 1.34/1.32 (( less_or_equal @ Y @ Z ) | ( ~( less_or_equal @ X @ Z ) ) |
% 1.34/1.32 ( ~( equalish @ X @ Y ) ))).
% 1.34/1.32 thf(zip_derived_cl25, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.34/1.32 ( (less_or_equal @ X0 @ X1)
% 1.34/1.32 | ~ (less_or_equal @ X2 @ X1)
% 1.34/1.32 | ~ (equalish @ X2 @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)],
% 1.34/1.32 [compatibility_of_equality_and_order_relation])).
% 1.34/1.32 thf(zip_derived_cl45, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i]:
% 1.34/1.32 (~ (defined @ X0)
% 1.34/1.32 | (less_or_equal @ (add @ additive_identity @ X0) @ X1)
% 1.34/1.32 | ~ (less_or_equal @ X0 @ X1))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl31, zip_derived_cl25])).
% 1.34/1.32 thf(zip_derived_cl619, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 (~ (defined @ X0)
% 1.34/1.32 | ~ (defined @ X0)
% 1.34/1.32 | (less_or_equal @ (add @ additive_identity @ X0) @ X0))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl60, zip_derived_cl45])).
% 1.34/1.32 thf(zip_derived_cl641, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (less_or_equal @ (add @ additive_identity @ X0) @ X0)
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('simplify', [status(thm)], [zip_derived_cl619])).
% 1.34/1.32 thf(less_or_equal_2, conjecture,
% 1.34/1.32 (~( less_or_equal @ ( additive_inverse @ a ) @ additive_identity ))).
% 1.34/1.32 thf(zf_stmt_1, negated_conjecture,
% 1.34/1.32 (less_or_equal @ ( additive_inverse @ a ) @ additive_identity),
% 1.34/1.32 inference('cnf.neg', [status(esa)], [less_or_equal_2])).
% 1.34/1.32 thf(zip_derived_cl28, plain,
% 1.34/1.32 ( (less_or_equal @ (additive_inverse @ a) @ additive_identity)),
% 1.34/1.32 inference('cnf', [status(esa)], [zf_stmt_1])).
% 1.34/1.32 thf(compatibility_of_order_relation_and_addition, axiom,
% 1.34/1.32 (( less_or_equal @ ( add @ X @ Z ) @ ( add @ Y @ Z ) ) |
% 1.34/1.32 ( ~( defined @ Z ) ) | ( ~( less_or_equal @ X @ Y ) ))).
% 1.34/1.32 thf(zip_derived_cl18, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.34/1.32 ( (less_or_equal @ (add @ X0 @ X1) @ (add @ X2 @ X1))
% 1.34/1.32 | ~ (defined @ X1)
% 1.34/1.32 | ~ (less_or_equal @ X0 @ X2))),
% 1.34/1.32 inference('cnf', [status(esa)],
% 1.34/1.32 [compatibility_of_order_relation_and_addition])).
% 1.34/1.32 thf(zip_derived_cl132, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (less_or_equal @ (add @ (additive_inverse @ a) @ X0) @
% 1.34/1.32 (add @ additive_identity @ X0))
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl28, zip_derived_cl18])).
% 1.34/1.32 thf(transitivity_of_order_relation, axiom,
% 1.34/1.32 (( less_or_equal @ X @ Z ) | ( ~( less_or_equal @ X @ Y ) ) |
% 1.34/1.32 ( ~( less_or_equal @ Y @ Z ) ))).
% 1.34/1.32 thf(zip_derived_cl16, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.34/1.32 ( (less_or_equal @ X0 @ X1)
% 1.34/1.32 | ~ (less_or_equal @ X0 @ X2)
% 1.34/1.32 | ~ (less_or_equal @ X2 @ X1))),
% 1.34/1.32 inference('cnf', [status(esa)], [transitivity_of_order_relation])).
% 1.34/1.32 thf(zip_derived_cl145, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i]:
% 1.34/1.32 (~ (defined @ X0)
% 1.34/1.32 | (less_or_equal @ (add @ (additive_inverse @ a) @ X0) @ X1)
% 1.34/1.32 | ~ (less_or_equal @ (add @ additive_identity @ X0) @ X1))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl132, zip_derived_cl16])).
% 1.34/1.32 thf(zip_derived_cl1926, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 (~ (defined @ X0)
% 1.34/1.32 | ~ (defined @ X0)
% 1.34/1.32 | (less_or_equal @ (add @ (additive_inverse @ a) @ X0) @ X0))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl641, zip_derived_cl145])).
% 1.34/1.32 thf(zip_derived_cl1941, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (less_or_equal @ (add @ (additive_inverse @ a) @ X0) @ X0)
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('simplify', [status(thm)], [zip_derived_cl1926])).
% 1.34/1.32 thf(commutativity_addition, axiom,
% 1.34/1.32 (( equalish @ ( add @ X @ Y ) @ ( add @ Y @ X ) ) | ( ~( defined @ X ) ) |
% 1.34/1.32 ( ~( defined @ Y ) ))).
% 1.34/1.32 thf(zip_derived_cl3, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i]:
% 1.34/1.32 ( (equalish @ (add @ X0 @ X1) @ (add @ X1 @ X0))
% 1.34/1.32 | ~ (defined @ X0)
% 1.34/1.32 | ~ (defined @ X1))),
% 1.34/1.32 inference('cnf', [status(esa)], [commutativity_addition])).
% 1.34/1.32 thf(zip_derived_cl25, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.34/1.32 ( (less_or_equal @ X0 @ X1)
% 1.34/1.32 | ~ (less_or_equal @ X2 @ X1)
% 1.34/1.32 | ~ (equalish @ X2 @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)],
% 1.34/1.32 [compatibility_of_equality_and_order_relation])).
% 1.34/1.32 thf(zip_derived_cl80, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.34/1.32 (~ (defined @ X1)
% 1.34/1.32 | ~ (defined @ X0)
% 1.34/1.32 | (less_or_equal @ (add @ X1 @ X0) @ X2)
% 1.34/1.32 | ~ (less_or_equal @ (add @ X0 @ X1) @ X2))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl3, zip_derived_cl25])).
% 1.34/1.32 thf(zip_derived_cl1953, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 (~ (defined @ X0)
% 1.34/1.32 | ~ (defined @ X0)
% 1.34/1.32 | ~ (defined @ (additive_inverse @ a))
% 1.34/1.32 | (less_or_equal @ (add @ X0 @ (additive_inverse @ a)) @ X0))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl1941, zip_derived_cl80])).
% 1.34/1.32 thf(zip_derived_cl1957, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (less_or_equal @ (add @ X0 @ (additive_inverse @ a)) @ X0)
% 1.34/1.32 | ~ (defined @ (additive_inverse @ a))
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('simplify', [status(thm)], [zip_derived_cl1953])).
% 1.34/1.32 thf(zip_derived_cl4174, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 (~ (defined @ a)
% 1.34/1.32 | (less_or_equal @ (add @ X0 @ (additive_inverse @ a)) @ X0)
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl11, zip_derived_cl1957])).
% 1.34/1.32 thf(a_is_defined, axiom, (defined @ a)).
% 1.34/1.32 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 1.34/1.32 inference('cnf', [status(esa)], [a_is_defined])).
% 1.34/1.32 thf(zip_derived_cl4175, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (less_or_equal @ (add @ X0 @ (additive_inverse @ a)) @ X0)
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('demod', [status(thm)], [zip_derived_cl4174, zip_derived_cl27])).
% 1.34/1.32 thf(existence_of_inverse_addition, axiom,
% 1.34/1.32 (( equalish @ ( add @ X @ ( additive_inverse @ X ) ) @ additive_identity ) |
% 1.34/1.32 ( ~( defined @ X ) ))).
% 1.34/1.32 thf(zip_derived_cl2, plain,
% 1.34/1.32 (![X0 : $i]:
% 1.34/1.32 ( (equalish @ (add @ X0 @ (additive_inverse @ X0)) @ additive_identity)
% 1.34/1.32 | ~ (defined @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)], [existence_of_inverse_addition])).
% 1.34/1.32 thf(zip_derived_cl25, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.34/1.32 ( (less_or_equal @ X0 @ X1)
% 1.34/1.32 | ~ (less_or_equal @ X2 @ X1)
% 1.34/1.32 | ~ (equalish @ X2 @ X0))),
% 1.34/1.32 inference('cnf', [status(esa)],
% 1.34/1.32 [compatibility_of_equality_and_order_relation])).
% 1.34/1.32 thf(zip_derived_cl48, plain,
% 1.34/1.32 (![X0 : $i, X1 : $i]:
% 1.34/1.32 (~ (defined @ X0)
% 1.34/1.32 | (less_or_equal @ additive_identity @ X1)
% 1.34/1.32 | ~ (less_or_equal @ (add @ X0 @ (additive_inverse @ X0)) @ X1))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl2, zip_derived_cl25])).
% 1.34/1.32 thf(zip_derived_cl4185, plain,
% 1.34/1.32 ((~ (defined @ a)
% 1.34/1.32 | ~ (defined @ a)
% 1.34/1.32 | (less_or_equal @ additive_identity @ a))),
% 1.34/1.32 inference('s_sup-', [status(thm)], [zip_derived_cl4175, zip_derived_cl48])).
% 1.34/1.32 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 1.34/1.32 inference('cnf', [status(esa)], [a_is_defined])).
% 1.34/1.32 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 1.34/1.32 inference('cnf', [status(esa)], [a_is_defined])).
% 1.34/1.32 thf(zip_derived_cl4190, plain, ( (less_or_equal @ additive_identity @ a)),
% 1.34/1.32 inference('demod', [status(thm)],
% 1.34/1.32 [zip_derived_cl4185, zip_derived_cl27, zip_derived_cl27])).
% 1.34/1.32 thf(zip_derived_cl4193, plain, ($false),
% 1.34/1.32 inference('demod', [status(thm)], [zip_derived_cl29, zip_derived_cl4190])).
% 1.34/1.32
% 1.34/1.32 % SZS output end Refutation
% 1.34/1.32
% 1.34/1.32
% 1.34/1.32 % Terminating...
% 1.34/1.42 % Runner terminated.
% 1.34/1.44 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------