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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : FLD030-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.xfzLYRAnGf true

% Computer : n021.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:17 EDT 2023

% Result   : Unsatisfiable 0.69s 0.79s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : FLD030-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.xfzLYRAnGf true
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Aug 28 00:42:43 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34  % Number of cores: 8
% 0.13/0.35  % Python version: Python 3.6.8
% 0.13/0.35  % Running in FO mode
% 0.20/0.64  % Total configuration time : 435
% 0.20/0.64  % Estimated wc time : 1092
% 0.20/0.64  % Estimated cpu time (7 cpus) : 156.0
% 0.20/0.69  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.20/0.72  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.20/0.73  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.20/0.74  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.69/0.76  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.69/0.77  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.69/0.77  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.69/0.79  % Solved by fo/fo6_bce.sh.
% 0.69/0.79  % BCE start: 34
% 0.69/0.79  % BCE eliminated: 0
% 0.69/0.79  % PE start: 34
% 0.69/0.79  logic: neq
% 0.69/0.79  % PE eliminated: 0
% 0.69/0.79  % done 144 iterations in 0.071s
% 0.69/0.79  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.69/0.79  % SZS output start Refutation
% 0.69/0.79  thf(defined_type, type, defined: $i > $o).
% 0.69/0.79  thf(d_type, type, d: $i).
% 0.69/0.79  thf(multiply_type, type, multiply: $i > $i > $i).
% 0.69/0.79  thf(b_type, type, b: $i).
% 0.69/0.79  thf(c_type, type, c: $i).
% 0.69/0.79  thf(equalish_type, type, equalish: $i > $i > $o).
% 0.69/0.79  thf(a_type, type, a: $i).
% 0.69/0.79  thf(compatibility_of_equality_and_multiplication, axiom,
% 0.69/0.79    (( equalish @ ( multiply @ X @ Z ) @ ( multiply @ Y @ Z ) ) | 
% 0.69/0.79     ( ~( defined @ Z ) ) | ( ~( equalish @ X @ Y ) ))).
% 0.69/0.79  thf(zip_derived_cl24, plain,
% 0.69/0.79      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.69/0.79         ( (equalish @ (multiply @ X0 @ X1) @ (multiply @ X2 @ X1))
% 0.69/0.79          | ~ (defined @ X1)
% 0.69/0.79          | ~ (equalish @ X0 @ X2))),
% 0.69/0.79      inference('cnf', [status(esa)],
% 0.69/0.79                [compatibility_of_equality_and_multiplication])).
% 0.69/0.79  thf(multiply_equals_c_5, conjecture,
% 0.69/0.79    (~( equalish @ ( multiply @ a @ b ) @ c ))).
% 0.69/0.79  thf(zf_stmt_0, negated_conjecture, (equalish @ ( multiply @ a @ b ) @ c),
% 0.69/0.79    inference('cnf.neg', [status(esa)], [multiply_equals_c_5])).
% 0.69/0.79  thf(zip_derived_cl31, plain, ( (equalish @ (multiply @ a @ b) @ c)),
% 0.69/0.79      inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.69/0.79  thf(symmetry_of_equality, axiom,
% 0.69/0.79    (( equalish @ X @ Y ) | ( ~( equalish @ Y @ X ) ))).
% 0.69/0.79  thf(zip_derived_cl21, plain,
% 0.69/0.79      (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 0.69/0.79      inference('cnf', [status(esa)], [symmetry_of_equality])).
% 0.69/0.79  thf(zip_derived_cl37, plain, ( (equalish @ c @ (multiply @ a @ b))),
% 0.69/0.79      inference('s_sup-', [status(thm)], [zip_derived_cl31, zip_derived_cl21])).
% 0.69/0.79  thf(transitivity_of_equality, axiom,
% 0.69/0.79    (( equalish @ X @ Z ) | ( ~( equalish @ X @ Y ) ) | 
% 0.69/0.79     ( ~( equalish @ Y @ Z ) ))).
% 0.69/0.79  thf(zip_derived_cl22, plain,
% 0.69/0.79      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.69/0.79         ( (equalish @ X0 @ X1)
% 0.69/0.79          | ~ (equalish @ X0 @ X2)
% 0.69/0.79          | ~ (equalish @ X2 @ X1))),
% 0.69/0.79      inference('cnf', [status(esa)], [transitivity_of_equality])).
% 0.69/0.79  thf(zip_derived_cl55, plain,
% 0.69/0.79      (![X0 : $i]:
% 0.69/0.79         ( (equalish @ c @ X0) | ~ (equalish @ (multiply @ a @ b) @ X0))),
% 0.69/0.79      inference('s_sup-', [status(thm)], [zip_derived_cl37, zip_derived_cl22])).
% 0.69/0.79  thf(zip_derived_cl224, plain,
% 0.69/0.79      (![X0 : $i]:
% 0.69/0.79         (~ (equalish @ a @ X0)
% 0.69/0.79          | ~ (defined @ b)
% 0.69/0.79          |  (equalish @ c @ (multiply @ X0 @ b)))),
% 0.69/0.79      inference('s_sup-', [status(thm)], [zip_derived_cl24, zip_derived_cl55])).
% 0.69/0.79  thf(b_is_defined, axiom, (defined @ b)).
% 0.69/0.79  thf(zip_derived_cl28, plain, ( (defined @ b)),
% 0.69/0.79      inference('cnf', [status(esa)], [b_is_defined])).
% 0.69/0.79  thf(zip_derived_cl226, plain,
% 0.69/0.79      (![X0 : $i]:
% 0.69/0.79         (~ (equalish @ a @ X0) |  (equalish @ c @ (multiply @ X0 @ b)))),
% 0.69/0.79      inference('demod', [status(thm)], [zip_derived_cl224, zip_derived_cl28])).
% 0.69/0.79  thf(zip_derived_cl21, plain,
% 0.69/0.79      (![X0 : $i, X1 : $i]: ( (equalish @ X0 @ X1) | ~ (equalish @ X1 @ X0))),
% 0.69/0.79      inference('cnf', [status(esa)], [symmetry_of_equality])).
% 0.69/0.79  thf(zip_derived_cl429, plain,
% 0.69/0.79      (![X0 : $i]:
% 0.69/0.79         (~ (equalish @ a @ X0) |  (equalish @ (multiply @ X0 @ b) @ c))),
% 0.69/0.79      inference('s_sup-', [status(thm)], [zip_derived_cl226, zip_derived_cl21])).
% 0.69/0.79  thf(multiply_not_equal_to_c_7, conjecture,
% 0.69/0.79    (equalish @ ( multiply @ d @ b ) @ c)).
% 0.69/0.79  thf(zf_stmt_1, negated_conjecture,
% 0.69/0.79    (~( equalish @ ( multiply @ d @ b ) @ c )),
% 0.69/0.79    inference('cnf.neg', [status(esa)], [multiply_not_equal_to_c_7])).
% 0.69/0.79  thf(zip_derived_cl33, plain, (~ (equalish @ (multiply @ d @ b) @ c)),
% 0.69/0.79      inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.69/0.79  thf(zip_derived_cl443, plain, (~ (equalish @ a @ d)),
% 0.69/0.79      inference('s_sup-', [status(thm)], [zip_derived_cl429, zip_derived_cl33])).
% 0.69/0.79  thf(a_equals_d_6, conjecture, (~( equalish @ a @ d ))).
% 0.69/0.79  thf(zf_stmt_2, negated_conjecture, (equalish @ a @ d),
% 0.69/0.79    inference('cnf.neg', [status(esa)], [a_equals_d_6])).
% 0.69/0.79  thf(zip_derived_cl32, plain, ( (equalish @ a @ d)),
% 0.69/0.79      inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.69/0.79  thf(zip_derived_cl445, plain, ($false),
% 0.69/0.79      inference('demod', [status(thm)], [zip_derived_cl443, zip_derived_cl32])).
% 0.69/0.79  
% 0.69/0.79  % SZS output end Refutation
% 0.69/0.79  
% 0.69/0.79  
% 0.69/0.79  % Terminating...
% 1.44/0.85  % Runner terminated.
% 1.44/0.86  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------