↑ Up

Zipperpin---2.1.9999.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : COM004-1 : TPTP v9.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.MAnmdR0iHx true

% Computer : n024.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 Oct  2 04:30:32 PM UTC 2025

% Result   : Unsatisfiable 0.60s 0.82s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : COM004-1 : TPTP v9.2.0. Released v1.1.0.
% 0.12/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.MAnmdR0iHx true
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Oct  1 13:48:53 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Running portfolio for 300 s
% 0.13/0.35  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35  % Number of cores: 8
% 0.13/0.36  % Python version: Python 3.6.8
% 0.13/0.36  % Running in FO mode
% 0.56/0.68  % Total configuration time : 435
% 0.56/0.68  % Estimated wc time : 1092
% 0.56/0.68  % Estimated cpu time (7 cpus) : 156.0
% 0.60/0.78  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.60/0.80  % /export/starexec/sandbox2/solver/bin/fo/fo3_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.81  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.60/0.81  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.60/0.82  % Solved by fo/fo6_bce.sh.
% 0.60/0.82  % BCE start: 9
% 0.60/0.82  % BCE eliminated: 0
% 0.60/0.82  % PE start: 9
% 0.60/0.82  logic: eq
% 0.60/0.82  % PE eliminated: 2
% 0.60/0.82  % done 11 iterations in 0.011s
% 0.60/0.82  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.60/0.82  % SZS output start Refutation
% 0.60/0.82  thf(n_right_type, type, n_right: $i).
% 0.60/0.82  thf(n_left_type, type, n_left: $i).
% 0.60/0.82  thf(left_child_of_type, type, left_child_of: $i > $i).
% 0.60/0.82  thf(n_type, type, n: $i).
% 0.60/0.82  thf(or_type, type, or: $i > $i > $i).
% 0.60/0.82  thf(right_child_of_type, type, right_child_of: $i > $i).
% 0.60/0.82  thf(parent_of_type, type, parent_of: $i > $i > $i).
% 0.60/0.82  thf(empty_type, type, empty: $i).
% 0.60/0.82  thf(failure_node_type, type, failure_node: $i > $i > $o).
% 0.60/0.82  thf(negate_type, type, negate: $i > $i).
% 0.60/0.82  thf(contradictory_type, type, contradictory: $i > $i > $o).
% 0.60/0.82  thf(atom_type, type, atom: $i).
% 0.60/0.82  thf(siblings_type, type, siblings: $i > $i > $o).
% 0.60/0.82  thf(n_left_is_atom, axiom, (failure_node @ n_left @ ( or @ empty @ atom ))).
% 0.60/0.82  thf(zip_derived_cl4, plain, ( (failure_node @ n_left @ (or @ empty @ atom))),
% 0.60/0.82      inference('cnf', [status(esa)], [n_left_is_atom])).
% 0.60/0.82  thf(n_left_equals_left_child_of_n, axiom,
% 0.60/0.82    (( n_left ) = ( left_child_of @ n ))).
% 0.60/0.82  thf(zip_derived_cl6, plain, (((n_left) = (left_child_of @ n))),
% 0.60/0.82      inference('cnf', [status(esa)], [n_left_equals_left_child_of_n])).
% 0.60/0.82  thf(x_contradicts_not_x, axiom, (contradictory @ X @ ( negate @ X ))).
% 0.60/0.82  thf(zip_derived_cl2, plain,
% 0.60/0.82      (![X0 : $i]:  (contradictory @ X0 @ (negate @ X0))),
% 0.60/0.82      inference('cnf', [status(esa)], [x_contradicts_not_x])).
% 0.60/0.82  thf(n_left_and_n_right_are_siblings, axiom,
% 0.60/0.82    (siblings @ ( left_child_of @ X ) @ ( right_child_of @ X ))).
% 0.60/0.82  thf(zip_derived_cl3, plain,
% 0.60/0.82      (![X0 : $i]:  (siblings @ (left_child_of @ X0) @ (right_child_of @ X0))),
% 0.60/0.82      inference('cnf', [status(esa)], [n_left_and_n_right_are_siblings])).
% 0.60/0.82  thf(make_node, axiom,
% 0.60/0.82    (( failure_node @ ( parent_of @ X @ Y ) @ ( or @ C @ D ) ) | 
% 0.60/0.82     ( ~( failure_node @ X @ ( or @ C @ P ) ) ) | 
% 0.60/0.82     ( ~( failure_node @ Y @ ( or @ D @ Q ) ) ) | 
% 0.60/0.82     ( ~( contradictory @ P @ Q ) ) | ( ~( siblings @ X @ Y ) ))).
% 0.60/0.82  thf(zip_derived_cl0, plain,
% 0.60/0.82      (![X0 : $i, X1 : $i, X2 : $i, X3 : $i, X4 : $i, X5 : $i]:
% 0.60/0.82         ( (failure_node @ (parent_of @ X0 @ X1) @ (or @ X2 @ X3))
% 0.60/0.82          | ~ (failure_node @ X0 @ (or @ X2 @ X4))
% 0.60/0.82          | ~ (failure_node @ X1 @ (or @ X3 @ X5))
% 0.60/0.82          | ~ (contradictory @ X4 @ X5)
% 0.60/0.82          | ~ (siblings @ X0 @ X1))),
% 0.60/0.82      inference('cnf', [status(esa)], [make_node])).
% 0.60/0.82  thf(zip_derived_cl31, plain,
% 0.60/0.82      (![X0 : $i, X1 : $i, X2 : $i, X3 : $i, X4 : $i]:
% 0.60/0.82         (~ (contradictory @ X3 @ X4)
% 0.60/0.82          | ~ (failure_node @ (right_child_of @ X0) @ (or @ X1 @ X4))
% 0.60/0.82          | ~ (failure_node @ (left_child_of @ X0) @ (or @ X2 @ X3))
% 0.60/0.82          |  (failure_node @ 
% 0.60/0.82              (parent_of @ (left_child_of @ X0) @ (right_child_of @ X0)) @ 
% 0.60/0.82              (or @ X2 @ X1)))),
% 0.60/0.82      inference('dp-resolution', [status(thm)],
% 0.60/0.82                [zip_derived_cl3, zip_derived_cl0])).
% 0.60/0.82  thf(zip_derived_cl33, plain,
% 0.60/0.82      (![X0 : $i, X1 : $i, X2 : $i, X3 : $i]:
% 0.60/0.82         ( (failure_node @ 
% 0.60/0.82            (parent_of @ (left_child_of @ X2) @ (right_child_of @ X2)) @ 
% 0.60/0.82            (or @ X3 @ X1))
% 0.60/0.82          | ~ (failure_node @ (left_child_of @ X2) @ (or @ X3 @ X0))
% 0.60/0.82          | ~ (failure_node @ (right_child_of @ X2) @ (or @ X1 @ (negate @ X0))))),
% 0.60/0.82      inference('dp-resolution', [status(thm)],
% 0.60/0.82                [zip_derived_cl2, zip_derived_cl31])).
% 0.60/0.82  thf(zip_derived_cl38, plain,
% 0.60/0.82      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/0.82         ( (failure_node @ (parent_of @ n_left @ (right_child_of @ n)) @ 
% 0.60/0.82            (or @ X1 @ X2))
% 0.60/0.82          | ~ (failure_node @ n_left @ (or @ X1 @ X0))
% 0.60/0.82          | ~ (failure_node @ (right_child_of @ n) @ (or @ X2 @ (negate @ X0))))),
% 0.60/0.82      inference('s_sup-', [status(thm)], [zip_derived_cl6, zip_derived_cl33])).
% 0.60/0.82  thf(n_right_equals_right_child_of_n, axiom,
% 0.60/0.82    (( n_right ) = ( right_child_of @ n ))).
% 0.60/0.82  thf(zip_derived_cl7, plain, (((n_right) = (right_child_of @ n))),
% 0.60/0.82      inference('cnf', [status(esa)], [n_right_equals_right_child_of_n])).
% 0.60/0.82  thf(zip_derived_cl7, plain, (((n_right) = (right_child_of @ n))),
% 0.60/0.82      inference('cnf', [status(esa)], [n_right_equals_right_child_of_n])).
% 0.60/0.82  thf(zip_derived_cl39, plain,
% 0.60/0.82      (![X0 : $i, X1 : $i, X2 : $i]:
% 0.60/0.82         ( (failure_node @ (parent_of @ n_left @ n_right) @ (or @ X1 @ X2))
% 0.60/0.82          | ~ (failure_node @ n_left @ (or @ X1 @ X0))
% 0.60/0.82          | ~ (failure_node @ n_right @ (or @ X2 @ (negate @ X0))))),
% 0.60/0.82      inference('demod', [status(thm)],
% 0.60/0.82                [zip_derived_cl38, zip_derived_cl7, zip_derived_cl7])).
% 0.60/0.82  thf(zip_derived_cl40, plain,
% 0.60/0.82      (![X0 : $i]:
% 0.60/0.82         ( (failure_node @ (parent_of @ n_left @ n_right) @ (or @ empty @ X0))
% 0.60/0.82          | ~ (failure_node @ n_right @ (or @ X0 @ (negate @ atom))))),
% 0.60/0.82      inference('s_sup-', [status(thm)], [zip_derived_cl4, zip_derived_cl39])).
% 0.60/0.82  thf(goal_is_there_an_empty_node, conjecture,
% 0.60/0.82    (failure_node @ Z @ ( or @ empty @ empty ))).
% 0.60/0.82  thf(zf_stmt_0, negated_conjecture,
% 0.60/0.82    (~( failure_node @ Z @ ( or @ empty @ empty ) )),
% 0.60/0.82    inference('cnf.neg', [status(esa)], [goal_is_there_an_empty_node])).
% 0.60/0.82  thf(zip_derived_cl8, plain,
% 0.60/0.82      (![X0 : $i]: ~ (failure_node @ X0 @ (or @ empty @ empty))),
% 0.60/0.82      inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.60/0.82  thf(zip_derived_cl41, plain,
% 0.60/0.82      (~ (failure_node @ n_right @ (or @ empty @ (negate @ atom)))),
% 0.60/0.82      inference('s_sup-', [status(thm)], [zip_derived_cl40, zip_derived_cl8])).
% 0.60/0.82  thf(n_right_is_not_atom, axiom,
% 0.60/0.82    (failure_node @ n_right @ ( or @ empty @ ( negate @ atom ) ))).
% 0.60/0.82  thf(zip_derived_cl5, plain,
% 0.60/0.82      ( (failure_node @ n_right @ (or @ empty @ (negate @ atom)))),
% 0.60/0.82      inference('cnf', [status(esa)], [n_right_is_not_atom])).
% 0.60/0.82  thf(zip_derived_cl42, plain, ($false),
% 0.60/0.82      inference('demod', [status(thm)], [zip_derived_cl41, zip_derived_cl5])).
% 0.60/0.82  
% 0.60/0.82  % SZS output end Refutation
% 0.60/0.82  
% 0.60/0.82  
% 0.60/0.82  % Terminating...
% 1.82/0.89  % Runner terminated.
% 1.82/0.91  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------