TSTP Solution File: SWC013-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SWC013-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.IhJSW5naBn true
% Computer : n001.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:29 EDT 2023
% Result : Unsatisfiable 0.90s 0.78s
% Output : Refutation 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWC013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.IhJSW5naBn true
% 0.15/0.35 % Computer : n001.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 16:28:50 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.35 % Python version: Python 3.6.8
% 0.15/0.35 % Running in FO mode
% 0.21/0.66 % Total configuration time : 435
% 0.21/0.66 % Estimated wc time : 1092
% 0.21/0.66 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.90/0.78 % Solved by fo/fo3_bce.sh.
% 0.90/0.78 % BCE start: 71
% 0.90/0.78 % BCE eliminated: 1
% 0.90/0.78 % PE start: 70
% 0.90/0.78 logic: eq
% 0.90/0.78 % PE eliminated: 0
% 0.90/0.78 % done 48 iterations in 0.039s
% 0.90/0.78 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.90/0.78 % SZS output start Refutation
% 0.90/0.78 thf(nil_type, type, nil: $i).
% 0.90/0.78 thf(cons_type, type, cons: $i > $i > $i).
% 0.90/0.78 thf(sk2_type, type, sk2: $i).
% 0.90/0.78 thf(sk4_type, type, sk4: $i).
% 0.90/0.78 thf(hd_type, type, hd: $i > $i).
% 0.90/0.78 thf(ssItem_type, type, ssItem: $i > $o).
% 0.90/0.78 thf(sk3_type, type, sk3: $i).
% 0.90/0.78 thf(neq_type, type, neq: $i > $i > $o).
% 0.90/0.78 thf(ssList_type, type, ssList: $i > $o).
% 0.90/0.78 thf(sk1_type, type, sk1: $i).
% 0.90/0.78 thf(clause76, axiom,
% 0.90/0.78 (( ~( ssList @ U ) ) | ( ssItem @ ( hd @ U ) ) | ( ( nil ) = ( U ) ))).
% 0.90/0.78 thf(zip_derived_cl10, plain,
% 0.90/0.78 (![X0 : $i]: (~ (ssList @ X0) | (ssItem @ (hd @ X0)) | ((nil) = (X0)))),
% 0.90/0.78 inference('cnf', [status(esa)], [clause76])).
% 0.90/0.78 thf(clause86, axiom,
% 0.90/0.78 (( ~( ssItem @ U ) ) | ( ~( ssList @ V ) ) | ( ssList @ ( cons @ U @ V ) ))).
% 0.90/0.78 thf(zip_derived_cl14, plain,
% 0.90/0.78 (![X0 : $i, X1 : $i]:
% 0.90/0.78 (~ (ssItem @ X0) | ~ (ssList @ X1) | (ssList @ (cons @ X0 @ X1)))),
% 0.90/0.79 inference('cnf', [status(esa)], [clause86])).
% 0.90/0.79 thf(clause100, axiom,
% 0.90/0.79 (( ~( ssList @ U ) ) | ( ~( ssList @ V ) ) | ( neq @ V @ U ) |
% 0.90/0.79 ( ( V ) = ( U ) ))).
% 0.90/0.79 thf(zip_derived_cl21, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (~ (ssList @ X0) | ~ (ssList @ X1) | (neq @ X1 @ X0) | ((X1) = (X0)))),
% 0.90/0.79 inference('cnf', [status(esa)], [clause100])).
% 0.90/0.79 thf(co1_11, conjecture,
% 0.90/0.79 (~( ( ~( neq @ sk4 @ nil ) ) | ( ~( neq @ nil @ sk4 ) ) |
% 0.90/0.79 ( ( hd @ sk4 ) != ( B ) ) | ( ( cons @ B @ nil ) != ( A ) ) |
% 0.90/0.79 ( ~( ssItem @ B ) ) | ( ( sk3 ) = ( A ) ) | ( ~( ssList @ A ) ) ))).
% 0.90/0.79 thf(zf_stmt_0, negated_conjecture,
% 0.90/0.79 (( ~( neq @ sk4 @ nil ) ) | ( ~( neq @ nil @ sk4 ) ) |
% 0.90/0.79 ( ( hd @ sk4 ) != ( B ) ) | ( ( cons @ B @ nil ) != ( A ) ) |
% 0.90/0.79 ( ~( ssItem @ B ) ) | ( ( sk3 ) = ( A ) ) | ( ~( ssList @ A ) )),
% 0.90/0.79 inference('cnf.neg', [status(esa)], [co1_11])).
% 0.90/0.79 thf(zip_derived_cl60, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (~ (neq @ sk4 @ nil)
% 0.90/0.79 | ~ (neq @ nil @ sk4)
% 0.90/0.79 | ((hd @ sk4) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((sk3) = (X1))
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.90/0.79 thf(co1_5, conjecture, (( sk2 ) != ( sk4 ))).
% 0.90/0.79 thf(zf_stmt_1, negated_conjecture, (( sk2 ) = ( sk4 )),
% 0.90/0.79 inference('cnf.neg', [status(esa)], [co1_5])).
% 0.90/0.79 thf(zip_derived_cl66, plain, (((sk2) = (sk4))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.90/0.79 thf(co1_7, conjecture, (~( neq @ sk2 @ nil ))).
% 0.90/0.79 thf(zf_stmt_2, negated_conjecture, (neq @ sk2 @ nil),
% 0.90/0.79 inference('cnf.neg', [status(esa)], [co1_7])).
% 0.90/0.79 thf(zip_derived_cl64, plain, ( (neq @ sk2 @ nil)),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.90/0.79 thf(zip_derived_cl66, plain, (((sk2) = (sk4))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.90/0.79 thf(zip_derived_cl66, plain, (((sk2) = (sk4))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.90/0.79 thf(co1_6, conjecture, (( sk1 ) != ( sk3 ))).
% 0.90/0.79 thf(zf_stmt_3, negated_conjecture, (( sk1 ) = ( sk3 )),
% 0.90/0.79 inference('cnf.neg', [status(esa)], [co1_6])).
% 0.90/0.79 thf(zip_derived_cl65, plain, (((sk1) = (sk3))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_3])).
% 0.90/0.79 thf(zip_derived_cl573, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (~ (neq @ nil @ sk2)
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((sk1) = (X1))
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('demod', [status(thm)],
% 0.90/0.79 [zip_derived_cl60, zip_derived_cl66, zip_derived_cl64,
% 0.90/0.79 zip_derived_cl66, zip_derived_cl66, zip_derived_cl65])).
% 0.90/0.79 thf(co1_12, conjecture,
% 0.90/0.79 (~( ( ~( neq @ sk4 @ nil ) ) | ( ~( neq @ nil @ sk2 ) ) |
% 0.90/0.79 ( ( hd @ sk2 ) != ( B ) ) | ( ( cons @ B @ nil ) != ( A ) ) |
% 0.90/0.79 ( ~( ssItem @ B ) ) | ( ( sk1 ) != ( A ) ) | ( ~( ssList @ A ) ) ))).
% 0.90/0.79 thf(zf_stmt_4, negated_conjecture,
% 0.90/0.79 (( ~( neq @ sk4 @ nil ) ) | ( ~( neq @ nil @ sk2 ) ) |
% 0.90/0.79 ( ( hd @ sk2 ) != ( B ) ) | ( ( cons @ B @ nil ) != ( A ) ) |
% 0.90/0.79 ( ~( ssItem @ B ) ) | ( ( sk1 ) != ( A ) ) | ( ~( ssList @ A ) )),
% 0.90/0.79 inference('cnf.neg', [status(esa)], [co1_12])).
% 0.90/0.79 thf(zip_derived_cl59, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (~ (neq @ sk4 @ nil)
% 0.90/0.79 | ~ (neq @ nil @ sk2)
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((sk1) != (X1))
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_4])).
% 0.90/0.79 thf(zip_derived_cl66, plain, (((sk2) = (sk4))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.90/0.79 thf(zip_derived_cl64, plain, ( (neq @ sk2 @ nil)),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.90/0.79 thf(zip_derived_cl552, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (~ (neq @ nil @ sk2)
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((sk1) != (X1))
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('demod', [status(thm)],
% 0.90/0.79 [zip_derived_cl59, zip_derived_cl66, zip_derived_cl64])).
% 0.90/0.79 thf(zip_derived_cl574, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (~ (ssList @ X1)
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ~ (neq @ nil @ sk2))),
% 0.90/0.79 inference('clc', [status(thm)], [zip_derived_cl573, zip_derived_cl552])).
% 0.90/0.79 thf(zip_derived_cl588, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (((nil) = (sk2))
% 0.90/0.79 | ~ (ssList @ nil)
% 0.90/0.79 | ~ (ssList @ sk2)
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('sup-', [status(thm)], [zip_derived_cl21, zip_derived_cl574])).
% 0.90/0.79 thf(clause8, axiom, (ssList @ nil)).
% 0.90/0.79 thf(zip_derived_cl2, plain, ( (ssList @ nil)),
% 0.90/0.79 inference('cnf', [status(esa)], [clause8])).
% 0.90/0.79 thf(co1_4, conjecture, (~( ssList @ sk4 ))).
% 0.90/0.79 thf(zf_stmt_5, negated_conjecture, (ssList @ sk4),
% 0.90/0.79 inference('cnf.neg', [status(esa)], [co1_4])).
% 0.90/0.79 thf(zip_derived_cl67, plain, ( (ssList @ sk4)),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_5])).
% 0.90/0.79 thf(zip_derived_cl66, plain, (((sk2) = (sk4))),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.90/0.79 thf(zip_derived_cl545, plain, ( (ssList @ sk2)),
% 0.90/0.79 inference('demod', [status(thm)], [zip_derived_cl67, zip_derived_cl66])).
% 0.90/0.79 thf(zip_derived_cl593, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (((nil) = (sk2))
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('demod', [status(thm)],
% 0.90/0.79 [zip_derived_cl588, zip_derived_cl2, zip_derived_cl545])).
% 0.90/0.79 thf(zip_derived_cl64, plain, ( (neq @ sk2 @ nil)),
% 0.90/0.79 inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.90/0.79 thf(clause115, axiom,
% 0.90/0.79 (( ( U ) != ( V ) ) | ( ~( neq @ U @ V ) ) | ( ~( ssList @ V ) ) |
% 0.90/0.79 ( ~( ssList @ U ) ))).
% 0.90/0.79 thf(zip_derived_cl29, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (((X1) != (X0))
% 0.90/0.79 | ~ (neq @ X1 @ X0)
% 0.90/0.79 | ~ (ssList @ X0)
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('cnf', [status(esa)], [clause115])).
% 0.90/0.79 thf(zip_derived_cl549, plain,
% 0.90/0.79 ((~ (ssList @ sk2) | ~ (ssList @ nil) | ((sk2) != (nil)))),
% 0.90/0.79 inference('sup-', [status(thm)], [zip_derived_cl64, zip_derived_cl29])).
% 0.90/0.79 thf(zip_derived_cl545, plain, ( (ssList @ sk2)),
% 0.90/0.79 inference('demod', [status(thm)], [zip_derived_cl67, zip_derived_cl66])).
% 0.90/0.79 thf(zip_derived_cl2, plain, ( (ssList @ nil)),
% 0.90/0.79 inference('cnf', [status(esa)], [clause8])).
% 0.90/0.79 thf(zip_derived_cl550, plain, (((sk2) != (nil))),
% 0.90/0.79 inference('demod', [status(thm)],
% 0.90/0.79 [zip_derived_cl549, zip_derived_cl545, zip_derived_cl2])).
% 0.90/0.79 thf(zip_derived_cl594, plain,
% 0.90/0.79 (![X0 : $i, X1 : $i]:
% 0.90/0.79 (((hd @ sk2) != (X0))
% 0.90/0.79 | ((cons @ X0 @ nil) != (X1))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ~ (ssList @ X1))),
% 0.90/0.79 inference('simplify_reflect-', [status(thm)],
% 0.90/0.79 [zip_derived_cl593, zip_derived_cl550])).
% 0.90/0.79 thf(zip_derived_cl595, plain,
% 0.90/0.79 (![X0 : $i]:
% 0.90/0.79 (~ (ssList @ (cons @ X0 @ nil))
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((hd @ sk2) != (X0)))),
% 0.90/0.79 inference('eq_res', [status(thm)], [zip_derived_cl594])).
% 0.90/0.79 thf(zip_derived_cl597, plain,
% 0.90/0.79 (![X0 : $i]:
% 0.90/0.79 (~ (ssList @ nil)
% 0.90/0.79 | ~ (ssItem @ X0)
% 0.90/0.79 | ((hd @ sk2) != (X0))
% 0.90/0.79 | ~ (ssItem @ X0))),
% 0.90/0.79 inference('sup-', [status(thm)], [zip_derived_cl14, zip_derived_cl595])).
% 0.90/0.79 thf(zip_derived_cl2, plain, ( (ssList @ nil)),
% 0.90/0.79 inference('cnf', [status(esa)], [clause8])).
% 0.90/0.79 thf(zip_derived_cl598, plain,
% 0.90/0.79 (![X0 : $i]: (~ (ssItem @ X0) | ((hd @ sk2) != (X0)) | ~ (ssItem @ X0))),
% 0.90/0.79 inference('demod', [status(thm)], [zip_derived_cl597, zip_derived_cl2])).
% 0.90/0.79 thf(zip_derived_cl599, plain,
% 0.90/0.79 (![X0 : $i]: (((hd @ sk2) != (X0)) | ~ (ssItem @ X0))),
% 0.90/0.79 inference('simplify', [status(thm)], [zip_derived_cl598])).
% 0.90/0.79 thf(zip_derived_cl602, plain,
% 0.90/0.79 (![X0 : $i]:
% 0.90/0.79 (((nil) = (X0)) | ~ (ssList @ X0) | ((hd @ sk2) != (hd @ X0)))),
% 0.90/0.79 inference('sup-', [status(thm)], [zip_derived_cl10, zip_derived_cl599])).
% 0.90/0.79 thf(zip_derived_cl604, plain, ((~ (ssList @ sk2) | ((nil) = (sk2)))),
% 0.90/0.79 inference('eq_res', [status(thm)], [zip_derived_cl602])).
% 0.90/0.79 thf(zip_derived_cl545, plain, ( (ssList @ sk2)),
% 0.90/0.79 inference('demod', [status(thm)], [zip_derived_cl67, zip_derived_cl66])).
% 0.90/0.79 thf(zip_derived_cl605, plain, (((nil) = (sk2))),
% 0.90/0.79 inference('demod', [status(thm)], [zip_derived_cl604, zip_derived_cl545])).
% 0.90/0.79 thf(zip_derived_cl550, plain, (((sk2) != (nil))),
% 0.90/0.79 inference('demod', [status(thm)],
% 0.90/0.79 [zip_derived_cl549, zip_derived_cl545, zip_derived_cl2])).
% 0.90/0.79 thf(zip_derived_cl606, plain, ($false),
% 0.90/0.79 inference('simplify_reflect-', [status(thm)],
% 0.90/0.79 [zip_derived_cl605, zip_derived_cl550])).
% 0.90/0.79
% 0.90/0.79 % SZS output end Refutation
% 0.90/0.79
% 0.90/0.79
% 0.90/0.79 % Terminating...
% 1.43/0.86 % Runner terminated.
% 1.43/0.87 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------