%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : FLD003-1 : TPTP v9.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.wCYwnHBxP1 true
% Computer : n027.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 Oct 2 04:33:06 PM UTC 2025
% Result : Unsatisfiable 0.60s 1.05s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : FLD003-1 : TPTP v9.2.0. Bugfixed v2.1.0.
% 0.08/0.14 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.wCYwnHBxP1 true
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Oct 1 18:31:08 EDT 2025
% 0.14/0.37 % CPUTime :
% 0.14/0.37 % Running portfolio for 300 s
% 0.14/0.37 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % Number of cores: 8
% 0.14/0.37 % Python version: Python 3.6.8
% 0.14/0.37 % Running in FO mode
% 0.54/0.70 % Total configuration time : 435
% 0.54/0.70 % Estimated wc time : 1092
% 0.54/0.70 % Estimated cpu time (7 cpus) : 156.0
% 0.59/0.78 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.59/0.78 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.59/0.78 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.59/0.78 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.59/0.79 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.59/0.79 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.59/0.79 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.60/1.05 % Solved by fo/fo13.sh.
% 0.60/1.05 % done 287 iterations in 0.202s
% 0.60/1.05 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.60/1.05 % SZS output start Refutation
% 0.60/1.05 thf(defined_type, type, defined: $i > $o).
% 0.60/1.05 thf(additive_identity_type, type, additive_identity: $i).
% 0.60/1.05 thf(add_type, type, add: $i > $i > $i).
% 0.60/1.05 thf(b_type, type, b: $i).
% 0.60/1.05 thf(equalish_type, type, equalish: $i > $i > $o).
% 0.60/1.05 thf(a_type, type, a: $i).
% 0.60/1.05 thf(additive_inverse_type, type, additive_inverse: $i > $i).
% 0.60/1.05 thf(well_definedness_of_additive_inverse, axiom,
% 0.60/1.05 (( defined @ ( additive_inverse @ X ) ) | ( ~( defined @ X ) ))).
% 0.60/1.05 thf(zip_derived_cl11, plain,
% 0.60/1.05 (![X0 : $i]: ( (defined @ (additive_inverse @ X0)) | ~ (defined @ X0))),
% 0.60/1.05 inference('cnf', [status(esa)], [well_definedness_of_additive_inverse])).
% 0.60/1.05 thf(well_definedness_of_addition, axiom,
% 0.60/1.05 (( defined @ ( add @ X @ Y ) ) | ( ~( defined @ X ) ) |
% 0.60/1.05 ( ~( defined @ Y ) ))).
% 0.60/1.05 thf(zip_derived_cl9, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i]:
% 0.60/1.05 ( (defined @ (add @ X0 @ X1)) | ~ (defined @ X0) | ~ (defined @ X1))),
% 0.60/1.05 inference('cnf', [status(esa)], [well_definedness_of_addition])).
% 0.60/1.05 thf(existence_of_inverse_addition, axiom,
% 0.60/1.05 (( equalish @ ( add @ X @ ( additive_inverse @ X ) ) @ additive_identity ) |
% 0.60/1.05 ( ~( defined @ X ) ))).
% 0.60/1.05 thf(zip_derived_cl2, plain,
% 0.60/1.05 (![X0 : $i]:
% 0.60/1.05 ( (equalish @ (add @ X0 @ (additive_inverse @ X0)) @ additive_identity)
% 0.60/1.05 | ~ (defined @ X0))),
% 0.60/1.05 inference('cnf', [status(esa)], [existence_of_inverse_addition])).
% 0.60/1.05 thf(symmetry_of_equality, axiom,
% 0.60/1.05 (( equalish @ X @ Y ) | ( ~( equalish @ Y @ X ) ))).
% 0.60/1.05 thf(zip_derived_cl21, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 0.60/1.05 inference('cnf', [status(esa)], [symmetry_of_equality])).
% 0.60/1.05 thf(zip_derived_cl39, plain,
% 0.60/1.05 (![X0 : $i]:
% 0.60/1.05 (~ (defined @ X0)
% 0.60/1.05 | (equalish @ additive_identity @
% 0.60/1.05 (add @ X0 @ (additive_inverse @ X0))))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl2, zip_derived_cl21])).
% 0.60/1.05 thf(commutativity_addition, axiom,
% 0.60/1.05 (( equalish @ ( add @ X @ Y ) @ ( add @ Y @ X ) ) | ( ~( defined @ X ) ) |
% 0.60/1.05 ( ~( defined @ Y ) ))).
% 0.60/1.05 thf(zip_derived_cl3, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i]:
% 0.60/1.05 ( (equalish @ (add @ X0 @ X1) @ (add @ X1 @ X0))
% 0.60/1.05 | ~ (defined @ X0)
% 0.60/1.05 | ~ (defined @ X1))),
% 0.60/1.05 inference('cnf', [status(esa)], [commutativity_addition])).
% 0.60/1.05 thf(existence_of_identity_addition, axiom,
% 0.60/1.05 (( equalish @ ( add @ additive_identity @ X ) @ X ) | ( ~( defined @ X ) ))).
% 0.60/1.05 thf(zip_derived_cl1, plain,
% 0.60/1.05 (![X0 : $i]:
% 0.60/1.05 ( (equalish @ (add @ additive_identity @ X0) @ X0) | ~ (defined @ X0))),
% 0.60/1.05 inference('cnf', [status(esa)], [existence_of_identity_addition])).
% 0.60/1.05 thf(add_not_equal_to_a_3, conjecture,
% 0.60/1.05 (equalish @ ( add @ a @ ( add @ b @ ( additive_inverse @ b ) ) ) @ a)).
% 0.60/1.05 thf(zf_stmt_0, negated_conjecture,
% 0.60/1.05 (~( equalish @ ( add @ a @ ( add @ b @ ( additive_inverse @ b ) ) ) @ a )),
% 0.60/1.05 inference('cnf.neg', [status(esa)], [add_not_equal_to_a_3])).
% 0.60/1.05 thf(zip_derived_cl29, plain,
% 0.60/1.05 (~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @ a)),
% 0.60/1.05 inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.60/1.05 thf(transitivity_of_equality, axiom,
% 0.60/1.05 (( equalish @ X @ Z ) | ( ~( equalish @ X @ Y ) ) |
% 0.60/1.05 ( ~( equalish @ Y @ Z ) ))).
% 0.60/1.05 thf(zip_derived_cl22, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/1.05 ( (equalish @ X0 @ X1)
% 0.60/1.05 | ~ (equalish @ X0 @ X2)
% 0.60/1.05 | ~ (equalish @ X2 @ X1))),
% 0.60/1.05 inference('cnf', [status(esa)], [transitivity_of_equality])).
% 0.60/1.05 thf(zip_derived_cl40, plain,
% 0.60/1.05 (![X0 : $i]:
% 0.60/1.05 (~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @ X0)
% 0.60/1.05 | ~ (equalish @ X0 @ a))),
% 0.60/1.05 inference('s_sup+', [status(thm)], [zip_derived_cl29, zip_derived_cl22])).
% 0.60/1.05 thf(zip_derived_cl48, plain,
% 0.60/1.05 ((~ (defined @ a)
% 0.60/1.05 | ~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @
% 0.60/1.05 (add @ additive_identity @ a)))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl1, zip_derived_cl40])).
% 0.60/1.05 thf(a_is_defined, axiom, (defined @ a)).
% 0.60/1.05 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 0.60/1.05 inference('cnf', [status(esa)], [a_is_defined])).
% 0.60/1.05 thf(zip_derived_cl50, plain,
% 0.60/1.05 (~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @
% 0.60/1.05 (add @ additive_identity @ a))),
% 0.60/1.05 inference('demod', [status(thm)], [zip_derived_cl48, zip_derived_cl27])).
% 0.60/1.05 thf(zip_derived_cl22, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/1.05 ( (equalish @ X0 @ X1)
% 0.60/1.05 | ~ (equalish @ X0 @ X2)
% 0.60/1.05 | ~ (equalish @ X2 @ X1))),
% 0.60/1.05 inference('cnf', [status(esa)], [transitivity_of_equality])).
% 0.60/1.05 thf(zip_derived_cl57, plain,
% 0.60/1.05 (![X0 : $i]:
% 0.60/1.05 (~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @ X0)
% 0.60/1.05 | ~ (equalish @ X0 @ (add @ additive_identity @ a)))),
% 0.60/1.05 inference('s_sup+', [status(thm)], [zip_derived_cl50, zip_derived_cl22])).
% 0.60/1.05 thf(zip_derived_cl78, plain,
% 0.60/1.05 ((~ (defined @ additive_identity)
% 0.60/1.05 | ~ (defined @ a)
% 0.60/1.05 | ~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @
% 0.60/1.05 (add @ a @ additive_identity)))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl3, zip_derived_cl57])).
% 0.60/1.05 thf(well_definedness_of_additive_identity, axiom,
% 0.60/1.05 (defined @ additive_identity)).
% 0.60/1.05 thf(zip_derived_cl10, plain, ( (defined @ additive_identity)),
% 0.60/1.05 inference('cnf', [status(esa)], [well_definedness_of_additive_identity])).
% 0.60/1.05 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 0.60/1.05 inference('cnf', [status(esa)], [a_is_defined])).
% 0.60/1.05 thf(zip_derived_cl81, plain,
% 0.60/1.05 (~ (equalish @ (add @ a @ (add @ b @ (additive_inverse @ b))) @
% 0.60/1.05 (add @ a @ additive_identity))),
% 0.60/1.05 inference('demod', [status(thm)],
% 0.60/1.05 [zip_derived_cl78, zip_derived_cl10, zip_derived_cl27])).
% 0.60/1.05 thf(zip_derived_cl3, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i]:
% 0.60/1.05 ( (equalish @ (add @ X0 @ X1) @ (add @ X1 @ X0))
% 0.60/1.05 | ~ (defined @ X0)
% 0.60/1.05 | ~ (defined @ X1))),
% 0.60/1.05 inference('cnf', [status(esa)], [commutativity_addition])).
% 0.60/1.05 thf(zip_derived_cl22, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/1.05 ( (equalish @ X0 @ X1)
% 0.60/1.05 | ~ (equalish @ X0 @ X2)
% 0.60/1.05 | ~ (equalish @ X2 @ X1))),
% 0.60/1.05 inference('cnf', [status(esa)], [transitivity_of_equality])).
% 0.60/1.05 thf(zip_derived_cl62, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/1.05 (~ (defined @ X1)
% 0.60/1.05 | ~ (defined @ X0)
% 0.60/1.05 | (equalish @ (add @ X0 @ X1) @ X2)
% 0.60/1.05 | ~ (equalish @ (add @ X1 @ X0) @ X2))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl3, zip_derived_cl22])).
% 0.60/1.05 thf(zip_derived_cl795, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (defined @ a)
% 0.60/1.05 | ~ (equalish @ (add @ (add @ b @ (additive_inverse @ b)) @ a) @
% 0.60/1.05 (add @ a @ additive_identity)))),
% 0.60/1.05 inference('s_sup+', [status(thm)], [zip_derived_cl81, zip_derived_cl62])).
% 0.60/1.05 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 0.60/1.05 inference('cnf', [status(esa)], [a_is_defined])).
% 0.60/1.05 thf(zip_derived_cl836, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (equalish @ (add @ (add @ b @ (additive_inverse @ b)) @ a) @
% 0.60/1.05 (add @ a @ additive_identity)))),
% 0.60/1.05 inference('demod', [status(thm)], [zip_derived_cl795, zip_derived_cl27])).
% 0.60/1.05 thf(zip_derived_cl21, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 0.60/1.05 inference('cnf', [status(esa)], [symmetry_of_equality])).
% 0.60/1.05 thf(zip_derived_cl1008, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (equalish @ (add @ a @ additive_identity) @
% 0.60/1.05 (add @ (add @ b @ (additive_inverse @ b)) @ a)))),
% 0.60/1.05 inference('s_sup+', [status(thm)], [zip_derived_cl836, zip_derived_cl21])).
% 0.60/1.05 thf(zip_derived_cl62, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/1.05 (~ (defined @ X1)
% 0.60/1.05 | ~ (defined @ X0)
% 0.60/1.05 | (equalish @ (add @ X0 @ X1) @ X2)
% 0.60/1.05 | ~ (equalish @ (add @ X1 @ X0) @ X2))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl3, zip_derived_cl22])).
% 0.60/1.05 thf(zip_derived_cl1027, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (defined @ additive_identity)
% 0.60/1.05 | ~ (defined @ a)
% 0.60/1.05 | ~ (equalish @ (add @ additive_identity @ a) @
% 0.60/1.05 (add @ (add @ b @ (additive_inverse @ b)) @ a)))),
% 0.60/1.05 inference('s_sup+', [status(thm)], [zip_derived_cl1008, zip_derived_cl62])).
% 0.60/1.05 thf(zip_derived_cl10, plain, ( (defined @ additive_identity)),
% 0.60/1.05 inference('cnf', [status(esa)], [well_definedness_of_additive_identity])).
% 0.60/1.05 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 0.60/1.05 inference('cnf', [status(esa)], [a_is_defined])).
% 0.60/1.05 thf(zip_derived_cl1028, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (equalish @ (add @ additive_identity @ a) @
% 0.60/1.05 (add @ (add @ b @ (additive_inverse @ b)) @ a)))),
% 0.60/1.05 inference('demod', [status(thm)],
% 0.60/1.05 [zip_derived_cl1027, zip_derived_cl10, zip_derived_cl27])).
% 0.60/1.05 thf(compatibility_of_equality_and_addition, axiom,
% 0.60/1.05 (( equalish @ ( add @ X @ Z ) @ ( add @ Y @ Z ) ) | ( ~( defined @ Z ) ) |
% 0.60/1.05 ( ~( equalish @ X @ Y ) ))).
% 0.60/1.05 thf(zip_derived_cl23, plain,
% 0.60/1.05 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/1.05 ( (equalish @ (add @ X0 @ X1) @ (add @ X2 @ X1))
% 0.60/1.05 | ~ (defined @ X1)
% 0.60/1.05 | ~ (equalish @ X0 @ X2))),
% 0.60/1.05 inference('cnf', [status(esa)], [compatibility_of_equality_and_addition])).
% 0.60/1.05 thf(zip_derived_cl1036, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (defined @ a)
% 0.60/1.05 | ~ (equalish @ additive_identity @ (add @ b @ (additive_inverse @ b))))),
% 0.60/1.05 inference('s_sup+', [status(thm)], [zip_derived_cl1028, zip_derived_cl23])).
% 0.60/1.05 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 0.60/1.05 inference('cnf', [status(esa)], [a_is_defined])).
% 0.60/1.05 thf(zip_derived_cl1039, plain,
% 0.60/1.05 ((~ (defined @ (add @ b @ (additive_inverse @ b)))
% 0.60/1.05 | ~ (equalish @ additive_identity @ (add @ b @ (additive_inverse @ b))))),
% 0.60/1.05 inference('demod', [status(thm)], [zip_derived_cl1036, zip_derived_cl27])).
% 0.60/1.05 thf(zip_derived_cl1060, plain,
% 0.60/1.05 ((~ (defined @ b) | ~ (defined @ (add @ b @ (additive_inverse @ b))))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl39, zip_derived_cl1039])).
% 0.60/1.05 thf(b_is_defined, axiom, (defined @ b)).
% 0.60/1.05 thf(zip_derived_cl28, plain, ( (defined @ b)),
% 0.60/1.05 inference('cnf', [status(esa)], [b_is_defined])).
% 0.60/1.05 thf(zip_derived_cl1061, plain,
% 0.60/1.05 (~ (defined @ (add @ b @ (additive_inverse @ b)))),
% 0.60/1.05 inference('demod', [status(thm)], [zip_derived_cl1060, zip_derived_cl28])).
% 0.60/1.05 thf(zip_derived_cl1065, plain,
% 0.60/1.05 ((~ (defined @ (additive_inverse @ b)) | ~ (defined @ b))),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl9, zip_derived_cl1061])).
% 0.60/1.05 thf(zip_derived_cl28, plain, ( (defined @ b)),
% 0.60/1.05 inference('cnf', [status(esa)], [b_is_defined])).
% 0.60/1.05 thf(zip_derived_cl1066, plain, (~ (defined @ (additive_inverse @ b))),
% 0.60/1.05 inference('demod', [status(thm)], [zip_derived_cl1065, zip_derived_cl28])).
% 0.60/1.05 thf(zip_derived_cl1068, plain, (~ (defined @ b)),
% 0.60/1.05 inference('s_sup-', [status(thm)], [zip_derived_cl11, zip_derived_cl1066])).
% 0.60/1.05 thf(zip_derived_cl28, plain, ( (defined @ b)),
% 0.60/1.05 inference('cnf', [status(esa)], [b_is_defined])).
% 0.60/1.05 thf(zip_derived_cl1069, plain, ($false),
% 0.60/1.05 inference('demod', [status(thm)], [zip_derived_cl1068, zip_derived_cl28])).
% 0.60/1.05
% 0.60/1.05 % SZS output end Refutation
% 0.60/1.05
% 0.60/1.05
% 0.60/1.05 % Terminating...
% 3.31/1.26 % Runner terminated.
% 3.31/1.28 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------