TSTP Solution File: SWC357-1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SWC357-1 : TPTP v8.1.2. Released v2.4.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.aYBaRUDrxc true

% Computer : n018.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:30:59 EDT 2023

% Result   : Unsatisfiable 0.64s 1.35s
% Output   : Refutation 0.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.16  % Problem  : SWC357-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.17  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.aYBaRUDrxc true
% 0.17/0.38  % Computer : n018.cluster.edu
% 0.17/0.38  % Model    : x86_64 x86_64
% 0.17/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38  % Memory   : 8042.1875MB
% 0.17/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38  % CPULimit : 300
% 0.17/0.38  % WCLimit  : 300
% 0.17/0.38  % DateTime : Mon Aug 28 16:29:02 EDT 2023
% 0.17/0.38  % CPUTime  : 
% 0.17/0.38  % Running portfolio for 300 s
% 0.17/0.38  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.38  % Number of cores: 8
% 0.17/0.38  % Python version: Python 3.6.8
% 0.17/0.39  % Running in FO mode
% 0.59/0.70  % Total configuration time : 435
% 0.59/0.70  % Estimated wc time : 1092
% 0.59/0.70  % Estimated cpu time (7 cpus) : 156.0
% 0.60/0.79  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.60/0.79  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.60/0.80  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.60/0.80  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.60/0.80  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.60/0.80  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.60/0.81  % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.64/1.35  % Solved by fo/fo6_bce.sh.
% 0.64/1.35  % BCE start: 197
% 0.64/1.35  % BCE eliminated: 3
% 0.64/1.35  % PE start: 194
% 0.64/1.35  logic: eq
% 0.64/1.35  % PE eliminated: 6
% 0.64/1.35  % done 288 iterations in 0.522s
% 0.64/1.35  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.64/1.35  % SZS output start Refutation
% 0.64/1.35  thf(nil_type, type, nil: $i).
% 0.64/1.35  thf(frontsegP_type, type, frontsegP: $i > $i > $o).
% 0.64/1.35  thf(sk2_type, type, sk2: $i).
% 0.64/1.35  thf(skaf45_type, type, skaf45: $i > $i > $i).
% 0.64/1.35  thf(sk4_type, type, sk4: $i).
% 0.64/1.35  thf(sk3_type, type, sk3: $i).
% 0.64/1.35  thf(neq_type, type, neq: $i > $i > $o).
% 0.64/1.35  thf(app_type, type, app: $i > $i > $i).
% 0.64/1.35  thf(ssList_type, type, ssList: $i > $o).
% 0.64/1.35  thf(sk1_type, type, sk1: $i).
% 0.64/1.35  thf(segmentP_type, type, segmentP: $i > $i > $o).
% 0.64/1.35  thf(clause132, axiom,
% 0.64/1.35    (( ~( frontsegP @ U @ V ) ) | ( ~( ssList @ V ) ) | ( ~( ssList @ U ) ) | 
% 0.64/1.35     ( ( app @ V @ ( skaf45 @ U @ V ) ) = ( U ) ))).
% 0.64/1.35  thf(zip_derived_cl131, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i]:
% 0.64/1.35         (~ (frontsegP @ X0 @ X1)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ~ (ssList @ X0)
% 0.64/1.35          | ((app @ X1 @ (skaf45 @ X0 @ X1)) = (X0)))),
% 0.64/1.35      inference('cnf', [status(esa)], [clause132])).
% 0.64/1.35  thf(clause74, axiom, (( ~( ssList @ U ) ) | ( ( app @ nil @ U ) = ( U ) ))).
% 0.64/1.35  thf(zip_derived_cl73, plain,
% 0.64/1.35      (![X0 : $i]: (~ (ssList @ X0) | ((app @ nil @ X0) = (X0)))),
% 0.64/1.35      inference('cnf', [status(esa)], [clause74])).
% 0.64/1.35  thf(clause173, axiom,
% 0.64/1.35    (( ( app @ ( app @ U @ V ) @ W ) != ( X ) ) | ( ~( ssList @ W ) ) | 
% 0.64/1.35     ( ~( ssList @ U ) ) | ( ~( ssList @ V ) ) | ( ~( ssList @ X ) ) | 
% 0.64/1.35     ( segmentP @ X @ V ))).
% 0.64/1.35  thf(zip_derived_cl172, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i, X3 : $i]:
% 0.64/1.35         (((app @ (app @ X1 @ X2) @ X3) != (X0))
% 0.64/1.35          | ~ (ssList @ X3)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ~ (ssList @ X0)
% 0.64/1.35          |  (segmentP @ X0 @ X2))),
% 0.64/1.35      inference('cnf', [status(esa)], [clause173])).
% 0.64/1.35  thf(zip_derived_cl2541, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/1.35         (~ (ssList @ X0)
% 0.64/1.35          | ((app @ X0 @ X2) != (X1))
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ~ (ssList @ nil)
% 0.64/1.35          | ~ (ssList @ X0)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          |  (segmentP @ X1 @ X0))),
% 0.64/1.35      inference('s_sup-', [status(thm)], [zip_derived_cl73, zip_derived_cl172])).
% 0.64/1.35  thf(clause8, axiom, (ssList @ nil)).
% 0.64/1.35  thf(zip_derived_cl7, plain, ( (ssList @ nil)),
% 0.64/1.35      inference('cnf', [status(esa)], [clause8])).
% 0.64/1.35  thf(zip_derived_cl2561, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/1.35         (~ (ssList @ X0)
% 0.64/1.35          | ((app @ X0 @ X2) != (X1))
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ~ (ssList @ X0)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          |  (segmentP @ X1 @ X0))),
% 0.64/1.35      inference('demod', [status(thm)], [zip_derived_cl2541, zip_derived_cl7])).
% 0.64/1.35  thf(zip_derived_cl2562, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/1.35         ( (segmentP @ X1 @ X0)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ((app @ X0 @ X2) != (X1))
% 0.64/1.35          | ~ (ssList @ X0))),
% 0.64/1.35      inference('simplify', [status(thm)], [zip_derived_cl2561])).
% 0.64/1.35  thf(zip_derived_cl2574, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/1.35         (~ (ssList @ X0)
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ~ (frontsegP @ X0 @ X2)
% 0.64/1.35          |  (segmentP @ X1 @ X2)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ~ (ssList @ (skaf45 @ X0 @ X2))
% 0.64/1.35          | ((X0) != (X1))
% 0.64/1.35          | ~ (ssList @ X2))),
% 0.64/1.35      inference('s_sup-', [status(thm)],
% 0.64/1.35                [zip_derived_cl131, zip_derived_cl2562])).
% 0.64/1.35  thf(clause51, axiom, (ssList @ ( skaf45 @ U @ V ))).
% 0.64/1.35  thf(zip_derived_cl50, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i]:  (ssList @ (skaf45 @ X0 @ X1))),
% 0.64/1.35      inference('cnf', [status(esa)], [clause51])).
% 0.64/1.35  thf(zip_derived_cl2588, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/1.35         (~ (ssList @ X0)
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ~ (frontsegP @ X0 @ X2)
% 0.64/1.35          |  (segmentP @ X1 @ X2)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ((X0) != (X1))
% 0.64/1.35          | ~ (ssList @ X2))),
% 0.64/1.35      inference('demod', [status(thm)], [zip_derived_cl2574, zip_derived_cl50])).
% 0.64/1.35  thf(zip_derived_cl2589, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/1.35         (((X0) != (X1))
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          |  (segmentP @ X1 @ X2)
% 0.64/1.35          | ~ (frontsegP @ X0 @ X2)
% 0.64/1.35          | ~ (ssList @ X2)
% 0.64/1.35          | ~ (ssList @ X0))),
% 0.64/1.35      inference('simplify', [status(thm)], [zip_derived_cl2588])).
% 0.64/1.35  thf(zip_derived_cl2799, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i]:
% 0.64/1.35         (~ (ssList @ X0)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ~ (frontsegP @ X0 @ X1)
% 0.64/1.35          |  (segmentP @ X0 @ X1)
% 0.64/1.35          | ~ (ssList @ X0))),
% 0.64/1.35      inference('eq_res', [status(thm)], [zip_derived_cl2589])).
% 0.64/1.35  thf(zip_derived_cl2800, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i]:
% 0.64/1.35         ( (segmentP @ X0 @ X1)
% 0.64/1.35          | ~ (frontsegP @ X0 @ X1)
% 0.64/1.35          | ~ (ssList @ X1)
% 0.64/1.35          | ~ (ssList @ X0))),
% 0.64/1.35      inference('simplify', [status(thm)], [zip_derived_cl2799])).
% 0.64/1.35  thf(co1_8, conjecture, (segmentP @ sk2 @ sk1)).
% 0.64/1.35  thf(zf_stmt_0, negated_conjecture, (~( segmentP @ sk2 @ sk1 )),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_8])).
% 0.64/1.35  thf(zip_derived_cl192, plain, (~ (segmentP @ sk2 @ sk1)),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.64/1.35  thf(zip_derived_cl2850, plain,
% 0.64/1.35      ((~ (ssList @ sk2) | ~ (ssList @ sk1) | ~ (frontsegP @ sk2 @ sk1))),
% 0.64/1.35      inference('s_sup-', [status(thm)],
% 0.64/1.35                [zip_derived_cl2800, zip_derived_cl192])).
% 0.64/1.35  thf(co1_2, conjecture, (~( ssList @ sk2 ))).
% 0.64/1.35  thf(zf_stmt_1, negated_conjecture, (ssList @ sk2),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_2])).
% 0.64/1.35  thf(zip_derived_cl186, plain, ( (ssList @ sk2)),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/1.35  thf(co1_1, conjecture, (~( ssList @ sk1 ))).
% 0.64/1.35  thf(zf_stmt_2, negated_conjecture, (ssList @ sk1),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_1])).
% 0.64/1.35  thf(zip_derived_cl185, plain, ( (ssList @ sk1)),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_2])).
% 0.64/1.35  thf(co1_10, conjecture,
% 0.64/1.35    (~( ( frontsegP @ sk4 @ sk3 ) | ( ( nil ) = ( sk4 ) ) ))).
% 0.64/1.35  thf(zf_stmt_3, negated_conjecture,
% 0.64/1.35    (( frontsegP @ sk4 @ sk3 ) | ( ( nil ) = ( sk4 ) )),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_10])).
% 0.64/1.35  thf(zip_derived_cl194, plain, (( (frontsegP @ sk4 @ sk3) | ((nil) = (sk4)))),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_3])).
% 0.64/1.35  thf(co1_5, conjecture, (( sk2 ) != ( sk4 ))).
% 0.64/1.35  thf(zf_stmt_4, negated_conjecture, (( sk2 ) = ( sk4 )),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_5])).
% 0.64/1.35  thf(zip_derived_cl189, plain, (((sk2) = (sk4))),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_4])).
% 0.64/1.35  thf(co1_6, conjecture, (( sk1 ) != ( sk3 ))).
% 0.64/1.35  thf(zf_stmt_5, negated_conjecture, (( sk1 ) = ( sk3 )),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_6])).
% 0.64/1.35  thf(zip_derived_cl190, plain, (((sk1) = (sk3))),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_5])).
% 0.64/1.35  thf(zip_derived_cl189, plain, (((sk2) = (sk4))),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_4])).
% 0.64/1.35  thf(zip_derived_cl1373, plain,
% 0.64/1.35      (( (frontsegP @ sk2 @ sk1) | ((nil) = (sk2)))),
% 0.64/1.35      inference('demod', [status(thm)],
% 0.64/1.35                [zip_derived_cl194, zip_derived_cl189, zip_derived_cl190, 
% 0.64/1.35                 zip_derived_cl189])).
% 0.64/1.35  thf(co1_7, conjecture, (~( neq @ sk2 @ nil ))).
% 0.64/1.35  thf(zf_stmt_6, negated_conjecture, (neq @ sk2 @ nil),
% 0.64/1.35    inference('cnf.neg', [status(esa)], [co1_7])).
% 0.64/1.35  thf(zip_derived_cl191, plain, ( (neq @ sk2 @ nil)),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_6])).
% 0.64/1.35  thf(clause115, axiom,
% 0.64/1.35    (( ( U ) != ( V ) ) | ( ~( neq @ U @ V ) ) | ( ~( ssList @ V ) ) | 
% 0.64/1.35     ( ~( ssList @ U ) ))).
% 0.64/1.35  thf(zip_derived_cl114, plain,
% 0.64/1.35      (![X0 : $i, X1 : $i]:
% 0.64/1.35         (((X1) != (X0))
% 0.64/1.35          | ~ (neq @ X1 @ X0)
% 0.64/1.35          | ~ (ssList @ X0)
% 0.64/1.35          | ~ (ssList @ X1))),
% 0.64/1.35      inference('cnf', [status(esa)], [clause115])).
% 0.64/1.35  thf(zip_derived_cl1341, plain,
% 0.64/1.35      ((~ (ssList @ sk2) | ~ (ssList @ nil) | ((sk2) != (nil)))),
% 0.64/1.35      inference('dp-resolution', [status(thm)],
% 0.64/1.35                [zip_derived_cl191, zip_derived_cl114])).
% 0.64/1.35  thf(zip_derived_cl186, plain, ( (ssList @ sk2)),
% 0.64/1.35      inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.64/1.35  thf(zip_derived_cl7, plain, ( (ssList @ nil)),
% 0.64/1.35      inference('cnf', [status(esa)], [clause8])).
% 0.64/1.35  thf(zip_derived_cl1370, plain, (((sk2) != (nil))),
% 0.64/1.35      inference('demod', [status(thm)],
% 0.64/1.35                [zip_derived_cl1341, zip_derived_cl186, zip_derived_cl7])).
% 0.64/1.35  thf(zip_derived_cl1374, plain, ( (frontsegP @ sk2 @ sk1)),
% 0.64/1.35      inference('simplify_reflect-', [status(thm)],
% 0.64/1.35                [zip_derived_cl1373, zip_derived_cl1370])).
% 0.64/1.35  thf(zip_derived_cl2857, plain, ($false),
% 0.64/1.35      inference('demod', [status(thm)],
% 0.64/1.35                [zip_derived_cl2850, zip_derived_cl186, zip_derived_cl185, 
% 0.64/1.35                 zip_derived_cl1374])).
% 0.64/1.35  
% 0.64/1.35  % SZS output end Refutation
% 0.64/1.35  
% 0.64/1.35  
% 0.64/1.35  % Terminating...
% 5.16/1.44  % Runner terminated.
% 5.16/1.45  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------