↑ Up

Zipperpin---2.1.9999.UNS-Ref.s

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

% Computer : n012.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:12 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SET023-3 : TPTP v9.2.0. Released v1.0.0.
% 0.10/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.k9v0VOYtdc true
% 0.12/0.33  % Computer : n012.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Oct  1 12:59:38 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % Running portfolio for 300 s
% 0.12/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  % Number of cores: 8
% 0.12/0.34  % Python version: Python 3.6.8
% 0.12/0.34  % Running in FO mode
% 0.56/0.69  % Total configuration time : 435
% 0.56/0.69  % Estimated wc time : 1092
% 0.56/0.69  % Estimated cpu time (7 cpus) : 156.0
% 0.62/0.77  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.62/0.79  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.62/0.82  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.62/0.82  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.62/0.83  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.62/0.83  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.62/0.83  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.64/0.87  % /export/starexec/sandbox/solver/bin/fo/fo1_lcnf.sh running for 50s
% 0.64/1.02  % Solved by fo/fo5.sh.
% 0.64/1.02  % done 263 iterations in 0.165s
% 0.64/1.02  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.64/1.02  % SZS output start Refutation
% 0.64/1.02  thf(second_type, type, second: $i > $i).
% 0.64/1.02  thf(ordered_pair_type, type, ordered_pair: $i > $i > $i).
% 0.64/1.02  thf(f3_type, type, f3: $i > $i).
% 0.64/1.02  thf(ordered_pair_predicate_type, type, ordered_pair_predicate: $i > $o).
% 0.64/1.02  thf(little_set_type, type, little_set: $i > $o).
% 0.64/1.02  thf(f2_type, type, f2: $i > $i).
% 0.64/1.02  thf(a_type, type, a: $i).
% 0.64/1.02  thf(ordered_pair_predicate3, axiom,
% 0.64/1.02    (( ~( ordered_pair_predicate @ X ) ) | 
% 0.64/1.02     ( ( X ) = ( ordered_pair @ ( f2 @ X ) @ ( f3 @ X ) ) ))).
% 0.64/1.02  thf(zip_derived_cl12, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (~ (ordered_pair_predicate @ X0)
% 0.64/1.02          | ((X0) = (ordered_pair @ (f2 @ X0) @ (f3 @ X0))))),
% 0.64/1.02      inference('cnf', [status(esa)], [ordered_pair_predicate3])).
% 0.64/1.02  thf(property_of_second, axiom,
% 0.64/1.02    (( ~( little_set @ X ) ) | ( ~( little_set @ Y ) ) | 
% 0.64/1.02     ( ( second @ ( ordered_pair @ X @ Y ) ) = ( Y ) ))).
% 0.64/1.02  thf(zip_derived_cl146, plain,
% 0.64/1.02      (![X0 : $i, X1 : $i]:
% 0.64/1.02         (~ (little_set @ X0)
% 0.64/1.02          | ~ (little_set @ X1)
% 0.64/1.02          | ((second @ (ordered_pair @ X0 @ X1)) = (X1)))),
% 0.64/1.02      inference('cnf', [status(esa)], [property_of_second])).
% 0.64/1.02  thf(zip_derived_cl626, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (((second @ X0) = (f3 @ X0))
% 0.64/1.02          | ~ (ordered_pair_predicate @ X0)
% 0.64/1.02          | ~ (little_set @ (f3 @ X0))
% 0.64/1.02          | ~ (little_set @ (f2 @ X0)))),
% 0.64/1.02      inference('sup+', [status(thm)], [zip_derived_cl12, zip_derived_cl146])).
% 0.64/1.02  thf(ordered_pair_predicate2, axiom,
% 0.64/1.02    (( ~( ordered_pair_predicate @ X ) ) | ( little_set @ ( f3 @ X ) ))).
% 0.64/1.02  thf(zip_derived_cl11, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (~ (ordered_pair_predicate @ X0) |  (little_set @ (f3 @ X0)))),
% 0.64/1.02      inference('cnf', [status(esa)], [ordered_pair_predicate2])).
% 0.64/1.02  thf(zip_derived_cl824, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (~ (little_set @ (f2 @ X0))
% 0.64/1.02          | ~ (ordered_pair_predicate @ X0)
% 0.64/1.02          | ((second @ X0) = (f3 @ X0)))),
% 0.64/1.02      inference('clc', [status(thm)], [zip_derived_cl626, zip_derived_cl11])).
% 0.64/1.02  thf(ordered_pair_predicate1, axiom,
% 0.64/1.02    (( ~( ordered_pair_predicate @ X ) ) | ( little_set @ ( f2 @ X ) ))).
% 0.64/1.02  thf(zip_derived_cl10, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (~ (ordered_pair_predicate @ X0) |  (little_set @ (f2 @ X0)))),
% 0.64/1.02      inference('cnf', [status(esa)], [ordered_pair_predicate1])).
% 0.64/1.02  thf(zip_derived_cl825, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (((second @ X0) = (f3 @ X0)) | ~ (ordered_pair_predicate @ X0))),
% 0.64/1.02      inference('clc', [status(thm)], [zip_derived_cl824, zip_derived_cl10])).
% 0.64/1.02  thf(zip_derived_cl11, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (~ (ordered_pair_predicate @ X0) |  (little_set @ (f3 @ X0)))),
% 0.64/1.02      inference('cnf', [status(esa)], [ordered_pair_predicate2])).
% 0.64/1.02  thf(zip_derived_cl826, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         ( (little_set @ (second @ X0))
% 0.64/1.02          | ~ (ordered_pair_predicate @ X0)
% 0.64/1.02          | ~ (ordered_pair_predicate @ X0))),
% 0.64/1.02      inference('sup+', [status(thm)], [zip_derived_cl825, zip_derived_cl11])).
% 0.64/1.02  thf(zip_derived_cl828, plain,
% 0.64/1.02      (![X0 : $i]:
% 0.64/1.02         (~ (ordered_pair_predicate @ X0) |  (little_set @ (second @ X0)))),
% 0.64/1.02      inference('simplify', [status(thm)], [zip_derived_cl826])).
% 0.64/1.02  thf(prove_second_component_is_small, conjecture,
% 0.64/1.02    (little_set @ ( second @ a ))).
% 0.64/1.02  thf(zf_stmt_0, negated_conjecture, (~( little_set @ ( second @ a ) )),
% 0.64/1.02    inference('cnf.neg', [status(esa)], [prove_second_component_is_small])).
% 0.64/1.02  thf(zip_derived_cl149, plain, (~ (little_set @ (second @ a))),
% 0.64/1.02      inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.64/1.02  thf(zip_derived_cl919, plain, (~ (ordered_pair_predicate @ a)),
% 0.64/1.02      inference('sup-', [status(thm)], [zip_derived_cl828, zip_derived_cl149])).
% 0.64/1.02  thf(an_ordered_pair_predicate, axiom, (ordered_pair_predicate @ a)).
% 0.64/1.02  thf(zip_derived_cl148, plain, ( (ordered_pair_predicate @ a)),
% 0.64/1.02      inference('cnf', [status(esa)], [an_ordered_pair_predicate])).
% 0.64/1.02  thf(zip_derived_cl922, plain, ($false),
% 0.64/1.02      inference('demod', [status(thm)], [zip_derived_cl919, zip_derived_cl148])).
% 0.64/1.02  
% 0.64/1.02  % SZS output end Refutation
% 0.64/1.02  
% 0.64/1.02  
% 0.64/1.02  % Terminating...
% 0.67/1.12  % Runner terminated.
% 0.67/1.12  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------