TSTP Solution File: SWC004-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SWC004-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.AO6HNHV7PE true
% Computer : n023.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:28:24 EDT 2023
% Result : Unsatisfiable 0.64s 0.85s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC004-1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.AO6HNHV7PE true
% 0.13/0.34 % Computer : n023.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 15:27:55 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.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in FO mode
% 0.62/0.66 % Total configuration time : 435
% 0.62/0.66 % Estimated wc time : 1092
% 0.62/0.66 % Estimated cpu time (7 cpus) : 156.0
% 0.62/0.79 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.62/0.79 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.62/0.79 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.62/0.79 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.62/0.79 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.62/0.79 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.62/0.80 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.64/0.85 % Solved by fo/fo7.sh.
% 0.64/0.85 % done 88 iterations in 0.042s
% 0.64/0.85 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.64/0.85 % SZS output start Refutation
% 0.64/0.85 thf(nil_type, type, nil: $i).
% 0.64/0.85 thf(cons_type, type, cons: $i > $i > $i).
% 0.64/0.85 thf(sk6_type, type, sk6: $i).
% 0.64/0.85 thf(sk2_type, type, sk2: $i).
% 0.64/0.85 thf(sk5_type, type, sk5: $i).
% 0.64/0.85 thf(sk4_type, type, sk4: $i).
% 0.64/0.85 thf(ssItem_type, type, ssItem: $i > $o).
% 0.64/0.85 thf(sk7_type, type, sk7: $i).
% 0.64/0.85 thf(sk3_type, type, sk3: $i).
% 0.64/0.85 thf(neq_type, type, neq: $i > $i > $o).
% 0.64/0.85 thf(app_type, type, app: $i > $i > $i).
% 0.64/0.85 thf(ssList_type, type, ssList: $i > $o).
% 0.64/0.85 thf(sk1_type, type, sk1: $i).
% 0.64/0.85 thf(clause86, axiom,
% 0.64/0.85 (( ~( ssItem @ U ) ) | ( ~( ssList @ V ) ) | ( ssList @ ( cons @ U @ V ) ))).
% 0.64/0.85 thf(zip_derived_cl4, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i]:
% 0.64/0.85 (~ (ssItem @ X0) | ~ (ssList @ X1) | (ssList @ (cons @ X0 @ X1)))),
% 0.64/0.85 inference('cnf', [status(esa)], [clause86])).
% 0.64/0.85 thf(co1_19, conjecture,
% 0.64/0.85 (~( ( ~( neq @ sk4 @ nil ) ) |
% 0.64/0.85 ( ( app @ ( app @ sk6 @ ( cons @ sk5 @ nil ) ) @ sk7 ) = ( sk4 ) ) ))).
% 0.64/0.85 thf(zf_stmt_0, negated_conjecture,
% 0.64/0.85 (( ~( neq @ sk4 @ nil ) ) |
% 0.64/0.85 ( ( app @ ( app @ sk6 @ ( cons @ sk5 @ nil ) ) @ sk7 ) = ( sk4 ) )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_19])).
% 0.64/0.85 thf(zip_derived_cl22, plain,
% 0.64/0.85 ((~ (neq @ sk4 @ nil)
% 0.64/0.85 | ((app @ (app @ sk6 @ (cons @ sk5 @ nil)) @ sk7) = (sk4)))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.64/0.85 thf(co1_5, conjecture, (( sk2 ) != ( sk4 ))).
% 0.64/0.85 thf(zf_stmt_1, negated_conjecture, (( sk2 ) = ( sk4 )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_5])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(co1_7, conjecture, (~( neq @ sk2 @ nil ))).
% 0.64/0.85 thf(zf_stmt_2, negated_conjecture, (neq @ sk2 @ nil),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_7])).
% 0.64/0.85 thf(zip_derived_cl34, plain, ( (neq @ sk2 @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(zip_derived_cl137, plain,
% 0.64/0.85 (((app @ (app @ sk6 @ (cons @ sk5 @ nil)) @ sk7) = (sk2))),
% 0.64/0.85 inference('demod', [status(thm)],
% 0.64/0.85 [zip_derived_cl22, zip_derived_cl36, zip_derived_cl34,
% 0.64/0.85 zip_derived_cl36])).
% 0.64/0.85 thf(co1_20, conjecture,
% 0.64/0.85 (~( ( ~( neq @ sk4 @ nil ) ) | ( ( app @ sk6 @ sk7 ) = ( sk3 ) ) ))).
% 0.64/0.85 thf(zf_stmt_3, negated_conjecture,
% 0.64/0.85 (( ~( neq @ sk4 @ nil ) ) | ( ( app @ sk6 @ sk7 ) = ( sk3 ) )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_20])).
% 0.64/0.85 thf(zip_derived_cl21, plain,
% 0.64/0.85 ((~ (neq @ sk4 @ nil) | ((app @ sk6 @ sk7) = (sk3)))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_3])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(zip_derived_cl34, plain, ( (neq @ sk2 @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/0.85 thf(co1_6, conjecture, (( sk1 ) != ( sk3 ))).
% 0.64/0.85 thf(zf_stmt_4, negated_conjecture, (( sk1 ) = ( sk3 )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_6])).
% 0.64/0.85 thf(zip_derived_cl35, plain, (((sk1) = (sk3))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_4])).
% 0.64/0.85 thf(zip_derived_cl53, plain, (((app @ sk6 @ sk7) = (sk1))),
% 0.64/0.85 inference('demod', [status(thm)],
% 0.64/0.85 [zip_derived_cl21, zip_derived_cl36, zip_derived_cl34,
% 0.64/0.85 zip_derived_cl35])).
% 0.64/0.85 thf(clause100, axiom,
% 0.64/0.85 (( ~( ssList @ U ) ) | ( ~( ssList @ V ) ) | ( neq @ V @ U ) |
% 0.64/0.85 ( ( V ) = ( U ) ))).
% 0.64/0.85 thf(zip_derived_cl7, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i]:
% 0.64/0.85 (~ (ssList @ X0) | ~ (ssList @ X1) | (neq @ X1 @ X0) | ((X1) = (X0)))),
% 0.64/0.85 inference('cnf', [status(esa)], [clause100])).
% 0.64/0.85 thf(co1_15, conjecture,
% 0.64/0.85 (~( ( ~( neq @ sk4 @ nil ) ) | ( ~( neq @ B @ nil ) ) |
% 0.64/0.85 ( ( app @ A @ C ) != ( sk1 ) ) |
% 0.64/0.85 ( ( app @ ( app @ A @ B ) @ C ) != ( sk2 ) ) | ( ~( ssList @ C ) ) |
% 0.64/0.85 ( ~( ssList @ B ) ) | ( ~( ssList @ A ) ) ))).
% 0.64/0.85 thf(zf_stmt_5, negated_conjecture,
% 0.64/0.85 (( ~( neq @ sk4 @ nil ) ) | ( ~( neq @ B @ nil ) ) |
% 0.64/0.85 ( ( app @ A @ C ) != ( sk1 ) ) |
% 0.64/0.85 ( ( app @ ( app @ A @ B ) @ C ) != ( sk2 ) ) | ( ~( ssList @ C ) ) |
% 0.64/0.85 ( ~( ssList @ B ) ) | ( ~( ssList @ A ) )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_15])).
% 0.64/0.85 thf(zip_derived_cl26, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.85 (~ (neq @ sk4 @ nil)
% 0.64/0.85 | ~ (neq @ X0 @ nil)
% 0.64/0.85 | ((app @ X1 @ X2) != (sk1))
% 0.64/0.85 | ((app @ (app @ X1 @ X0) @ X2) != (sk2))
% 0.64/0.85 | ~ (ssList @ X2)
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ X1))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_5])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(zip_derived_cl34, plain, ( (neq @ sk2 @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/0.85 thf(zip_derived_cl55, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.85 (~ (neq @ X0 @ nil)
% 0.64/0.85 | ((app @ X1 @ X2) != (sk1))
% 0.64/0.85 | ((app @ (app @ X1 @ X0) @ X2) != (sk2))
% 0.64/0.85 | ~ (ssList @ X2)
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ X1))),
% 0.64/0.85 inference('demod', [status(thm)],
% 0.64/0.85 [zip_derived_cl26, zip_derived_cl36, zip_derived_cl34])).
% 0.64/0.85 thf(zip_derived_cl208, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.85 (((X0) = (nil))
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ nil)
% 0.64/0.85 | ~ (ssList @ X1)
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ X2)
% 0.64/0.85 | ((app @ (app @ X1 @ X0) @ X2) != (sk2))
% 0.64/0.85 | ((app @ X1 @ X2) != (sk1)))),
% 0.64/0.85 inference('sup-', [status(thm)], [zip_derived_cl7, zip_derived_cl55])).
% 0.64/0.85 thf(clause8, axiom, (ssList @ nil)).
% 0.64/0.85 thf(zip_derived_cl0, plain, ( (ssList @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [clause8])).
% 0.64/0.85 thf(zip_derived_cl211, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.85 (((X0) = (nil))
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ X1)
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ X2)
% 0.64/0.85 | ((app @ (app @ X1 @ X0) @ X2) != (sk2))
% 0.64/0.85 | ((app @ X1 @ X2) != (sk1)))),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl208, zip_derived_cl0])).
% 0.64/0.85 thf(zip_derived_cl212, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.85 (((app @ X1 @ X2) != (sk1))
% 0.64/0.85 | ((app @ (app @ X1 @ X0) @ X2) != (sk2))
% 0.64/0.85 | ~ (ssList @ X2)
% 0.64/0.85 | ~ (ssList @ X1)
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ((X0) = (nil)))),
% 0.64/0.85 inference('simplify', [status(thm)], [zip_derived_cl211])).
% 0.64/0.85 thf(zip_derived_cl258, plain,
% 0.64/0.85 (![X0 : $i]:
% 0.64/0.85 (((sk1) != (sk1))
% 0.64/0.85 | ((X0) = (nil))
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ~ (ssList @ sk6)
% 0.64/0.85 | ~ (ssList @ sk7)
% 0.64/0.85 | ((app @ (app @ sk6 @ X0) @ sk7) != (sk2)))),
% 0.64/0.85 inference('sup-', [status(thm)], [zip_derived_cl53, zip_derived_cl212])).
% 0.64/0.85 thf(co1_17, conjecture, (~( ( ~( neq @ sk4 @ nil ) ) | ( ssList @ sk6 ) ))).
% 0.64/0.85 thf(zf_stmt_6, negated_conjecture,
% 0.64/0.85 (( ~( neq @ sk4 @ nil ) ) | ( ssList @ sk6 )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_17])).
% 0.64/0.85 thf(zip_derived_cl24, plain, ((~ (neq @ sk4 @ nil) | (ssList @ sk6))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_6])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(zip_derived_cl46, plain, ((~ (neq @ sk2 @ nil) | (ssList @ sk6))),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl24, zip_derived_cl36])).
% 0.64/0.85 thf(zip_derived_cl34, plain, ( (neq @ sk2 @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/0.85 thf(zip_derived_cl51, plain, ( (ssList @ sk6)),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl46, zip_derived_cl34])).
% 0.64/0.85 thf(co1_18, conjecture, (~( ( ~( neq @ sk4 @ nil ) ) | ( ssList @ sk7 ) ))).
% 0.64/0.85 thf(zf_stmt_7, negated_conjecture,
% 0.64/0.85 (( ~( neq @ sk4 @ nil ) ) | ( ssList @ sk7 )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_18])).
% 0.64/0.85 thf(zip_derived_cl23, plain, ((~ (neq @ sk4 @ nil) | (ssList @ sk7))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_7])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(zip_derived_cl45, plain, ((~ (neq @ sk2 @ nil) | (ssList @ sk7))),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl23, zip_derived_cl36])).
% 0.64/0.85 thf(zip_derived_cl34, plain, ( (neq @ sk2 @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/0.85 thf(zip_derived_cl50, plain, ( (ssList @ sk7)),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl45, zip_derived_cl34])).
% 0.64/0.85 thf(zip_derived_cl266, plain,
% 0.64/0.85 (![X0 : $i]:
% 0.64/0.85 (((sk1) != (sk1))
% 0.64/0.85 | ((X0) = (nil))
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ((app @ (app @ sk6 @ X0) @ sk7) != (sk2)))),
% 0.64/0.85 inference('demod', [status(thm)],
% 0.64/0.85 [zip_derived_cl258, zip_derived_cl51, zip_derived_cl50])).
% 0.64/0.85 thf(zip_derived_cl267, plain,
% 0.64/0.85 (![X0 : $i]:
% 0.64/0.85 (((app @ (app @ sk6 @ X0) @ sk7) != (sk2))
% 0.64/0.85 | ~ (ssList @ X0)
% 0.64/0.85 | ((X0) = (nil)))),
% 0.64/0.85 inference('simplify', [status(thm)], [zip_derived_cl266])).
% 0.64/0.85 thf(zip_derived_cl268, plain,
% 0.64/0.85 ((((sk2) != (sk2))
% 0.64/0.85 | ((cons @ sk5 @ nil) = (nil))
% 0.64/0.85 | ~ (ssList @ (cons @ sk5 @ nil)))),
% 0.64/0.85 inference('sup-', [status(thm)], [zip_derived_cl137, zip_derived_cl267])).
% 0.64/0.85 thf(zip_derived_cl271, plain,
% 0.64/0.85 ((~ (ssList @ (cons @ sk5 @ nil)) | ((cons @ sk5 @ nil) = (nil)))),
% 0.64/0.85 inference('simplify', [status(thm)], [zip_derived_cl268])).
% 0.64/0.85 thf(zip_derived_cl274, plain,
% 0.64/0.85 ((~ (ssList @ nil) | ~ (ssItem @ sk5) | ((cons @ sk5 @ nil) = (nil)))),
% 0.64/0.85 inference('sup-', [status(thm)], [zip_derived_cl4, zip_derived_cl271])).
% 0.64/0.85 thf(zip_derived_cl0, plain, ( (ssList @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [clause8])).
% 0.64/0.85 thf(co1_16, conjecture, (~( ( ~( neq @ sk4 @ nil ) ) | ( ssItem @ sk5 ) ))).
% 0.64/0.85 thf(zf_stmt_8, negated_conjecture,
% 0.64/0.85 (( ~( neq @ sk4 @ nil ) ) | ( ssItem @ sk5 )),
% 0.64/0.85 inference('cnf.neg', [status(esa)], [co1_16])).
% 0.64/0.85 thf(zip_derived_cl25, plain, ((~ (neq @ sk4 @ nil) | (ssItem @ sk5))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_8])).
% 0.64/0.85 thf(zip_derived_cl36, plain, (((sk2) = (sk4))),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/0.85 thf(zip_derived_cl47, plain, ((~ (neq @ sk2 @ nil) | (ssItem @ sk5))),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl25, zip_derived_cl36])).
% 0.64/0.85 thf(zip_derived_cl34, plain, ( (neq @ sk2 @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/0.85 thf(zip_derived_cl52, plain, ( (ssItem @ sk5)),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl47, zip_derived_cl34])).
% 0.64/0.85 thf(zip_derived_cl275, plain, (((cons @ sk5 @ nil) = (nil))),
% 0.64/0.85 inference('demod', [status(thm)],
% 0.64/0.85 [zip_derived_cl274, zip_derived_cl0, zip_derived_cl52])).
% 0.64/0.85 thf(clause98, axiom,
% 0.64/0.85 (( ( cons @ U @ V ) != ( nil ) ) | ( ~( ssItem @ U ) ) |
% 0.64/0.85 ( ~( ssList @ V ) ))).
% 0.64/0.85 thf(zip_derived_cl5, plain,
% 0.64/0.85 (![X0 : $i, X1 : $i]:
% 0.64/0.85 (((cons @ X0 @ X1) != (nil)) | ~ (ssItem @ X0) | ~ (ssList @ X1))),
% 0.64/0.85 inference('cnf', [status(esa)], [clause98])).
% 0.64/0.85 thf(zip_derived_cl284, plain,
% 0.64/0.85 ((((nil) != (nil)) | ~ (ssList @ nil) | ~ (ssItem @ sk5))),
% 0.64/0.85 inference('sup-', [status(thm)], [zip_derived_cl275, zip_derived_cl5])).
% 0.64/0.85 thf(zip_derived_cl0, plain, ( (ssList @ nil)),
% 0.64/0.85 inference('cnf', [status(esa)], [clause8])).
% 0.64/0.85 thf(zip_derived_cl52, plain, ( (ssItem @ sk5)),
% 0.64/0.85 inference('demod', [status(thm)], [zip_derived_cl47, zip_derived_cl34])).
% 0.64/0.85 thf(zip_derived_cl295, plain, (((nil) != (nil))),
% 0.64/0.85 inference('demod', [status(thm)],
% 0.64/0.85 [zip_derived_cl284, zip_derived_cl0, zip_derived_cl52])).
% 0.64/0.85 thf(zip_derived_cl296, plain, ($false),
% 0.64/0.85 inference('simplify', [status(thm)], [zip_derived_cl295])).
% 0.64/0.85
% 0.64/0.85 % SZS output end Refutation
% 0.64/0.85
% 0.64/0.85
% 0.64/0.85 % Terminating...
% 1.64/0.89 % Runner terminated.
% 1.64/0.90 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------