↑ Up

Zipperpin---2.1.9999.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.3Jo9qU1Fho 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 : Tue May  5 07:08:48 PM UTC 2026

% Result   : Unsatisfiable 0.55s 0.75s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.3Jo9qU1Fho true
% 0.16/0.34  % Computer : n011.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue May  5 11:16:17 EDT 2026
% 0.16/0.35  % CPUTime  : 
% 0.16/0.35  % Running portfolio for 300 s
% 0.16/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.35  % Number of cores: 8
% 0.16/0.35  % Python version: Python 3.6.8
% 0.16/0.35  % Running in FO mode
% 0.55/0.65  % Total configuration time : 435
% 0.55/0.65  % Estimated wc time : 1092
% 0.55/0.65  % Estimated cpu time (7 cpus) : 156.0
% 0.55/0.71  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.55/0.72  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.55/0.73  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.55/0.73  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.55/0.74  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.55/0.75  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.55/0.75  % Solved by fo/fo6_bce.sh.
% 0.55/0.75  % BCE start: 24
% 0.55/0.75  % BCE eliminated: 0
% 0.55/0.75  % PE start: 24
% 0.55/0.75  logic: eq
% 0.55/0.75  % PE eliminated: 0
% 0.55/0.75  % done 46 iterations in 0.024s
% 0.55/0.75  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.55/0.75  % SZS output start Refutation
% 0.55/0.75  thf(impl_type, type, impl: $i > $i > $i).
% 0.55/0.75  thf(z_type, type, z: $i).
% 0.55/0.75  thf(eq2_type, type, eq2: $i > $i > $i).
% 0.55/0.75  thf(btrue_type, type, btrue: $i).
% 0.55/0.75  thf(merge_type, type, merge: $i > $i > $i).
% 0.55/0.75  thf(prop_merge_ord_not3_type, type, prop_merge_ord_not3: $i > $i > $i).
% 0.55/0.75  thf(s_type, type, s: $i > $i).
% 0.55/0.75  thf(aux2_type, type, aux2: $i > $i > $i > $i > $i).
% 0.55/0.75  thf(ord_type, type, ord: $i > $i).
% 0.55/0.75  thf(leqNat_type, type, leqNat: $i > $i > $i).
% 0.55/0.75  thf(bfalse_type, type, bfalse: $i).
% 0.55/0.75  thf(cons_type, type, cons: $i > $i > $i).
% 0.55/0.75  thf(nil_type, type, nil: $i).
% 0.55/0.75  thf(axiom_005, axiom, (( leqNat @ ( s @ Z ) @ z ) = ( bfalse ))).
% 0.55/0.75  thf(zip_derived_cl5, plain,
% 0.55/0.75      (![X0 : $i]: ((leqNat @ (s @ X0) @ z) = (bfalse))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_005])).
% 0.55/0.75  thf(axiom_012, axiom,
% 0.55/0.75    (( ord @ ( cons @ Y @ ( cons @ Y2 @ Xs ) ) ) =
% 0.55/0.75     ( aux2 @ Y @ Y2 @ Xs @ ( leqNat @ Y @ Y2 ) ))).
% 0.55/0.75  thf(zip_derived_cl12, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.55/0.75         ((ord @ (cons @ X0 @ (cons @ X1 @ X2)))
% 0.55/0.75           = (aux2 @ X0 @ X1 @ X2 @ (leqNat @ X0 @ X1)))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_012])).
% 0.55/0.75  thf(zip_derived_cl46, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i]:
% 0.55/0.75         ((ord @ (cons @ (s @ X0) @ (cons @ z @ X1)))
% 0.55/0.75           = (aux2 @ (s @ X0) @ z @ X1 @ bfalse))),
% 0.55/0.75      inference('s_sup+', [status(thm)], [zip_derived_cl5, zip_derived_cl12])).
% 0.55/0.75  thf(axiom_003, axiom, (( aux2 @ Y @ Y2 @ Xs @ bfalse ) = ( bfalse ))).
% 0.55/0.75  thf(zip_derived_cl3, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.55/0.75         ((aux2 @ X0 @ X1 @ X2 @ bfalse) = (bfalse))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_003])).
% 0.55/0.75  thf(zip_derived_cl49, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i]:
% 0.55/0.75         ((ord @ (cons @ (s @ X0) @ (cons @ z @ X1))) = (bfalse))),
% 0.55/0.75      inference('demod', [status(thm)], [zip_derived_cl46, zip_derived_cl3])).
% 0.55/0.75  thf(axiom_007, axiom, (( merge @ nil @ Y ) = ( Y ))).
% 0.55/0.75  thf(zip_derived_cl7, plain, (![X0 : $i]: ((merge @ nil @ X0) = (X0))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_007])).
% 0.55/0.75  thf(axiom_015, axiom,
% 0.55/0.75    (( prop_merge_ord_not3 @ X @ Y ) =
% 0.55/0.75     ( impl @
% 0.55/0.75       ( eq2 @ ( ord @ X ) @ btrue ) @ 
% 0.55/0.75       ( impl @
% 0.55/0.75         ( eq2 @ ( ord @ Y ) @ bfalse ) @ 
% 0.55/0.75         ( eq2 @ ( ord @ ( merge @ X @ Y ) ) @ btrue ) ) ))).
% 0.55/0.75  thf(zip_derived_cl15, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i]:
% 0.55/0.75         ((prop_merge_ord_not3 @ X0 @ X1)
% 0.55/0.75           = (impl @ (eq2 @ (ord @ X0) @ btrue) @ 
% 0.55/0.75              (impl @ (eq2 @ (ord @ X1) @ bfalse) @ 
% 0.55/0.75               (eq2 @ (ord @ (merge @ X0 @ X1)) @ btrue))))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_015])).
% 0.55/0.75  thf(zip_derived_cl56, plain,
% 0.55/0.75      (![X0 : $i]:
% 0.55/0.75         ((prop_merge_ord_not3 @ nil @ X0)
% 0.55/0.75           = (impl @ (eq2 @ (ord @ nil) @ btrue) @ 
% 0.55/0.75              (impl @ (eq2 @ (ord @ X0) @ bfalse) @ (eq2 @ (ord @ X0) @ btrue))))),
% 0.55/0.75      inference('s_sup+', [status(thm)], [zip_derived_cl7, zip_derived_cl15])).
% 0.55/0.75  thf(axiom_010, axiom, (( ord @ nil ) = ( btrue ))).
% 0.55/0.75  thf(zip_derived_cl10, plain, (((ord @ nil) = (btrue))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_010])).
% 0.55/0.75  thf(axiom_022, axiom, (( eq2 @ X @ X ) = ( btrue ))).
% 0.55/0.75  thf(zip_derived_cl22, plain, (![X0 : $i]: ((eq2 @ X0 @ X0) = (btrue))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_022])).
% 0.55/0.75  thf(axiom_013, axiom, (( impl @ btrue @ Q ) = ( Q ))).
% 0.55/0.75  thf(zip_derived_cl13, plain, (![X0 : $i]: ((impl @ btrue @ X0) = (X0))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_013])).
% 0.55/0.75  thf(zip_derived_cl67, plain,
% 0.55/0.75      (![X0 : $i]:
% 0.55/0.75         ((prop_merge_ord_not3 @ nil @ X0)
% 0.55/0.75           = (impl @ (eq2 @ (ord @ X0) @ bfalse) @ (eq2 @ (ord @ X0) @ btrue)))),
% 0.55/0.75      inference('demod', [status(thm)],
% 0.55/0.75                [zip_derived_cl56, zip_derived_cl10, zip_derived_cl22, 
% 0.55/0.75                 zip_derived_cl13])).
% 0.55/0.75  thf(zip_derived_cl108, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i]:
% 0.55/0.75         ((prop_merge_ord_not3 @ nil @ (cons @ (s @ X1) @ (cons @ z @ X0)))
% 0.55/0.75           = (impl @ (eq2 @ bfalse @ bfalse) @ (eq2 @ bfalse @ btrue)))),
% 0.55/0.75      inference('s_sup+', [status(thm)], [zip_derived_cl49, zip_derived_cl67])).
% 0.55/0.75  thf(zip_derived_cl22, plain, (![X0 : $i]: ((eq2 @ X0 @ X0) = (btrue))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_022])).
% 0.55/0.75  thf(axiom_016, axiom, (( eq2 @ bfalse @ btrue ) = ( bfalse ))).
% 0.55/0.75  thf(zip_derived_cl16, plain, (((eq2 @ bfalse @ btrue) = (bfalse))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_016])).
% 0.55/0.75  thf(zip_derived_cl13, plain, (![X0 : $i]: ((impl @ btrue @ X0) = (X0))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_013])).
% 0.55/0.75  thf(zip_derived_cl116, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i]:
% 0.55/0.75         ((prop_merge_ord_not3 @ nil @ (cons @ (s @ X1) @ (cons @ z @ X0)))
% 0.55/0.75           = (bfalse))),
% 0.55/0.75      inference('demod', [status(thm)],
% 0.55/0.75                [zip_derived_cl108, zip_derived_cl22, zip_derived_cl16, 
% 0.55/0.75                 zip_derived_cl13])).
% 0.55/0.75  thf(goal, conjecture,
% 0.55/0.75    (( eq2 @ ( prop_merge_ord_not3 @ X @ Y ) @ bfalse ) = ( btrue ))).
% 0.55/0.75  thf(zf_stmt_0, negated_conjecture,
% 0.55/0.75    (( eq2 @ ( prop_merge_ord_not3 @ X @ Y ) @ bfalse ) != ( btrue )),
% 0.55/0.75    inference('cnf.neg', [status(esa)], [goal])).
% 0.55/0.75  thf(zip_derived_cl23, plain,
% 0.55/0.75      (![X0 : $i, X1 : $i]:
% 0.55/0.75         ((eq2 @ (prop_merge_ord_not3 @ X0 @ X1) @ bfalse) != (btrue))),
% 0.55/0.75      inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.55/0.75  thf(zip_derived_cl122, plain, (((eq2 @ bfalse @ bfalse) != (btrue))),
% 0.55/0.75      inference('s_sup-', [status(thm)], [zip_derived_cl116, zip_derived_cl23])).
% 0.55/0.75  thf(zip_derived_cl22, plain, (![X0 : $i]: ((eq2 @ X0 @ X0) = (btrue))),
% 0.55/0.75      inference('cnf', [status(esa)], [axiom_022])).
% 0.55/0.75  thf(zip_derived_cl126, plain, (((btrue) != (btrue))),
% 0.55/0.75      inference('demod', [status(thm)], [zip_derived_cl122, zip_derived_cl22])).
% 0.55/0.75  thf(zip_derived_cl127, plain, ($false),
% 0.55/0.75      inference('simplify', [status(thm)], [zip_derived_cl126])).
% 0.55/0.75  
% 0.55/0.75  % SZS output end Refutation
% 0.55/0.75  
% 0.55/0.75  
% 0.55/0.75  % Terminating...
% 0.61/0.84  % Runner terminated.
% 0.61/0.85  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------