↑ Up

Zipperpin---2.1.9999.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SET113-7 : TPTP v9.2.0. Bugfixed v7.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.d7vDONLWxj true

% Computer : n031.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:51:37 PM UTC 2025

% Result   : Unsatisfiable 0.50s 0.90s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET113-7 : TPTP v9.2.0. Bugfixed v7.3.0.
% 0.11/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.d7vDONLWxj true
% 0.13/0.34  % Computer : n031.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 : Wed Oct  1 13:21:38 EDT 2025
% 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.34  % Number of cores: 8
% 0.13/0.34  % Python version: Python 3.6.8
% 0.13/0.34  % Running in FO mode
% 0.46/0.59  % Total configuration time : 435
% 0.46/0.59  % Estimated wc time : 1092
% 0.46/0.59  % Estimated cpu time (7 cpus) : 156.0
% 0.48/0.67  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.48/0.70  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.48/0.70  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.48/0.70  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.48/0.71  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.48/0.71  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.48/0.71  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.50/0.89  % /export/starexec/sandbox/solver/bin/fo/fo1_lcnf.sh running for 50s
% 0.50/0.90  % Solved by fo/fo3_bce.sh.
% 0.50/0.90  % BCE start: 80
% 0.50/0.90  % BCE eliminated: 0
% 0.50/0.90  % PE start: 80
% 0.50/0.90  logic: eq
% 0.50/0.90  % PE eliminated: 7
% 0.50/0.90  % done 119 iterations in 0.157s
% 0.50/0.90  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.50/0.90  % SZS output start Refutation
% 0.50/0.90  thf(universal_class_type, type, universal_class: $i).
% 0.50/0.90  thf(member_type, type, member: $i > $i > $o).
% 0.50/0.90  thf(second_type, type, second: $i > $i).
% 0.50/0.90  thf(unordered_pair_type, type, unordered_pair: $i > $i > $i).
% 0.50/0.90  thf(singleton_type, type, singleton: $i > $i).
% 0.50/0.90  thf(cross_product_type, type, cross_product: $i > $i > $i).
% 0.50/0.90  thf(ordered_pair_type, type, ordered_pair: $i > $i > $i).
% 0.50/0.90  thf(x_type, type, x: $i).
% 0.50/0.90  thf(first_type, type, first: $i > $i).
% 0.50/0.90  thf(existence_of_1st_and_2nd_2, axiom,
% 0.50/0.90    (( member @
% 0.50/0.90       ( ordered_pair @ ( first @ X ) @ ( second @ X ) ) @ 
% 0.50/0.90       ( cross_product @ universal_class @ universal_class ) ) | 
% 0.50/0.90     ( ( first @ X ) = ( X ) ))).
% 0.50/0.90  thf(zip_derived_cl72, plain,
% 0.50/0.90      (![X0 : $i]:
% 0.50/0.90         ( (member @ (ordered_pair @ (first @ X0) @ (second @ X0)) @ 
% 0.50/0.90            (cross_product @ universal_class @ universal_class))
% 0.50/0.90          | ((first @ X0) = (X0)))),
% 0.50/0.90      inference('cnf', [status(esa)], [existence_of_1st_and_2nd_2])).
% 0.50/0.90  thf(ordered_pair, axiom,
% 0.50/0.90    (( unordered_pair @
% 0.50/0.90       ( singleton @ X ) @ ( unordered_pair @ X @ ( singleton @ Y ) ) ) =
% 0.50/0.90     ( ordered_pair @ X @ Y ))).
% 0.50/0.90  thf(zip_derived_cl12, plain,
% 0.50/0.90      (![X0 : $i, X1 : $i]:
% 0.50/0.90         ((unordered_pair @ (singleton @ X0) @ 
% 0.50/0.90           (unordered_pair @ X0 @ (singleton @ X1))) = (ordered_pair @ X0 @ X1))),
% 0.50/0.90      inference('cnf', [status(esa)], [ordered_pair])).
% 0.50/0.90  thf(zip_derived_cl803, plain,
% 0.50/0.90      (![X0 : $i]:
% 0.50/0.90         ( (member @ 
% 0.50/0.90            (unordered_pair @ (singleton @ (first @ X0)) @ 
% 0.50/0.90             (unordered_pair @ (first @ X0) @ (singleton @ (second @ X0)))) @ 
% 0.50/0.90            (cross_product @ universal_class @ universal_class))
% 0.50/0.90          | ((first @ X0) = (X0)))),
% 0.50/0.90      inference('demod', [status(thm)], [zip_derived_cl72, zip_derived_cl12])).
% 0.50/0.90  thf(prove_unique_1st_and_2nd_in_pair_of_non_sets1_1, conjecture,
% 0.50/0.90    (member @
% 0.50/0.90     ( ordered_pair @ ( first @ x ) @ ( second @ x ) ) @ 
% 0.50/0.90     ( cross_product @ universal_class @ universal_class ))).
% 0.50/0.90  thf(zf_stmt_0, negated_conjecture,
% 0.50/0.90    (~( member @
% 0.50/0.90        ( ordered_pair @ ( first @ x ) @ ( second @ x ) ) @ 
% 0.50/0.90        ( cross_product @ universal_class @ universal_class ) )),
% 0.50/0.90    inference('cnf.neg', [status(esa)],
% 0.50/0.90              [prove_unique_1st_and_2nd_in_pair_of_non_sets1_1])).
% 0.50/0.90  thf(zip_derived_cl79, plain,
% 0.50/0.90      (~ (member @ (ordered_pair @ (first @ x) @ (second @ x)) @ 
% 0.50/0.90          (cross_product @ universal_class @ universal_class))),
% 0.50/0.90      inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.50/0.90  thf(zip_derived_cl12, plain,
% 0.50/0.90      (![X0 : $i, X1 : $i]:
% 0.50/0.90         ((unordered_pair @ (singleton @ X0) @ 
% 0.50/0.90           (unordered_pair @ X0 @ (singleton @ X1))) = (ordered_pair @ X0 @ X1))),
% 0.50/0.90      inference('cnf', [status(esa)], [ordered_pair])).
% 0.50/0.90  thf(zip_derived_cl488, plain,
% 0.50/0.90      (~ (member @ 
% 0.50/0.90          (unordered_pair @ (singleton @ (first @ x)) @ 
% 0.50/0.90           (unordered_pair @ (first @ x) @ (singleton @ (second @ x)))) @ 
% 0.50/0.90          (cross_product @ universal_class @ universal_class))),
% 0.50/0.90      inference('demod', [status(thm)], [zip_derived_cl79, zip_derived_cl12])).
% 0.50/0.90  thf(zip_derived_cl911, plain, (((first @ x) = (x))),
% 0.50/0.90      inference('sup-', [status(thm)], [zip_derived_cl803, zip_derived_cl488])).
% 0.50/0.90  thf(prove_unique_1st_in_pair_of_non_sets, conjecture,
% 0.50/0.90    (( first @ x ) = ( x ))).
% 0.50/0.90  thf(zf_stmt_1, negated_conjecture, (( first @ x ) != ( x )),
% 0.50/0.90    inference('cnf.neg', [status(esa)], [prove_unique_1st_in_pair_of_non_sets])).
% 0.50/0.90  thf(zip_derived_cl78, plain, (((first @ x) != (x))),
% 0.50/0.90      inference('cnf', [status(esa)], [zf_stmt_1])).
% 0.50/0.90  thf(zip_derived_cl921, plain, ($false),
% 0.50/0.90      inference('simplify_reflect-', [status(thm)],
% 0.50/0.90                [zip_derived_cl911, zip_derived_cl78])).
% 0.50/0.90  
% 0.50/0.90  % SZS output end Refutation
% 0.50/0.90  
% 0.50/0.90  
% 0.50/0.90  % Terminating...
% 1.80/1.10  % Runner terminated.
% 1.80/1.11  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------