TSTP Solution File: SWC166-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SWC166-1 : TPTP v8.1.2. Released v2.4.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.Oes2ttnvZW true
% Computer : n011.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 21:29:36 EDT 2023
% Result : Unsatisfiable 1.40s 1.38s
% Output : Refutation 1.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWC166-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Oes2ttnvZW true
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Aug 28 17:58:56 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % Running portfolio for 300 s
% 0.15/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.35 % Number of cores: 8
% 0.15/0.36 % Python version: Python 3.6.8
% 0.15/0.36 % Running in FO mode
% 0.21/0.68 % Total configuration time : 435
% 0.21/0.68 % Estimated wc time : 1092
% 0.21/0.68 % Estimated cpu time (7 cpus) : 156.0
% 0.94/0.71 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.94/0.74 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.94/0.76 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.94/0.77 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.94/0.79 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.94/0.80 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.38/0.86 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.40/1.38 % Solved by fo/fo13.sh.
% 1.40/1.38 % done 592 iterations in 0.547s
% 1.40/1.38 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.40/1.38 % SZS output start Refutation
% 1.40/1.38 thf(nil_type, type, nil: $i).
% 1.40/1.38 thf(cons_type, type, cons: $i > $i > $i).
% 1.40/1.38 thf(sk8_type, type, sk8: $i).
% 1.40/1.38 thf(sk6_type, type, sk6: $i).
% 1.40/1.38 thf(duplicatefreeP_type, type, duplicatefreeP: $i > $o).
% 1.40/1.38 thf(ssItem_type, type, ssItem: $i > $o).
% 1.40/1.38 thf(skaf44_type, type, skaf44: $i > $i).
% 1.40/1.38 thf(sk5_type, type, sk5: $i).
% 1.40/1.38 thf(sk3_type, type, sk3: $i).
% 1.40/1.38 thf(neq_type, type, neq: $i > $i > $o).
% 1.40/1.38 thf(app_type, type, app: $i > $i > $i).
% 1.40/1.38 thf(ssList_type, type, ssList: $i > $o).
% 1.40/1.38 thf(sk7_type, type, sk7: $i).
% 1.40/1.38 thf(sk1_type, type, sk1: $i).
% 1.40/1.38 thf(singletonP_type, type, singletonP: $i > $o).
% 1.40/1.38 thf(clause86, axiom,
% 1.40/1.38 (( ~( ssItem @ U ) ) | ( ~( ssList @ V ) ) | ( ssList @ ( cons @ U @ V ) ))).
% 1.40/1.38 thf(zip_derived_cl85, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i]:
% 1.40/1.38 (~ (ssItem @ X0) | ~ (ssList @ X1) | (ssList @ (cons @ X0 @ X1)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause86])).
% 1.40/1.38 thf(clause85, axiom,
% 1.40/1.38 (( ~( ssList @ U ) ) | ( ~( ssList @ V ) ) | ( ssList @ ( app @ V @ U ) ))).
% 1.40/1.38 thf(zip_derived_cl84, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i]:
% 1.40/1.38 (~ (ssList @ X0) | ~ (ssList @ X1) | (ssList @ (app @ X1 @ X0)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause85])).
% 1.40/1.38 thf(clause120, axiom,
% 1.40/1.38 (( ~( ssItem @ U ) ) | ( ~( ssList @ V ) ) |
% 1.40/1.38 ( ( app @ ( cons @ U @ nil ) @ V ) = ( cons @ U @ V ) ))).
% 1.40/1.38 thf(zip_derived_cl119, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i]:
% 1.40/1.38 (~ (ssItem @ X0)
% 1.40/1.38 | ~ (ssList @ X1)
% 1.40/1.38 | ((app @ (cons @ X0 @ nil) @ X1) = (cons @ X0 @ X1)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause120])).
% 1.40/1.38 thf(zip_derived_cl85, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i]:
% 1.40/1.38 (~ (ssItem @ X0) | ~ (ssList @ X1) | (ssList @ (cons @ X0 @ X1)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause86])).
% 1.40/1.38 thf(co1_12, conjecture,
% 1.40/1.38 (( app @
% 1.40/1.38 ( app @ ( app @ sk7 @ ( cons @ sk5 @ nil ) ) @ ( cons @ sk6 @ nil ) ) @
% 1.40/1.38 sk8 ) !=
% 1.40/1.38 ( sk1 ))).
% 1.40/1.38 thf(zf_stmt_0, negated_conjecture,
% 1.40/1.38 (( app @
% 1.40/1.38 ( app @ ( app @ sk7 @ ( cons @ sk5 @ nil ) ) @ ( cons @ sk6 @ nil ) ) @
% 1.40/1.38 sk8 ) =
% 1.40/1.38 ( sk1 )),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_12])).
% 1.40/1.38 thf(zip_derived_cl196, plain,
% 1.40/1.38 (((app @ (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @ (cons @ sk6 @ nil)) @
% 1.40/1.38 sk8) = (sk1))),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.40/1.38 thf(clause102, axiom,
% 1.40/1.38 (( ~( ssItem @ U ) ) | ( ~( ssItem @ V ) ) | ( neq @ V @ U ) |
% 1.40/1.38 ( ( V ) = ( U ) ))).
% 1.40/1.38 thf(zip_derived_cl101, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i]:
% 1.40/1.38 (~ (ssItem @ X0) | ~ (ssItem @ X1) | (neq @ X1 @ X0) | ((X1) = (X0)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause102])).
% 1.40/1.38 thf(co1_13, conjecture, (neq @ sk5 @ sk6)).
% 1.40/1.38 thf(zf_stmt_1, negated_conjecture, (~( neq @ sk5 @ sk6 )),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_13])).
% 1.40/1.38 thf(zip_derived_cl197, plain, (~ (neq @ sk5 @ sk6)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_1])).
% 1.40/1.38 thf(zip_derived_cl299, plain,
% 1.40/1.38 ((((sk5) = (sk6)) | ~ (ssItem @ sk5) | ~ (ssItem @ sk6))),
% 1.40/1.38 inference('s_sup-', [status(thm)], [zip_derived_cl101, zip_derived_cl197])).
% 1.40/1.38 thf(co1_8, conjecture, (~( ssItem @ sk5 ))).
% 1.40/1.38 thf(zf_stmt_2, negated_conjecture, (ssItem @ sk5),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_8])).
% 1.40/1.38 thf(zip_derived_cl192, plain, ( (ssItem @ sk5)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.40/1.38 thf(co1_9, conjecture, (~( ssItem @ sk6 ))).
% 1.40/1.38 thf(zf_stmt_3, negated_conjecture, (ssItem @ sk6),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_9])).
% 1.40/1.38 thf(zip_derived_cl193, plain, ( (ssItem @ sk6)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_3])).
% 1.40/1.38 thf(zip_derived_cl302, plain, (((sk5) = (sk6))),
% 1.40/1.38 inference('demod', [status(thm)],
% 1.40/1.38 [zip_derived_cl299, zip_derived_cl192, zip_derived_cl193])).
% 1.40/1.38 thf(zip_derived_cl304, plain,
% 1.40/1.38 (((app @ (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @ (cons @ sk5 @ nil)) @
% 1.40/1.38 sk8) = (sk1))),
% 1.40/1.38 inference('demod', [status(thm)], [zip_derived_cl196, zip_derived_cl302])).
% 1.40/1.38 thf(clause149, axiom,
% 1.40/1.38 (( ~( ssList @ U ) ) | ( ~( ssList @ V ) ) | ( ~( ssList @ W ) ) |
% 1.40/1.38 ( ( app @ ( app @ W @ V ) @ U ) = ( app @ W @ ( app @ V @ U ) ) ))).
% 1.40/1.38 thf(zip_derived_cl148, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.40/1.38 (~ (ssList @ X0)
% 1.40/1.38 | ~ (ssList @ X1)
% 1.40/1.38 | ~ (ssList @ X2)
% 1.40/1.38 | ((app @ (app @ X2 @ X1) @ X0) = (app @ X2 @ (app @ X1 @ X0))))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause149])).
% 1.40/1.38 thf(zip_derived_cl1357, plain,
% 1.40/1.38 ((~ (ssList @ sk8)
% 1.40/1.38 | ~ (ssList @ (cons @ sk5 @ nil))
% 1.40/1.38 | ~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1)
% 1.40/1.38 = (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @
% 1.40/1.38 (app @ (cons @ sk5 @ nil) @ sk8))))),
% 1.40/1.38 inference('s_sup+', [status(thm)], [zip_derived_cl304, zip_derived_cl148])).
% 1.40/1.38 thf(co1_11, conjecture, (~( ssList @ sk8 ))).
% 1.40/1.38 thf(zf_stmt_4, negated_conjecture, (ssList @ sk8),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_11])).
% 1.40/1.38 thf(zip_derived_cl195, plain, ( (ssList @ sk8)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_4])).
% 1.40/1.38 thf(zip_derived_cl1369, plain,
% 1.40/1.38 ((~ (ssList @ (cons @ sk5 @ nil))
% 1.40/1.38 | ~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1)
% 1.40/1.38 = (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @
% 1.40/1.38 (app @ (cons @ sk5 @ nil) @ sk8))))),
% 1.40/1.38 inference('demod', [status(thm)], [zip_derived_cl1357, zip_derived_cl195])).
% 1.40/1.38 thf(zip_derived_cl3558, plain,
% 1.40/1.38 ((~ (ssList @ nil)
% 1.40/1.38 | ~ (ssItem @ sk5)
% 1.40/1.38 | ~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1)
% 1.40/1.38 = (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @
% 1.40/1.38 (app @ (cons @ sk5 @ nil) @ sk8))))),
% 1.40/1.38 inference('s_sup-', [status(thm)], [zip_derived_cl85, zip_derived_cl1369])).
% 1.40/1.38 thf(clause8, axiom, (ssList @ nil)).
% 1.40/1.38 thf(zip_derived_cl7, plain, ( (ssList @ nil)),
% 1.40/1.38 inference('cnf', [status(esa)], [clause8])).
% 1.40/1.38 thf(zip_derived_cl192, plain, ( (ssItem @ sk5)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.40/1.38 thf(zip_derived_cl3561, plain,
% 1.40/1.38 ((~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1)
% 1.40/1.38 = (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @
% 1.40/1.38 (app @ (cons @ sk5 @ nil) @ sk8))))),
% 1.40/1.38 inference('demod', [status(thm)],
% 1.40/1.38 [zip_derived_cl3558, zip_derived_cl7, zip_derived_cl192])).
% 1.40/1.38 thf(zip_derived_cl3588, plain,
% 1.40/1.38 ((~ (ssList @ sk8)
% 1.40/1.38 | ~ (ssItem @ sk5)
% 1.40/1.38 | ~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1)
% 1.40/1.38 = (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @ (cons @ sk5 @ sk8))))),
% 1.40/1.38 inference('s_sup+', [status(thm)],
% 1.40/1.38 [zip_derived_cl119, zip_derived_cl3561])).
% 1.40/1.38 thf(zip_derived_cl195, plain, ( (ssList @ sk8)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_4])).
% 1.40/1.38 thf(zip_derived_cl192, plain, ( (ssItem @ sk5)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.40/1.38 thf(zip_derived_cl3590, plain,
% 1.40/1.38 ((~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1)
% 1.40/1.38 = (app @ (app @ sk7 @ (cons @ sk5 @ nil)) @ (cons @ sk5 @ sk8))))),
% 1.40/1.38 inference('demod', [status(thm)],
% 1.40/1.38 [zip_derived_cl3588, zip_derived_cl195, zip_derived_cl192])).
% 1.40/1.38 thf(clause179, axiom,
% 1.40/1.38 (( ( app @ ( app @ U @ ( cons @ V @ W ) ) @ ( cons @ V @ X ) ) != ( Y ) ) |
% 1.40/1.38 ( ~( ssList @ X ) ) | ( ~( ssList @ W ) ) | ( ~( ssList @ U ) ) |
% 1.40/1.38 ( ~( ssItem @ V ) ) | ( ~( duplicatefreeP @ Y ) ) | ( ~( ssList @ Y ) ))).
% 1.40/1.38 thf(zip_derived_cl178, plain,
% 1.40/1.38 (![X0 : $i, X1 : $i, X2 : $i, X3 : $i, X4 : $i]:
% 1.40/1.38 (((app @ (app @ X1 @ (cons @ X2 @ X3)) @ (cons @ X2 @ X4)) != (X0))
% 1.40/1.38 | ~ (ssList @ X4)
% 1.40/1.38 | ~ (ssList @ X3)
% 1.40/1.38 | ~ (ssList @ X1)
% 1.40/1.38 | ~ (ssItem @ X2)
% 1.40/1.38 | ~ (duplicatefreeP @ X0)
% 1.40/1.38 | ~ (ssList @ X0))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause179])).
% 1.40/1.38 thf(zip_derived_cl3676, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1) != (X0))
% 1.40/1.38 | ~ (ssList @ sk8)
% 1.40/1.38 | ~ (ssList @ nil)
% 1.40/1.38 | ~ (ssList @ sk7)
% 1.40/1.38 | ~ (ssItem @ sk5)
% 1.40/1.38 | ~ (duplicatefreeP @ X0)
% 1.40/1.38 | ~ (ssList @ X0))),
% 1.40/1.38 inference('s_sup-', [status(thm)],
% 1.40/1.38 [zip_derived_cl3590, zip_derived_cl178])).
% 1.40/1.38 thf(zip_derived_cl195, plain, ( (ssList @ sk8)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_4])).
% 1.40/1.38 thf(zip_derived_cl7, plain, ( (ssList @ nil)),
% 1.40/1.38 inference('cnf', [status(esa)], [clause8])).
% 1.40/1.38 thf(co1_10, conjecture, (~( ssList @ sk7 ))).
% 1.40/1.38 thf(zf_stmt_5, negated_conjecture, (ssList @ sk7),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_10])).
% 1.40/1.38 thf(zip_derived_cl194, plain, ( (ssList @ sk7)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_5])).
% 1.40/1.38 thf(zip_derived_cl192, plain, ( (ssItem @ sk5)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.40/1.38 thf(zip_derived_cl3721, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ (app @ sk7 @ (cons @ sk5 @ nil)))
% 1.40/1.38 | ((sk1) != (X0))
% 1.40/1.38 | ~ (duplicatefreeP @ X0)
% 1.40/1.38 | ~ (ssList @ X0))),
% 1.40/1.38 inference('demod', [status(thm)],
% 1.40/1.38 [zip_derived_cl3676, zip_derived_cl195, zip_derived_cl7,
% 1.40/1.38 zip_derived_cl194, zip_derived_cl192])).
% 1.40/1.38 thf(zip_derived_cl3736, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ sk7)
% 1.40/1.38 | ~ (ssList @ (cons @ sk5 @ nil))
% 1.40/1.38 | ((sk1) != (X0))
% 1.40/1.38 | ~ (duplicatefreeP @ X0)
% 1.40/1.38 | ~ (ssList @ X0))),
% 1.40/1.38 inference('s_sup-', [status(thm)], [zip_derived_cl84, zip_derived_cl3721])).
% 1.40/1.38 thf(zip_derived_cl194, plain, ( (ssList @ sk7)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_5])).
% 1.40/1.38 thf(zip_derived_cl3737, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ (cons @ sk5 @ nil))
% 1.40/1.38 | ((sk1) != (X0))
% 1.40/1.38 | ~ (duplicatefreeP @ X0)
% 1.40/1.38 | ~ (ssList @ X0))),
% 1.40/1.38 inference('demod', [status(thm)], [zip_derived_cl3736, zip_derived_cl194])).
% 1.40/1.38 thf(zip_derived_cl3738, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ nil)
% 1.40/1.38 | ~ (ssItem @ sk5)
% 1.40/1.38 | ((sk1) != (X0))
% 1.40/1.38 | ~ (duplicatefreeP @ X0)
% 1.40/1.38 | ~ (ssList @ X0))),
% 1.40/1.38 inference('s_sup-', [status(thm)], [zip_derived_cl85, zip_derived_cl3737])).
% 1.40/1.38 thf(zip_derived_cl7, plain, ( (ssList @ nil)),
% 1.40/1.38 inference('cnf', [status(esa)], [clause8])).
% 1.40/1.38 thf(zip_derived_cl192, plain, ( (ssItem @ sk5)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_2])).
% 1.40/1.38 thf(zip_derived_cl3739, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (((sk1) != (X0)) | ~ (duplicatefreeP @ X0) | ~ (ssList @ X0))),
% 1.40/1.38 inference('demod', [status(thm)],
% 1.40/1.38 [zip_derived_cl3738, zip_derived_cl7, zip_derived_cl192])).
% 1.40/1.38 thf(zip_derived_cl3740, plain,
% 1.40/1.38 ((~ (ssList @ sk1) | ~ (duplicatefreeP @ sk1))),
% 1.40/1.38 inference('eq_res', [status(thm)], [zip_derived_cl3739])).
% 1.40/1.38 thf(co1_1, conjecture, (~( ssList @ sk1 ))).
% 1.40/1.38 thf(zf_stmt_6, negated_conjecture, (ssList @ sk1),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_1])).
% 1.40/1.38 thf(zip_derived_cl185, plain, ( (ssList @ sk1)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_6])).
% 1.40/1.38 thf(co1_7, conjecture, (~( singletonP @ sk3 ))).
% 1.40/1.38 thf(zf_stmt_7, negated_conjecture, (singletonP @ sk3),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_7])).
% 1.40/1.38 thf(zip_derived_cl191, plain, ( (singletonP @ sk3)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_7])).
% 1.40/1.38 thf(co1_6, conjecture, (( sk1 ) != ( sk3 ))).
% 1.40/1.38 thf(zf_stmt_8, negated_conjecture, (( sk1 ) = ( sk3 )),
% 1.40/1.38 inference('cnf.neg', [status(esa)], [co1_6])).
% 1.40/1.38 thf(zip_derived_cl190, plain, (((sk1) = (sk3))),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_8])).
% 1.40/1.38 thf(zip_derived_cl200, plain, ( (singletonP @ sk1)),
% 1.40/1.38 inference('demod', [status(thm)], [zip_derived_cl191, zip_derived_cl190])).
% 1.40/1.38 thf(clause101, axiom,
% 1.40/1.38 (( ~( singletonP @ U ) ) | ( ~( ssList @ U ) ) |
% 1.40/1.38 ( ( cons @ ( skaf44 @ U ) @ nil ) = ( U ) ))).
% 1.40/1.38 thf(zip_derived_cl100, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (singletonP @ X0)
% 1.40/1.38 | ~ (ssList @ X0)
% 1.40/1.38 | ((cons @ (skaf44 @ X0) @ nil) = (X0)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause101])).
% 1.40/1.38 thf(clause65, axiom,
% 1.40/1.38 (( ~( ssItem @ U ) ) | ( duplicatefreeP @ ( cons @ U @ nil ) ))).
% 1.40/1.38 thf(zip_derived_cl64, plain,
% 1.40/1.38 (![X0 : $i]: (~ (ssItem @ X0) | (duplicatefreeP @ (cons @ X0 @ nil)))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause65])).
% 1.40/1.38 thf(zip_derived_cl266, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ X0)
% 1.40/1.38 | ~ (singletonP @ X0)
% 1.40/1.38 | ~ (ssItem @ (skaf44 @ X0))
% 1.40/1.38 | (duplicatefreeP @ X0))),
% 1.40/1.38 inference('s_sup+', [status(thm)], [zip_derived_cl100, zip_derived_cl64])).
% 1.40/1.38 thf(clause47, axiom, (ssItem @ ( skaf44 @ U ))).
% 1.40/1.38 thf(zip_derived_cl46, plain, (![X0 : $i]: (ssItem @ (skaf44 @ X0))),
% 1.40/1.38 inference('cnf', [status(esa)], [clause47])).
% 1.40/1.38 thf(zip_derived_cl277, plain,
% 1.40/1.38 (![X0 : $i]:
% 1.40/1.38 (~ (ssList @ X0) | ~ (singletonP @ X0) | (duplicatefreeP @ X0))),
% 1.40/1.38 inference('demod', [status(thm)], [zip_derived_cl266, zip_derived_cl46])).
% 1.40/1.38 thf(zip_derived_cl314, plain, ((~ (ssList @ sk1) | (duplicatefreeP @ sk1))),
% 1.40/1.38 inference('s_sup-', [status(thm)], [zip_derived_cl200, zip_derived_cl277])).
% 1.40/1.38 thf(zip_derived_cl185, plain, ( (ssList @ sk1)),
% 1.40/1.38 inference('cnf', [status(esa)], [zf_stmt_6])).
% 1.40/1.38 thf(zip_derived_cl315, plain, ( (duplicatefreeP @ sk1)),
% 1.40/1.38 inference('demod', [status(thm)], [zip_derived_cl314, zip_derived_cl185])).
% 1.40/1.38 thf(zip_derived_cl3741, plain, ($false),
% 1.40/1.38 inference('demod', [status(thm)],
% 1.40/1.38 [zip_derived_cl3740, zip_derived_cl185, zip_derived_cl315])).
% 1.40/1.38
% 1.40/1.38 % SZS output end Refutation
% 1.40/1.38
% 1.40/1.38
% 1.40/1.38 % Terminating...
% 1.98/1.47 % Runner terminated.
% 1.98/1.48 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------