TSTP Solution File: FLD059-2 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : FLD059-2 : TPTP v8.1.2. Bugfixed v2.1.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.1D3QbHF7ig true
% Computer : n002.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:32 EDT 2023
% Result : Unsatisfiable 1.37s 1.35s
% Output : Refutation 1.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD059-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.1D3QbHF7ig true
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 23:34:04 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % Running portfolio for 300 s
% 0.14/0.36 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.36 % Number of cores: 8
% 0.14/0.36 % Python version: Python 3.6.8
% 0.14/0.36 % Running in FO mode
% 0.22/0.65 % Total configuration time : 435
% 0.22/0.65 % Estimated wc time : 1092
% 0.22/0.65 % Estimated cpu time (7 cpus) : 156.0
% 0.22/0.73 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.22/0.75 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.22/0.75 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.22/0.77 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.22/0.77 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.22/0.78 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.17/0.80 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.37/1.35 % Solved by fo/fo13.sh.
% 1.37/1.35 % done 1000 iterations in 0.560s
% 1.37/1.35 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.37/1.35 % SZS output start Refutation
% 1.37/1.35 thf(defined_type, type, defined: $i > $o).
% 1.37/1.35 thf(additive_identity_type, type, additive_identity: $i).
% 1.37/1.35 thf(add_type, type, add: $i > $i > $i).
% 1.37/1.35 thf(less_or_equal_type, type, less_or_equal: $i > $i > $o).
% 1.37/1.35 thf(u_type, type, u: $i).
% 1.37/1.35 thf(equalish_type, type, equalish: $i > $i > $o).
% 1.37/1.35 thf(a_type, type, a: $i).
% 1.37/1.35 thf(not_less_or_equal_5, conjecture, (less_or_equal @ additive_identity @ u)).
% 1.37/1.35 thf(zf_stmt_0, negated_conjecture,
% 1.37/1.35 (~( less_or_equal @ additive_identity @ u )),
% 1.37/1.35 inference('cnf.neg', [status(esa)], [not_less_or_equal_5])).
% 1.37/1.35 thf(zip_derived_cl31, plain, (~ (less_or_equal @ additive_identity @ u)),
% 1.37/1.35 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.37/1.35 thf(totality_of_order_relation, axiom,
% 1.37/1.35 (( less_or_equal @ X @ Y ) | ( less_or_equal @ Y @ X ) |
% 1.37/1.35 ( ~( defined @ X ) ) | ( ~( defined @ Y ) ))).
% 1.37/1.35 thf(zip_derived_cl17, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i]:
% 1.37/1.35 ( (less_or_equal @ X0 @ X1)
% 1.37/1.35 | (less_or_equal @ X1 @ X0)
% 1.37/1.35 | ~ (defined @ X0)
% 1.37/1.35 | ~ (defined @ X1))),
% 1.37/1.35 inference('cnf', [status(esa)], [totality_of_order_relation])).
% 1.37/1.35 thf(zip_derived_cl202, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 (~ (defined @ X0) | ~ (defined @ X0) | (less_or_equal @ X0 @ X0))),
% 1.37/1.35 inference('eq_fact', [status(thm)], [zip_derived_cl17])).
% 1.37/1.35 thf(zip_derived_cl204, plain,
% 1.37/1.35 (![X0 : $i]: ( (less_or_equal @ X0 @ X0) | ~ (defined @ X0))),
% 1.37/1.35 inference('simplify', [status(thm)], [zip_derived_cl202])).
% 1.37/1.35 thf(add_equals_u_4, conjecture, (~( equalish @ ( add @ a @ a ) @ u ))).
% 1.37/1.35 thf(zf_stmt_1, negated_conjecture, (equalish @ ( add @ a @ a ) @ u),
% 1.37/1.35 inference('cnf.neg', [status(esa)], [add_equals_u_4])).
% 1.37/1.35 thf(zip_derived_cl30, plain, ( (equalish @ (add @ a @ a) @ u)),
% 1.37/1.35 inference('cnf', [status(esa)], [zf_stmt_1])).
% 1.37/1.35 thf(symmetry_of_equality, axiom,
% 1.37/1.35 (( equalish @ X @ Y ) | ( ~( equalish @ Y @ X ) ))).
% 1.37/1.35 thf(zip_derived_cl21, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 1.37/1.35 inference('cnf', [status(esa)], [symmetry_of_equality])).
% 1.37/1.35 thf(zip_derived_cl34, plain, ( (equalish @ u @ (add @ a @ a))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl30, zip_derived_cl21])).
% 1.37/1.35 thf(compatibility_of_equality_and_order_relation, axiom,
% 1.37/1.35 (( less_or_equal @ Y @ Z ) | ( ~( less_or_equal @ X @ Z ) ) |
% 1.37/1.35 ( ~( equalish @ X @ Y ) ))).
% 1.37/1.35 thf(zip_derived_cl25, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.37/1.35 ( (less_or_equal @ X0 @ X1)
% 1.37/1.35 | ~ (less_or_equal @ X2 @ X1)
% 1.37/1.35 | ~ (equalish @ X2 @ X0))),
% 1.37/1.35 inference('cnf', [status(esa)],
% 1.37/1.35 [compatibility_of_equality_and_order_relation])).
% 1.37/1.35 thf(zip_derived_cl68, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 ( (less_or_equal @ (add @ a @ a) @ X0) | ~ (less_or_equal @ u @ X0))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl34, zip_derived_cl25])).
% 1.37/1.35 thf(zip_derived_cl365, plain,
% 1.37/1.35 ((~ (defined @ u) | (less_or_equal @ (add @ a @ a) @ u))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl204, zip_derived_cl68])).
% 1.37/1.35 thf(u_is_defined, axiom, (defined @ u)).
% 1.37/1.35 thf(zip_derived_cl28, plain, ( (defined @ u)),
% 1.37/1.35 inference('cnf', [status(esa)], [u_is_defined])).
% 1.37/1.35 thf(zip_derived_cl368, plain, ( (less_or_equal @ (add @ a @ a) @ u)),
% 1.37/1.35 inference('demod', [status(thm)], [zip_derived_cl365, zip_derived_cl28])).
% 1.37/1.35 thf(less_or_equal_3, conjecture,
% 1.37/1.35 (~( less_or_equal @ additive_identity @ a ))).
% 1.37/1.35 thf(zf_stmt_2, negated_conjecture, (less_or_equal @ additive_identity @ a),
% 1.37/1.35 inference('cnf.neg', [status(esa)], [less_or_equal_3])).
% 1.37/1.35 thf(zip_derived_cl29, plain, ( (less_or_equal @ additive_identity @ a)),
% 1.37/1.35 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.37/1.35 thf(compatibility_of_order_relation_and_addition, axiom,
% 1.37/1.35 (( less_or_equal @ ( add @ X @ Z ) @ ( add @ Y @ Z ) ) |
% 1.37/1.35 ( ~( defined @ Z ) ) | ( ~( less_or_equal @ X @ Y ) ))).
% 1.37/1.35 thf(zip_derived_cl18, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.37/1.35 ( (less_or_equal @ (add @ X0 @ X1) @ (add @ X2 @ X1))
% 1.37/1.35 | ~ (defined @ X1)
% 1.37/1.35 | ~ (less_or_equal @ X0 @ X2))),
% 1.37/1.35 inference('cnf', [status(esa)],
% 1.37/1.35 [compatibility_of_order_relation_and_addition])).
% 1.37/1.35 thf(zip_derived_cl219, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 ( (less_or_equal @ (add @ additive_identity @ X0) @ (add @ a @ X0))
% 1.37/1.35 | ~ (defined @ X0))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl29, zip_derived_cl18])).
% 1.37/1.35 thf(existence_of_identity_addition, axiom,
% 1.37/1.35 (( equalish @ ( add @ additive_identity @ X ) @ X ) | ( ~( defined @ X ) ))).
% 1.37/1.35 thf(zip_derived_cl1, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 ( (equalish @ (add @ additive_identity @ X0) @ X0) | ~ (defined @ X0))),
% 1.37/1.35 inference('cnf', [status(esa)], [existence_of_identity_addition])).
% 1.37/1.35 thf(zip_derived_cl25, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.37/1.35 ( (less_or_equal @ X0 @ X1)
% 1.37/1.35 | ~ (less_or_equal @ X2 @ X1)
% 1.37/1.35 | ~ (equalish @ X2 @ X0))),
% 1.37/1.35 inference('cnf', [status(esa)],
% 1.37/1.35 [compatibility_of_equality_and_order_relation])).
% 1.37/1.35 thf(zip_derived_cl62, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i]:
% 1.37/1.35 (~ (defined @ X0)
% 1.37/1.35 | (less_or_equal @ X0 @ X1)
% 1.37/1.35 | ~ (less_or_equal @ (add @ additive_identity @ X0) @ X1))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl1, zip_derived_cl25])).
% 1.37/1.35 thf(zip_derived_cl4936, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 (~ (defined @ X0)
% 1.37/1.35 | ~ (defined @ X0)
% 1.37/1.35 | (less_or_equal @ X0 @ (add @ a @ X0)))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl219, zip_derived_cl62])).
% 1.37/1.35 thf(zip_derived_cl4950, plain,
% 1.37/1.35 (![X0 : $i]: ( (less_or_equal @ X0 @ (add @ a @ X0)) | ~ (defined @ X0))),
% 1.37/1.35 inference('simplify', [status(thm)], [zip_derived_cl4936])).
% 1.37/1.35 thf(zip_derived_cl29, plain, ( (less_or_equal @ additive_identity @ a)),
% 1.37/1.35 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.37/1.35 thf(transitivity_of_order_relation, axiom,
% 1.37/1.35 (( less_or_equal @ X @ Z ) | ( ~( less_or_equal @ X @ Y ) ) |
% 1.37/1.35 ( ~( less_or_equal @ Y @ Z ) ))).
% 1.37/1.35 thf(zip_derived_cl16, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.37/1.35 ( (less_or_equal @ X0 @ X1)
% 1.37/1.35 | ~ (less_or_equal @ X0 @ X2)
% 1.37/1.35 | ~ (less_or_equal @ X2 @ X1))),
% 1.37/1.35 inference('cnf', [status(esa)], [transitivity_of_order_relation])).
% 1.37/1.35 thf(zip_derived_cl41, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 ( (less_or_equal @ additive_identity @ X0)
% 1.37/1.35 | ~ (less_or_equal @ a @ X0))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl29, zip_derived_cl16])).
% 1.37/1.35 thf(zip_derived_cl5013, plain,
% 1.37/1.35 ((~ (defined @ a) | (less_or_equal @ additive_identity @ (add @ a @ a)))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl4950, zip_derived_cl41])).
% 1.37/1.35 thf(a_is_defined, axiom, (defined @ a)).
% 1.37/1.35 thf(zip_derived_cl27, plain, ( (defined @ a)),
% 1.37/1.35 inference('cnf', [status(esa)], [a_is_defined])).
% 1.37/1.35 thf(zip_derived_cl5034, plain,
% 1.37/1.35 ( (less_or_equal @ additive_identity @ (add @ a @ a))),
% 1.37/1.35 inference('demod', [status(thm)], [zip_derived_cl5013, zip_derived_cl27])).
% 1.37/1.35 thf(zip_derived_cl16, plain,
% 1.37/1.35 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.37/1.35 ( (less_or_equal @ X0 @ X1)
% 1.37/1.35 | ~ (less_or_equal @ X0 @ X2)
% 1.37/1.35 | ~ (less_or_equal @ X2 @ X1))),
% 1.37/1.35 inference('cnf', [status(esa)], [transitivity_of_order_relation])).
% 1.37/1.35 thf(zip_derived_cl5053, plain,
% 1.37/1.35 (![X0 : $i]:
% 1.37/1.35 ( (less_or_equal @ additive_identity @ X0)
% 1.37/1.35 | ~ (less_or_equal @ (add @ a @ a) @ X0))),
% 1.37/1.35 inference('s_sup-', [status(thm)], [zip_derived_cl5034, zip_derived_cl16])).
% 1.37/1.35 thf(zip_derived_cl5111, plain, ( (less_or_equal @ additive_identity @ u)),
% 1.37/1.35 inference('s_sup-', [status(thm)],
% 1.37/1.35 [zip_derived_cl368, zip_derived_cl5053])).
% 1.37/1.35 thf(zip_derived_cl5116, plain, ($false),
% 1.37/1.35 inference('demod', [status(thm)], [zip_derived_cl31, zip_derived_cl5111])).
% 1.37/1.35
% 1.37/1.35 % SZS output end Refutation
% 1.37/1.35
% 1.37/1.35
% 1.37/1.35 % Terminating...
% 5.65/1.47 % Runner terminated.
% 5.69/1.48 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------