TSTP Solution File: FLD013-2 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : FLD013-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.OQ9RLso0vS 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 : Wed Aug 30 22:39:09 EDT 2023

% Result   : Unsatisfiable 2.46s 1.47s
% Output   : Refutation 2.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : FLD013-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.OQ9RLso0vS true
% 0.14/0.35  % Computer : n012.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:08:55 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % Running portfolio for 300 s
% 0.14/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35  % 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.67  % Total configuration time : 435
% 0.22/0.67  % Estimated wc time : 1092
% 0.22/0.67  % Estimated cpu time (7 cpus) : 156.0
% 0.22/0.72  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.22/0.73  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.22/0.74  % /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.23/0.81  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 2.46/1.47  % Solved by fo/fo6_bce.sh.
% 2.46/1.47  % BCE start: 36
% 2.46/1.47  % BCE eliminated: 0
% 2.46/1.47  % PE start: 36
% 2.46/1.47  logic: neq
% 2.46/1.47  % PE eliminated: 0
% 2.46/1.47  % done 1177 iterations in 0.730s
% 2.46/1.47  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 2.46/1.47  % SZS output start Refutation
% 2.46/1.47  thf(defined_type, type, defined: $i > $o).
% 2.46/1.47  thf(d_type, type, d: $i).
% 2.46/1.47  thf(add_type, type, add: $i > $i > $i).
% 2.46/1.47  thf(u_type, type, u: $i).
% 2.46/1.47  thf(b_type, type, b: $i).
% 2.46/1.47  thf(c_type, type, c: $i).
% 2.46/1.47  thf(equalish_type, type, equalish: $i > $i > $o).
% 2.46/1.47  thf(a_type, type, a: $i).
% 2.46/1.47  thf(add_not_equal_to_u_9, conjecture, (equalish @ ( add @ d @ b ) @ u)).
% 2.46/1.47  thf(zf_stmt_0, negated_conjecture, (~( equalish @ ( add @ d @ b ) @ u )),
% 2.46/1.47    inference('cnf.neg', [status(esa)], [add_not_equal_to_u_9])).
% 2.46/1.47  thf(zip_derived_cl35, plain, (~ (equalish @ (add @ d @ b) @ u)),
% 2.46/1.47      inference('cnf', [status(esa)], [zf_stmt_0])).
% 2.46/1.47  thf(well_definedness_of_addition, axiom,
% 2.46/1.47    (( defined @ ( add @ X @ Y ) ) | ( ~( defined @ X ) ) | 
% 2.46/1.47     ( ~( defined @ Y ) ))).
% 2.46/1.47  thf(zip_derived_cl9, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]:
% 2.46/1.47         ( (defined @ (add @ X0 @ X1)) | ~ (defined @ X0) | ~ (defined @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [well_definedness_of_addition])).
% 2.46/1.47  thf(reflexivity_of_equality, axiom,
% 2.46/1.47    (( equalish @ X @ X ) | ( ~( defined @ X ) ))).
% 2.46/1.47  thf(zip_derived_cl20, plain,
% 2.46/1.47      (![X0 : $i]: ( (equalish @ X0 @ X0) | ~ (defined @ X0))),
% 2.46/1.47      inference('cnf', [status(esa)], [reflexivity_of_equality])).
% 2.46/1.47  thf(c_equals_d_7, conjecture, (~( equalish @ c @ d ))).
% 2.46/1.47  thf(zf_stmt_1, negated_conjecture, (equalish @ c @ d),
% 2.46/1.47    inference('cnf.neg', [status(esa)], [c_equals_d_7])).
% 2.46/1.47  thf(zip_derived_cl33, plain, ( (equalish @ c @ d)),
% 2.46/1.47      inference('cnf', [status(esa)], [zf_stmt_1])).
% 2.46/1.47  thf(compatibility_of_equality_and_addition, axiom,
% 2.46/1.47    (( equalish @ ( add @ X @ Z ) @ ( add @ Y @ Z ) ) | ( ~( defined @ Z ) ) | 
% 2.46/1.47     ( ~( equalish @ X @ Y ) ))).
% 2.46/1.47  thf(zip_derived_cl23, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ (add @ X0 @ X1) @ (add @ X2 @ X1))
% 2.46/1.47          | ~ (defined @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2))),
% 2.46/1.47      inference('cnf', [status(esa)], [compatibility_of_equality_and_addition])).
% 2.46/1.47  thf(commutativity_addition, axiom,
% 2.46/1.47    (( equalish @ ( add @ X @ Y ) @ ( add @ Y @ X ) ) | ( ~( defined @ X ) ) | 
% 2.46/1.47     ( ~( defined @ Y ) ))).
% 2.46/1.47  thf(zip_derived_cl3, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]:
% 2.46/1.47         ( (equalish @ (add @ X0 @ X1) @ (add @ X1 @ X0))
% 2.46/1.47          | ~ (defined @ X0)
% 2.46/1.47          | ~ (defined @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [commutativity_addition])).
% 2.46/1.47  thf(a_equals_b_6, conjecture, (~( equalish @ a @ b ))).
% 2.46/1.47  thf(zf_stmt_2, negated_conjecture, (equalish @ a @ b),
% 2.46/1.47    inference('cnf.neg', [status(esa)], [a_equals_b_6])).
% 2.46/1.47  thf(zip_derived_cl32, plain, ( (equalish @ a @ b)),
% 2.46/1.47      inference('cnf', [status(esa)], [zf_stmt_2])).
% 2.46/1.47  thf(zip_derived_cl23, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ (add @ X0 @ X1) @ (add @ X2 @ X1))
% 2.46/1.47          | ~ (defined @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2))),
% 2.46/1.47      inference('cnf', [status(esa)], [compatibility_of_equality_and_addition])).
% 2.46/1.47  thf(add_equals_u_8, conjecture, (~( equalish @ ( add @ a @ c ) @ u ))).
% 2.46/1.47  thf(zf_stmt_3, negated_conjecture, (equalish @ ( add @ a @ c ) @ u),
% 2.46/1.47    inference('cnf.neg', [status(esa)], [add_equals_u_8])).
% 2.46/1.47  thf(zip_derived_cl34, plain, ( (equalish @ (add @ a @ c) @ u)),
% 2.46/1.47      inference('cnf', [status(esa)], [zf_stmt_3])).
% 2.46/1.47  thf(symmetry_of_equality, axiom,
% 2.46/1.47    (( equalish @ X @ Y ) | ( ~( equalish @ Y @ X ) ))).
% 2.46/1.47  thf(zip_derived_cl21, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 2.46/1.47      inference('cnf', [status(esa)], [symmetry_of_equality])).
% 2.46/1.47  thf(zip_derived_cl39, plain, ( (equalish @ u @ (add @ a @ c))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl34, zip_derived_cl21])).
% 2.46/1.47  thf(transitivity_of_equality, axiom,
% 2.46/1.47    (( equalish @ X @ Z ) | ( ~( equalish @ X @ Y ) ) | 
% 2.46/1.47     ( ~( equalish @ Y @ Z ) ))).
% 2.46/1.47  thf(zip_derived_cl22, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ X0 @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2)
% 2.46/1.47          | ~ (equalish @ X2 @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [transitivity_of_equality])).
% 2.46/1.47  thf(zip_derived_cl66, plain,
% 2.46/1.47      (![X0 : $i]: ( (equalish @ u @ X0) | ~ (equalish @ (add @ a @ c) @ X0))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl39, zip_derived_cl22])).
% 2.46/1.47  thf(zip_derived_cl189, plain,
% 2.46/1.47      (![X0 : $i]:
% 2.46/1.47         (~ (equalish @ a @ X0)
% 2.46/1.47          | ~ (defined @ c)
% 2.46/1.47          |  (equalish @ u @ (add @ X0 @ c)))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl23, zip_derived_cl66])).
% 2.46/1.47  thf(c_is_defined, axiom, (defined @ c)).
% 2.46/1.47  thf(zip_derived_cl29, plain, ( (defined @ c)),
% 2.46/1.47      inference('cnf', [status(esa)], [c_is_defined])).
% 2.46/1.47  thf(zip_derived_cl192, plain,
% 2.46/1.47      (![X0 : $i]: (~ (equalish @ a @ X0) |  (equalish @ u @ (add @ X0 @ c)))),
% 2.46/1.47      inference('demod', [status(thm)], [zip_derived_cl189, zip_derived_cl29])).
% 2.46/1.47  thf(zip_derived_cl34, plain, ( (equalish @ (add @ a @ c) @ u)),
% 2.46/1.47      inference('cnf', [status(esa)], [zf_stmt_3])).
% 2.46/1.47  thf(zip_derived_cl22, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ X0 @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2)
% 2.46/1.47          | ~ (equalish @ X2 @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [transitivity_of_equality])).
% 2.46/1.47  thf(zip_derived_cl58, plain,
% 2.46/1.47      (![X0 : $i]: ( (equalish @ (add @ a @ c) @ X0) | ~ (equalish @ u @ X0))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl34, zip_derived_cl22])).
% 2.46/1.47  thf(zip_derived_cl22, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ X0 @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2)
% 2.46/1.47          | ~ (equalish @ X2 @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [transitivity_of_equality])).
% 2.46/1.47  thf(zip_derived_cl79, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]:
% 2.46/1.47         (~ (equalish @ u @ X0)
% 2.46/1.47          |  (equalish @ (add @ a @ c) @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X1))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl58, zip_derived_cl22])).
% 2.46/1.47  thf(zip_derived_cl559, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]:
% 2.46/1.47         (~ (equalish @ a @ X0)
% 2.46/1.47          |  (equalish @ (add @ a @ c) @ X1)
% 2.46/1.47          | ~ (equalish @ (add @ X0 @ c) @ X1))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl192, zip_derived_cl79])).
% 2.46/1.47  thf(zip_derived_cl588, plain,
% 2.46/1.47      (![X0 : $i]:
% 2.46/1.47         ( (equalish @ (add @ a @ c) @ X0) | ~ (equalish @ (add @ b @ c) @ X0))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl32, zip_derived_cl559])).
% 2.46/1.47  thf(zip_derived_cl645, plain,
% 2.46/1.47      ((~ (defined @ c)
% 2.46/1.47        | ~ (defined @ b)
% 2.46/1.47        |  (equalish @ (add @ a @ c) @ (add @ c @ b)))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl3, zip_derived_cl588])).
% 2.46/1.47  thf(zip_derived_cl29, plain, ( (defined @ c)),
% 2.46/1.47      inference('cnf', [status(esa)], [c_is_defined])).
% 2.46/1.47  thf(b_is_defined, axiom, (defined @ b)).
% 2.46/1.47  thf(zip_derived_cl28, plain, ( (defined @ b)),
% 2.46/1.47      inference('cnf', [status(esa)], [b_is_defined])).
% 2.46/1.47  thf(zip_derived_cl648, plain, ( (equalish @ (add @ a @ c) @ (add @ c @ b))),
% 2.46/1.47      inference('demod', [status(thm)],
% 2.46/1.47                [zip_derived_cl645, zip_derived_cl29, zip_derived_cl28])).
% 2.46/1.47  thf(zip_derived_cl22, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ X0 @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2)
% 2.46/1.47          | ~ (equalish @ X2 @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [transitivity_of_equality])).
% 2.46/1.47  thf(zip_derived_cl674, plain,
% 2.46/1.47      (![X0 : $i]:
% 2.46/1.47         ( (equalish @ (add @ a @ c) @ X0) | ~ (equalish @ (add @ c @ b) @ X0))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl648, zip_derived_cl22])).
% 2.46/1.47  thf(zip_derived_cl686, plain,
% 2.46/1.47      (![X0 : $i]:
% 2.46/1.47         (~ (equalish @ c @ X0)
% 2.46/1.47          | ~ (defined @ b)
% 2.46/1.47          |  (equalish @ (add @ a @ c) @ (add @ X0 @ b)))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl23, zip_derived_cl674])).
% 2.46/1.47  thf(zip_derived_cl28, plain, ( (defined @ b)),
% 2.46/1.47      inference('cnf', [status(esa)], [b_is_defined])).
% 2.46/1.47  thf(zip_derived_cl688, plain,
% 2.46/1.47      (![X0 : $i]:
% 2.46/1.47         (~ (equalish @ c @ X0) |  (equalish @ (add @ a @ c) @ (add @ X0 @ b)))),
% 2.46/1.47      inference('demod', [status(thm)], [zip_derived_cl686, zip_derived_cl28])).
% 2.46/1.47  thf(zip_derived_cl22, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i, X2 : $i]:
% 2.46/1.47         ( (equalish @ X0 @ X1)
% 2.46/1.47          | ~ (equalish @ X0 @ X2)
% 2.46/1.47          | ~ (equalish @ X2 @ X1))),
% 2.46/1.47      inference('cnf', [status(esa)], [transitivity_of_equality])).
% 2.46/1.47  thf(zip_derived_cl4540, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]:
% 2.46/1.47         (~ (equalish @ c @ X0)
% 2.46/1.47          |  (equalish @ (add @ a @ c) @ X1)
% 2.46/1.47          | ~ (equalish @ (add @ X0 @ b) @ X1))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl688, zip_derived_cl22])).
% 2.46/1.47  thf(zip_derived_cl4564, plain,
% 2.46/1.47      (![X0 : $i]:
% 2.46/1.47         ( (equalish @ (add @ a @ c) @ X0) | ~ (equalish @ (add @ d @ b) @ X0))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl33, zip_derived_cl4540])).
% 2.46/1.47  thf(zip_derived_cl4719, plain,
% 2.46/1.47      ((~ (defined @ (add @ d @ b))
% 2.46/1.47        |  (equalish @ (add @ a @ c) @ (add @ d @ b)))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl20, zip_derived_cl4564])).
% 2.46/1.47  thf(zip_derived_cl5035, plain,
% 2.46/1.47      ((~ (defined @ b)
% 2.46/1.47        | ~ (defined @ d)
% 2.46/1.47        |  (equalish @ (add @ a @ c) @ (add @ d @ b)))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl9, zip_derived_cl4719])).
% 2.46/1.47  thf(zip_derived_cl28, plain, ( (defined @ b)),
% 2.46/1.47      inference('cnf', [status(esa)], [b_is_defined])).
% 2.46/1.47  thf(d_is_defined, axiom, (defined @ d)).
% 2.46/1.47  thf(zip_derived_cl30, plain, ( (defined @ d)),
% 2.46/1.47      inference('cnf', [status(esa)], [d_is_defined])).
% 2.46/1.47  thf(zip_derived_cl5036, plain, ( (equalish @ (add @ a @ c) @ (add @ d @ b))),
% 2.46/1.47      inference('demod', [status(thm)],
% 2.46/1.47                [zip_derived_cl5035, zip_derived_cl28, zip_derived_cl30])).
% 2.46/1.47  thf(zip_derived_cl66, plain,
% 2.46/1.47      (![X0 : $i]: ( (equalish @ u @ X0) | ~ (equalish @ (add @ a @ c) @ X0))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl39, zip_derived_cl22])).
% 2.46/1.47  thf(zip_derived_cl5042, plain, ( (equalish @ u @ (add @ d @ b))),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl5036, zip_derived_cl66])).
% 2.46/1.47  thf(zip_derived_cl21, plain,
% 2.46/1.47      (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 2.46/1.47      inference('cnf', [status(esa)], [symmetry_of_equality])).
% 2.46/1.47  thf(zip_derived_cl5047, plain, ( (equalish @ (add @ d @ b) @ u)),
% 2.46/1.47      inference('s_sup-', [status(thm)], [zip_derived_cl5042, zip_derived_cl21])).
% 2.46/1.47  thf(zip_derived_cl5060, plain, ($false),
% 2.46/1.47      inference('demod', [status(thm)], [zip_derived_cl35, zip_derived_cl5047])).
% 2.46/1.47  
% 2.46/1.47  % SZS output end Refutation
% 2.46/1.47  
% 2.46/1.47  
% 2.46/1.47  % Terminating...
% 6.62/1.58  % Runner terminated.
% 6.62/1.59  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------