TSTP Solution File: SET071-7 by Zipperpin---2.1.9999

View Problem - Process Solution

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

% Computer : n010.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:25 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET071-7 : 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.cD6XqmzRWY true
% 0.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sat Aug 26 09:32:50 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % Running portfolio for 300 s
% 0.12/0.34  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34  % Number of cores: 8
% 0.12/0.34  % Python version: Python 3.6.8
% 0.12/0.34  % Running in FO mode
% 0.20/0.62  % Total configuration time : 435
% 0.20/0.62  % Estimated wc time : 1092
% 0.20/0.62  % Estimated cpu time (7 cpus) : 156.0
% 0.20/0.69  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.20/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.20/0.72  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.20/0.73  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.20/0.75  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.20/0.76  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 1.10/0.79  % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 1.10/0.79  % Solved by fo/fo7.sh.
% 1.10/0.79  % done 166 iterations in 0.050s
% 1.10/0.79  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.10/0.79  % SZS output start Refutation
% 1.10/0.79  thf(universal_class_type, type, universal_class: $i).
% 1.10/0.79  thf(null_class_type, type, null_class: $i).
% 1.10/0.79  thf(member_type, type, member: $i > $i > $o).
% 1.10/0.79  thf(unordered_pair_type, type, unordered_pair: $i > $i > $i).
% 1.10/0.79  thf(singleton_type, type, singleton: $i > $i).
% 1.10/0.79  thf(subclass_type, type, subclass: $i > $i > $o).
% 1.10/0.79  thf(x_type, type, x: $i).
% 1.10/0.79  thf(y_type, type, y: $i).
% 1.10/0.79  thf(not_subclass_element_type, type, not_subclass_element: $i > $i > $i).
% 1.10/0.79  thf(null_class_is_unique, axiom,
% 1.10/0.79    (( ( Z ) = ( null_class ) ) | 
% 1.10/0.79     ( member @ ( not_subclass_element @ Z @ null_class ) @ Z ))).
% 1.10/0.79  thf(zip_derived_cl60, plain,
% 1.10/0.79      (![X0 : $i]:
% 1.10/0.79         (((X0) = (null_class))
% 1.10/0.79          |  (member @ (not_subclass_element @ X0 @ null_class) @ X0))),
% 1.10/0.79      inference('cnf', [status(esa)], [null_class_is_unique])).
% 1.10/0.79  thf(singleton_set, axiom, (( unordered_pair @ X @ X ) = ( singleton @ X ))).
% 1.10/0.79  thf(zip_derived_cl11, plain,
% 1.10/0.79      (![X0 : $i]: ((unordered_pair @ X0 @ X0) = (singleton @ X0))),
% 1.10/0.79      inference('cnf', [status(esa)], [singleton_set])).
% 1.10/0.79  thf(unordered_pair_member, axiom,
% 1.10/0.79    (( ~( member @ U @ ( unordered_pair @ X @ Y ) ) ) | ( ( U ) = ( X ) ) | 
% 1.10/0.79     ( ( U ) = ( Y ) ))).
% 1.10/0.79  thf(zip_derived_cl7, plain,
% 1.10/0.79      (![X0 : $i, X1 : $i, X2 : $i]:
% 1.10/0.79         (~ (member @ X0 @ (unordered_pair @ X1 @ X2))
% 1.10/0.79          | ((X0) = (X1))
% 1.10/0.79          | ((X0) = (X2)))),
% 1.10/0.79      inference('cnf', [status(esa)], [unordered_pair_member])).
% 1.10/0.79  thf(zip_derived_cl132, plain,
% 1.10/0.79      (![X0 : $i, X1 : $i]:
% 1.10/0.79         (~ (member @ X1 @ (singleton @ X0)) | ((X1) = (X0)) | ((X1) = (X0)))),
% 1.10/0.79      inference('sup-', [status(thm)], [zip_derived_cl11, zip_derived_cl7])).
% 1.10/0.79  thf(zip_derived_cl133, plain,
% 1.10/0.79      (![X0 : $i, X1 : $i]:
% 1.10/0.79         (((X1) = (X0)) | ~ (member @ X1 @ (singleton @ X0)))),
% 1.10/0.79      inference('simplify', [status(thm)], [zip_derived_cl132])).
% 1.10/0.79  thf(zip_derived_cl205, plain,
% 1.10/0.79      (![X0 : $i]:
% 1.10/0.79         (((singleton @ X0) = (null_class))
% 1.10/0.79          | ((not_subclass_element @ (singleton @ X0) @ null_class) = (X0)))),
% 1.10/0.79      inference('sup-', [status(thm)], [zip_derived_cl60, zip_derived_cl133])).
% 1.10/0.79  thf(zip_derived_cl60, plain,
% 1.10/0.79      (![X0 : $i]:
% 1.10/0.79         (((X0) = (null_class))
% 1.10/0.79          |  (member @ (not_subclass_element @ X0 @ null_class) @ X0))),
% 1.10/0.79      inference('cnf', [status(esa)], [null_class_is_unique])).
% 1.10/0.79  thf(class_elements_are_sets, axiom, (subclass @ X @ universal_class)).
% 1.10/0.79  thf(zip_derived_cl3, plain, (![X0 : $i]:  (subclass @ X0 @ universal_class)),
% 1.10/0.79      inference('cnf', [status(esa)], [class_elements_are_sets])).
% 1.10/0.79  thf(subclass_members, axiom,
% 1.10/0.79    (( ~( subclass @ X @ Y ) ) | ( ~( member @ U @ X ) ) | ( member @ U @ Y ))).
% 1.10/0.79  thf(zip_derived_cl0, plain,
% 1.10/0.79      (![X0 : $i, X1 : $i, X2 : $i]:
% 1.10/0.79         (~ (subclass @ X0 @ X1) | ~ (member @ X2 @ X0) |  (member @ X2 @ X1))),
% 1.10/0.79      inference('cnf', [status(esa)], [subclass_members])).
% 1.10/0.79  thf(zip_derived_cl76, plain,
% 1.10/0.79      (![X0 : $i, X1 : $i]:
% 1.10/0.79         ( (member @ X1 @ universal_class) | ~ (member @ X1 @ X0))),
% 1.10/0.79      inference('sup-', [status(thm)], [zip_derived_cl3, zip_derived_cl0])).
% 1.10/0.79  thf(zip_derived_cl203, plain,
% 1.10/0.79      (![X0 : $i]:
% 1.10/0.79         (((X0) = (null_class))
% 1.10/0.79          |  (member @ (not_subclass_element @ X0 @ null_class) @ 
% 1.10/0.79              universal_class))),
% 1.10/0.79      inference('sup-', [status(thm)], [zip_derived_cl60, zip_derived_cl76])).
% 1.10/0.79  thf(zip_derived_cl291, plain,
% 1.10/0.79      (![X0 : $i]:
% 1.10/0.79         ( (member @ X0 @ universal_class)
% 1.10/0.79          | ((singleton @ X0) = (null_class))
% 1.10/0.79          | ((singleton @ X0) = (null_class)))),
% 1.10/0.79      inference('sup+', [status(thm)], [zip_derived_cl205, zip_derived_cl203])).
% 1.10/0.79  thf(zip_derived_cl295, plain,
% 1.10/0.79      (![X0 : $i]:
% 1.10/0.79         (((singleton @ X0) = (null_class)) |  (member @ X0 @ universal_class))),
% 1.10/0.79      inference('simplify', [status(thm)], [zip_derived_cl291])).
% 1.10/0.79  thf(prove_null_unordered_pair_2, conjecture, (member @ x @ universal_class)).
% 1.10/0.79  thf(zf_stmt_0, negated_conjecture, (~( member @ x @ universal_class )),
% 1.10/0.79    inference('cnf.neg', [status(esa)], [prove_null_unordered_pair_2])).
% 1.10/0.79  thf(zip_derived_cl68, plain, (~ (member @ x @ universal_class)),
% 1.10/0.79      inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.10/0.79  thf(zip_derived_cl321, plain, (((singleton @ x) = (null_class))),
% 1.10/0.79      inference('sup-', [status(thm)], [zip_derived_cl295, zip_derived_cl68])).
% 1.10/0.79  thf(unordered_pair_equals_singleton1, axiom,
% 1.10/0.79    (( member @ Y @ universal_class ) | 
% 1.10/0.79     ( ( unordered_pair @ X @ Y ) = ( singleton @ X ) ))).
% 1.10/0.79  thf(zip_derived_cl65, plain,
% 1.10/0.79      (![X0 : $i, X1 : $i]:
% 1.10/0.79         ( (member @ X0 @ universal_class)
% 1.10/0.79          | ((unordered_pair @ X1 @ X0) = (singleton @ X1)))),
% 1.10/0.79      inference('cnf', [status(esa)], [unordered_pair_equals_singleton1])).
% 1.10/0.79  thf(prove_null_unordered_pair_1, conjecture,
% 1.10/0.79    (( unordered_pair @ x @ y ) = ( null_class ))).
% 1.10/0.79  thf(zf_stmt_1, negated_conjecture,
% 1.10/0.79    (( unordered_pair @ x @ y ) != ( null_class )),
% 1.10/0.79    inference('cnf.neg', [status(esa)], [prove_null_unordered_pair_1])).
% 1.10/0.79  thf(zip_derived_cl69, plain, (((unordered_pair @ x @ y) != (null_class))),
% 1.10/0.79      inference('cnf', [status(esa)], [zf_stmt_1])).
% 1.10/0.79  thf(zip_derived_cl89, plain,
% 1.10/0.79      ((((singleton @ x) != (null_class)) |  (member @ y @ universal_class))),
% 1.10/0.79      inference('sup-', [status(thm)], [zip_derived_cl65, zip_derived_cl69])).
% 1.10/0.79  thf(prove_null_unordered_pair_3, conjecture, (member @ y @ universal_class)).
% 1.10/0.79  thf(zf_stmt_2, negated_conjecture, (~( member @ y @ universal_class )),
% 1.10/0.79    inference('cnf.neg', [status(esa)], [prove_null_unordered_pair_3])).
% 1.10/0.79  thf(zip_derived_cl67, plain, (~ (member @ y @ universal_class)),
% 1.10/0.79      inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.10/0.79  thf(zip_derived_cl95, plain, (((singleton @ x) != (null_class))),
% 1.10/0.79      inference('clc', [status(thm)], [zip_derived_cl89, zip_derived_cl67])).
% 1.10/0.79  thf(zip_derived_cl326, plain, ($false),
% 1.10/0.79      inference('simplify_reflect-', [status(thm)],
% 1.10/0.79                [zip_derived_cl321, zip_derived_cl95])).
% 1.10/0.79  
% 1.10/0.79  % SZS output end Refutation
% 1.10/0.79  
% 1.10/0.79  
% 1.10/0.79  % Terminating...
% 1.38/0.88  % Runner terminated.
% 1.38/0.89  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------