TSTP Solution File: SET018-3 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET018-3 : TPTP v8.1.2. Released v1.0.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.CwituKQCog true
% Computer : n020.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:11:48 EDT 2023
% Result : Unsatisfiable 1.44s 1.03s
% Output : Refutation 1.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET018-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.CwituKQCog true
% 0.10/0.30 % Computer : n020.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat Aug 26 12:38:29 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % Running portfolio for 300 s
% 0.10/0.31 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.31 % Number of cores: 8
% 0.10/0.31 % Python version: Python 3.6.8
% 0.10/0.31 % Running in FO mode
% 0.15/0.56 % Total configuration time : 435
% 0.15/0.56 % Estimated wc time : 1092
% 0.15/0.56 % Estimated cpu time (7 cpus) : 156.0
% 0.15/0.66 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.15/0.66 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.15/0.66 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.15/0.66 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.15/0.66 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.15/0.67 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.15/0.67 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.18/0.76 % /export/starexec/sandbox/solver/bin/fo/fo17_bce.sh running for 50s
% 1.18/0.77 % /export/starexec/sandbox/solver/bin/fo/fo1_lcnf.sh running for 50s
% 1.44/1.03 % /export/starexec/sandbox/solver/bin/fo/fo8.sh running for 50s
% 1.44/1.03 % Solved by fo/fo17_bce.sh.
% 1.44/1.03 % BCE start: 149
% 1.44/1.03 % BCE eliminated: 1
% 1.44/1.03 % PE start: 148
% 1.44/1.03 logic: eq
% 1.44/1.03 % PE eliminated: -3
% 1.44/1.03 % done 135 iterations in 0.167s
% 1.44/1.03 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.44/1.03 % SZS output start Refutation
% 1.44/1.03 thf(singleton_set_type, type, singleton_set: $i > $i).
% 1.44/1.03 thf(a_type, type, a: $i).
% 1.44/1.03 thf(non_ordered_pair_type, type, non_ordered_pair: $i > $i > $i).
% 1.44/1.03 thf(ordered_pair_type, type, ordered_pair: $i > $i > $i).
% 1.44/1.03 thf(little_set_type, type, little_set: $i > $o).
% 1.44/1.03 thf(c_type, type, c: $i).
% 1.44/1.03 thf(b_type, type, b: $i).
% 1.44/1.03 thf(d_type, type, d: $i).
% 1.44/1.03 thf(equal_ordered_pair, axiom,
% 1.44/1.03 (( ordered_pair @ a @ b ) = ( ordered_pair @ c @ d ))).
% 1.44/1.03 thf(zip_derived_cl147, plain,
% 1.44/1.03 (((ordered_pair @ a @ b) = (ordered_pair @ c @ d))),
% 1.44/1.03 inference('cnf', [status(esa)], [equal_ordered_pair])).
% 1.44/1.03 thf(zip_derived_cl147, plain,
% 1.44/1.03 (((ordered_pair @ a @ b) = (ordered_pair @ c @ d))),
% 1.44/1.03 inference('cnf', [status(esa)], [equal_ordered_pair])).
% 1.44/1.03 thf(first_components_are_equal, axiom,
% 1.44/1.03 (( ~( little_set @ X ) ) | ( ~( little_set @ U ) ) |
% 1.44/1.03 ( ( ordered_pair @ X @ Y ) != ( ordered_pair @ U @ V ) ) |
% 1.44/1.03 ( ( X ) = ( U ) ))).
% 1.44/1.03 thf(zip_derived_cl141, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i, X3 : $i]:
% 1.44/1.03 (~ (little_set @ X0)
% 1.44/1.03 | ~ (little_set @ X1)
% 1.44/1.03 | ((ordered_pair @ X0 @ X3) != (ordered_pair @ X1 @ X2))
% 1.44/1.03 | ((X0) = (X1)))),
% 1.44/1.03 inference('cnf', [status(esa)], [first_components_are_equal])).
% 1.44/1.03 thf(zip_derived_cl958, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]:
% 1.44/1.03 (~ (little_set @ X1)
% 1.44/1.03 | ~ (little_set @ c)
% 1.44/1.03 | ((ordered_pair @ X1 @ X0) != (ordered_pair @ a @ b))
% 1.44/1.03 | ((X1) = (c)))),
% 1.44/1.03 inference('s_sup-', [status(thm)], [zip_derived_cl147, zip_derived_cl141])).
% 1.44/1.03 thf(c_little_set, axiom, (little_set @ c)).
% 1.44/1.03 thf(zip_derived_cl145, plain, ( (little_set @ c)),
% 1.44/1.03 inference('cnf', [status(esa)], [c_little_set])).
% 1.44/1.03 thf(zip_derived_cl960, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]:
% 1.44/1.03 (~ (little_set @ X1)
% 1.44/1.03 | ((ordered_pair @ X1 @ X0) != (ordered_pair @ a @ b))
% 1.44/1.03 | ((X1) = (c)))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl958, zip_derived_cl145])).
% 1.44/1.03 thf(zip_derived_cl963, plain, ((((a) = (c)) | ~ (little_set @ a))),
% 1.44/1.03 inference('eq_res', [status(thm)], [zip_derived_cl960])).
% 1.44/1.03 thf(a_little_set, axiom, (little_set @ a)).
% 1.44/1.03 thf(zip_derived_cl143, plain, ( (little_set @ a)),
% 1.44/1.03 inference('cnf', [status(esa)], [a_little_set])).
% 1.44/1.03 thf(zip_derived_cl964, plain, (((a) = (c))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl963, zip_derived_cl143])).
% 1.44/1.03 thf(zip_derived_cl980, plain,
% 1.44/1.03 (((ordered_pair @ a @ b) = (ordered_pair @ a @ d))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl147, zip_derived_cl964])).
% 1.44/1.03 thf(ordered_pair, axiom,
% 1.44/1.03 (( ordered_pair @ X @ Y ) =
% 1.44/1.03 ( non_ordered_pair @ ( singleton_set @ X ) @ ( non_ordered_pair @ X @ Y ) ))).
% 1.44/1.03 thf(zip_derived_cl9, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]:
% 1.44/1.03 ((ordered_pair @ X0 @ X1)
% 1.44/1.03 = (non_ordered_pair @ (singleton_set @ X0) @
% 1.44/1.03 (non_ordered_pair @ X0 @ X1)))),
% 1.44/1.03 inference('cnf', [status(esa)], [ordered_pair])).
% 1.44/1.03 thf(zip_derived_cl9, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]:
% 1.44/1.03 ((ordered_pair @ X0 @ X1)
% 1.44/1.03 = (non_ordered_pair @ (singleton_set @ X0) @
% 1.44/1.03 (non_ordered_pair @ X0 @ X1)))),
% 1.44/1.03 inference('cnf', [status(esa)], [ordered_pair])).
% 1.44/1.03 thf(left_cancellation, axiom,
% 1.44/1.03 (( ~( little_set @ X ) ) | ( ~( little_set @ Y ) ) |
% 1.44/1.03 ( ( non_ordered_pair @ Z @ X ) != ( non_ordered_pair @ Z @ Y ) ) |
% 1.44/1.03 ( ( X ) = ( Y ) ))).
% 1.44/1.03 thf(zip_derived_cl142, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.44/1.03 (~ (little_set @ X0)
% 1.44/1.03 | ~ (little_set @ X1)
% 1.44/1.03 | ((non_ordered_pair @ X2 @ X0) != (non_ordered_pair @ X2 @ X1))
% 1.44/1.03 | ((X0) = (X1)))),
% 1.44/1.03 inference('cnf', [status(esa)], [left_cancellation])).
% 1.44/1.03 thf(zip_derived_cl1075, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.44/1.03 (~ (little_set @ X2)
% 1.44/1.03 | ~ (little_set @ (non_ordered_pair @ X1 @ X0))
% 1.44/1.03 | ((non_ordered_pair @ (singleton_set @ X1) @ X2)
% 1.44/1.03 != (ordered_pair @ X1 @ X0))
% 1.44/1.03 | ((X2) = (non_ordered_pair @ X1 @ X0)))),
% 1.44/1.03 inference('s_sup-', [status(thm)], [zip_derived_cl9, zip_derived_cl142])).
% 1.44/1.03 thf(non_ordered_pair4, axiom, (little_set @ ( non_ordered_pair @ X @ Y ))).
% 1.44/1.03 thf(zip_derived_cl7, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]: (little_set @ (non_ordered_pair @ X0 @ X1))),
% 1.44/1.03 inference('cnf', [status(esa)], [non_ordered_pair4])).
% 1.44/1.03 thf(zip_derived_cl1081, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.44/1.03 (~ (little_set @ X2)
% 1.44/1.03 | ((non_ordered_pair @ (singleton_set @ X1) @ X2)
% 1.44/1.03 != (ordered_pair @ X1 @ X0))
% 1.44/1.03 | ((X2) = (non_ordered_pair @ X1 @ X0)))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl1075, zip_derived_cl7])).
% 1.44/1.03 thf(zip_derived_cl1089, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.44/1.03 (~ (little_set @ (non_ordered_pair @ X1 @ X0))
% 1.44/1.03 | ((ordered_pair @ X1 @ X0) != (ordered_pair @ X1 @ X2))
% 1.44/1.03 | ((non_ordered_pair @ X1 @ X0) = (non_ordered_pair @ X1 @ X2)))),
% 1.44/1.03 inference('s_sup-', [status(thm)], [zip_derived_cl9, zip_derived_cl1081])).
% 1.44/1.03 thf(zip_derived_cl7, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]: (little_set @ (non_ordered_pair @ X0 @ X1))),
% 1.44/1.03 inference('cnf', [status(esa)], [non_ordered_pair4])).
% 1.44/1.03 thf(zip_derived_cl1092, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.44/1.03 (((ordered_pair @ X1 @ X0) != (ordered_pair @ X1 @ X2))
% 1.44/1.03 | ((non_ordered_pair @ X1 @ X0) = (non_ordered_pair @ X1 @ X2)))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl1089, zip_derived_cl7])).
% 1.44/1.03 thf(zip_derived_cl1182, plain,
% 1.44/1.03 (![X0 : $i]:
% 1.44/1.03 (((ordered_pair @ a @ b) != (ordered_pair @ a @ X0))
% 1.44/1.03 | ((non_ordered_pair @ a @ d) = (non_ordered_pair @ a @ X0)))),
% 1.44/1.03 inference('s_sup-', [status(thm)],
% 1.44/1.03 [zip_derived_cl980, zip_derived_cl1092])).
% 1.44/1.03 thf(zip_derived_cl142, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.44/1.03 (~ (little_set @ X0)
% 1.44/1.03 | ~ (little_set @ X1)
% 1.44/1.03 | ((non_ordered_pair @ X2 @ X0) != (non_ordered_pair @ X2 @ X1))
% 1.44/1.03 | ((X0) = (X1)))),
% 1.44/1.03 inference('cnf', [status(esa)], [left_cancellation])).
% 1.44/1.03 thf(zip_derived_cl1212, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]:
% 1.44/1.03 (((ordered_pair @ a @ b) != (ordered_pair @ a @ X0))
% 1.44/1.03 | ~ (little_set @ X1)
% 1.44/1.03 | ~ (little_set @ d)
% 1.44/1.03 | ((non_ordered_pair @ a @ X1) != (non_ordered_pair @ a @ X0))
% 1.44/1.03 | ((X1) = (d)))),
% 1.44/1.03 inference('s_sup-', [status(thm)],
% 1.44/1.03 [zip_derived_cl1182, zip_derived_cl142])).
% 1.44/1.03 thf(d_little_set, axiom, (little_set @ d)).
% 1.44/1.03 thf(zip_derived_cl146, plain, ( (little_set @ d)),
% 1.44/1.03 inference('cnf', [status(esa)], [d_little_set])).
% 1.44/1.03 thf(zip_derived_cl1229, plain,
% 1.44/1.03 (![X0 : $i, X1 : $i]:
% 1.44/1.03 (((ordered_pair @ a @ b) != (ordered_pair @ a @ X0))
% 1.44/1.03 | ~ (little_set @ X1)
% 1.44/1.03 | ((non_ordered_pair @ a @ X1) != (non_ordered_pair @ a @ X0))
% 1.44/1.03 | ((X1) = (d)))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl1212, zip_derived_cl146])).
% 1.44/1.03 thf(zip_derived_cl1237, plain,
% 1.44/1.03 (![X0 : $i]:
% 1.44/1.03 (((X0) = (d))
% 1.44/1.03 | ~ (little_set @ X0)
% 1.44/1.03 | ((ordered_pair @ a @ b) != (ordered_pair @ a @ X0)))),
% 1.44/1.03 inference('eq_res', [status(thm)], [zip_derived_cl1229])).
% 1.44/1.03 thf(zip_derived_cl1298, plain, ((~ (little_set @ b) | ((b) = (d)))),
% 1.44/1.03 inference('eq_res', [status(thm)], [zip_derived_cl1237])).
% 1.44/1.03 thf(b_little_set, axiom, (little_set @ b)).
% 1.44/1.03 thf(zip_derived_cl144, plain, ( (little_set @ b)),
% 1.44/1.03 inference('cnf', [status(esa)], [b_little_set])).
% 1.44/1.03 thf(zip_derived_cl1299, plain, (((b) = (d))),
% 1.44/1.03 inference('demod', [status(thm)], [zip_derived_cl1298, zip_derived_cl144])).
% 1.44/1.03 thf(prove_second_components_equal, conjecture, (( b ) = ( d ))).
% 1.44/1.03 thf(zf_stmt_0, negated_conjecture, (( b ) != ( d )),
% 1.44/1.03 inference('cnf.neg', [status(esa)], [prove_second_components_equal])).
% 1.44/1.03 thf(zip_derived_cl148, plain, (((b) != (d))),
% 1.44/1.03 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.44/1.03 thf(zip_derived_cl1300, plain, ($false),
% 1.44/1.03 inference('simplify_reflect-', [status(thm)],
% 1.44/1.03 [zip_derived_cl1299, zip_derived_cl148])).
% 1.44/1.03
% 1.44/1.03 % SZS output end Refutation
% 1.44/1.03
% 1.44/1.03
% 1.44/1.03 % Terminating...
% 1.46/1.15 % Runner terminated.
% 1.46/1.17 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------