TSTP Solution File: SET076-6 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SET076-6 : 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.57IBJU0tz6 true

% Computer : n005.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 Aug 31 16:12:28 EDT 2023

% Result   : Unsatisfiable 1.36s 1.09s
% Output   : Refutation 1.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET076-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.57IBJU0tz6 true
% 0.13/0.34  % Computer : n005.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 : Sat Aug 26 14:03:38 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox2/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.61  % Total configuration time : 435
% 0.20/0.61  % Estimated wc time : 1092
% 0.20/0.61  % Estimated cpu time (7 cpus) : 156.0
% 0.20/0.72  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.20/0.72  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.20/0.72  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.20/0.73  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.20/0.74  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.20/0.74  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.20/0.74  % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 1.28/0.79  % /export/starexec/sandbox2/solver/bin/fo/fo1_lcnf.sh running for 50s
% 1.28/0.79  % /export/starexec/sandbox2/solver/bin/fo/fo17_bce.sh running for 50s
% 1.36/1.09  % Solved by fo/fo1_lcnf.sh.
% 1.36/1.09  % done 455 iterations in 0.278s
% 1.36/1.09  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.36/1.09  % SZS output start Refutation
% 1.36/1.09  thf(member_type, type, member: $i > $i > $o).
% 1.36/1.09  thf(x_type, type, x: $i).
% 1.36/1.09  thf(unordered_pair_type, type, unordered_pair: $i > $i > $i).
% 1.36/1.09  thf(y_type, type, y: $i).
% 1.36/1.09  thf(z_type, type, z: $i).
% 1.36/1.09  thf(subclass_type, type, subclass: $i > $i > $o).
% 1.36/1.09  thf(not_subclass_element_type, type, not_subclass_element: $i > $i > $i).
% 1.36/1.09  thf(prove_unordered_pair_is_subset_3, conjecture,
% 1.36/1.09    (subclass @ ( unordered_pair @ x @ y ) @ z)).
% 1.36/1.09  thf(zf_stmt_0, negated_conjecture,
% 1.36/1.09    (~( subclass @ ( unordered_pair @ x @ y ) @ z )),
% 1.36/1.09    inference('cnf.neg', [status(esa)], [prove_unordered_pair_is_subset_3])).
% 1.36/1.09  thf(zip_derived_cl93, plain, (~ (subclass @ (unordered_pair @ x @ y) @ z)),
% 1.36/1.09      inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.36/1.09  thf(not_subclass_members1, axiom,
% 1.36/1.09    (( member @ ( not_subclass_element @ X @ Y ) @ X ) | ( subclass @ X @ Y ))).
% 1.36/1.09  thf(zip_derived_cl1, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i]:
% 1.36/1.09          (((member @ (not_subclass_element @ X0 @ X1) @ X0) | (subclass @ 
% 1.36/1.09            X0 @ X1)))),
% 1.36/1.09      inference('cnf', [status(esa)], [not_subclass_members1])).
% 1.36/1.09  thf(zip_derived_cl106, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i]:
% 1.36/1.09         ( (member @ (not_subclass_element @ X0 @ X1) @ X0)
% 1.36/1.09          |  (subclass @ X0 @ X1))),
% 1.36/1.09      inference('lazy_cnf_or', [status(thm)], [zip_derived_cl1])).
% 1.36/1.09  thf(unordered_pair_member, axiom,
% 1.36/1.09    (( ~( member @ U @ ( unordered_pair @ X @ Y ) ) ) | ( ( U ) = ( X ) ) | 
% 1.36/1.09     ( ( U ) = ( Y ) ))).
% 1.36/1.09  thf(zip_derived_cl7, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i, X2 : $i]:
% 1.36/1.09          (((((~) @ (member @ X0 @ (unordered_pair @ X1 @ X2)))) | 
% 1.36/1.09            (((X0) = (X1))) | (((X0) = (X2)))))),
% 1.36/1.09      inference('cnf', [status(esa)], [unordered_pair_member])).
% 1.36/1.09  thf(zip_derived_cl171, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i, X2 : $i]:
% 1.36/1.09         (~ (member @ X0 @ (unordered_pair @ X1 @ X2))
% 1.36/1.09          |  (((X0) = (X1)))
% 1.36/1.09          |  (((X0) = (X2))))),
% 1.36/1.09      inference('lazy_cnf_or', [status(thm)], [zip_derived_cl7])).
% 1.36/1.09  thf(zip_derived_cl172, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i, X2 : $i]:
% 1.36/1.09         (~ (member @ X0 @ (unordered_pair @ X1 @ X2))
% 1.36/1.09          | ((X0) = (X1))
% 1.36/1.09          | ((X0) = (X2)))),
% 1.36/1.09      inference('simplify nested equalities', [status(thm)],
% 1.36/1.09                [zip_derived_cl171])).
% 1.36/1.09  thf(zip_derived_cl173, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i, X2 : $i]:
% 1.36/1.09         ( (subclass @ (unordered_pair @ X1 @ X0) @ X2)
% 1.36/1.09          | ((not_subclass_element @ (unordered_pair @ X1 @ X0) @ X2) = (X1))
% 1.36/1.09          | ((not_subclass_element @ (unordered_pair @ X1 @ X0) @ X2) = (X0)))),
% 1.36/1.09      inference('s_sup-', [status(thm)], [zip_derived_cl106, zip_derived_cl172])).
% 1.36/1.09  thf(zip_derived_cl93, plain, (~ (subclass @ (unordered_pair @ x @ y) @ z)),
% 1.36/1.09      inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.36/1.09  thf(zip_derived_cl1495, plain,
% 1.36/1.09      ((((not_subclass_element @ (unordered_pair @ x @ y) @ z) = (y))
% 1.36/1.09        | ((not_subclass_element @ (unordered_pair @ x @ y) @ z) = (x)))),
% 1.36/1.09      inference('s_sup-', [status(thm)], [zip_derived_cl173, zip_derived_cl93])).
% 1.36/1.09  thf(not_subclass_members2, axiom,
% 1.36/1.09    (( ~( member @ ( not_subclass_element @ X @ Y ) @ Y ) ) | 
% 1.36/1.09     ( subclass @ X @ Y ))).
% 1.36/1.09  thf(zip_derived_cl2, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i]:
% 1.36/1.09          (((((~) @ (member @ (not_subclass_element @ X0 @ X1) @ X1))) |
% 1.36/1.09            (subclass @ X0 @ X1)))),
% 1.36/1.09      inference('cnf', [status(esa)], [not_subclass_members2])).
% 1.36/1.09  thf(zip_derived_cl118, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i]:
% 1.36/1.09         (~ (member @ (not_subclass_element @ X0 @ X1) @ X1)
% 1.36/1.09          |  (subclass @ X0 @ X1))),
% 1.36/1.09      inference('lazy_cnf_or', [status(thm)], [zip_derived_cl2])).
% 1.36/1.09  thf(zip_derived_cl1516, plain,
% 1.36/1.09      ((((not_subclass_element @ (unordered_pair @ x @ y) @ z) = (x))
% 1.36/1.09        | ~ (member @ y @ z)
% 1.36/1.09        |  (subclass @ (unordered_pair @ x @ y) @ z))),
% 1.36/1.09      inference('s_sup-', [status(thm)],
% 1.36/1.09                [zip_derived_cl1495, zip_derived_cl118])).
% 1.36/1.09  thf(prove_unordered_pair_is_subset_2, conjecture, (~( member @ y @ z ))).
% 1.36/1.09  thf(zf_stmt_1, negated_conjecture, (member @ y @ z),
% 1.36/1.09    inference('cnf.neg', [status(esa)], [prove_unordered_pair_is_subset_2])).
% 1.36/1.09  thf(zip_derived_cl92, plain, ( (member @ y @ z)),
% 1.36/1.09      inference('cnf', [status(esa)], [zf_stmt_1])).
% 1.36/1.09  thf(zip_derived_cl1519, plain,
% 1.36/1.09      ((((not_subclass_element @ (unordered_pair @ x @ y) @ z) = (x))
% 1.36/1.09        |  (subclass @ (unordered_pair @ x @ y) @ z))),
% 1.36/1.09      inference('demod', [status(thm)], [zip_derived_cl1516, zip_derived_cl92])).
% 1.36/1.09  thf(zip_derived_cl93, plain, (~ (subclass @ (unordered_pair @ x @ y) @ z)),
% 1.36/1.09      inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.36/1.09  thf(zip_derived_cl1527, plain,
% 1.36/1.09      (((not_subclass_element @ (unordered_pair @ x @ y) @ z) = (x))),
% 1.36/1.09      inference('clc', [status(thm)], [zip_derived_cl1519, zip_derived_cl93])).
% 1.36/1.09  thf(zip_derived_cl118, plain,
% 1.36/1.09      (![X0 : $i, X1 : $i]:
% 1.36/1.09         (~ (member @ (not_subclass_element @ X0 @ X1) @ X1)
% 1.36/1.09          |  (subclass @ X0 @ X1))),
% 1.36/1.09      inference('lazy_cnf_or', [status(thm)], [zip_derived_cl2])).
% 1.36/1.09  thf(zip_derived_cl1530, plain,
% 1.36/1.09      ((~ (member @ x @ z) |  (subclass @ (unordered_pair @ x @ y) @ z))),
% 1.36/1.09      inference('s_sup-', [status(thm)],
% 1.36/1.09                [zip_derived_cl1527, zip_derived_cl118])).
% 1.36/1.09  thf(prove_unordered_pair_is_subset_1, conjecture, (~( member @ x @ z ))).
% 1.36/1.09  thf(zf_stmt_2, negated_conjecture, (member @ x @ z),
% 1.36/1.09    inference('cnf.neg', [status(esa)], [prove_unordered_pair_is_subset_1])).
% 1.36/1.09  thf(zip_derived_cl91, plain, ( (member @ x @ z)),
% 1.36/1.09      inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.36/1.09  thf(zip_derived_cl1532, plain, ( (subclass @ (unordered_pair @ x @ y) @ z)),
% 1.36/1.09      inference('demod', [status(thm)], [zip_derived_cl1530, zip_derived_cl91])).
% 1.36/1.09  thf(zip_derived_cl1533, plain, ($false),
% 1.36/1.09      inference('demod', [status(thm)], [zip_derived_cl93, zip_derived_cl1532])).
% 1.36/1.09  
% 1.36/1.09  % SZS output end Refutation
% 1.36/1.09  
% 1.36/1.09  
% 1.36/1.09  % Terminating...
% 1.65/1.15  % Runner terminated.
% 1.65/1.17  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------