%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : GRP165-2 : TPTP v9.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.03aXlo38Cd true
% Computer : n006.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:35:52 PM UTC 2025
% Result : Unsatisfiable 5.31s 1.32s
% Output : Refutation 5.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP165-2 : TPTP v9.2.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.03aXlo38Cd true
% 0.13/0.35 % Computer : n006.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 14:11: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.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in FO mode
% 0.48/0.60 % Total configuration time : 435
% 0.48/0.60 % Estimated wc time : 1092
% 0.48/0.60 % Estimated cpu time (7 cpus) : 156.0
% 0.48/0.67 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.48/0.69 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.48/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.48/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.48/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.48/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.48/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 5.31/1.32 % Solved by fo/fo5.sh.
% 5.31/1.32 % done 304 iterations in 0.579s
% 5.31/1.32 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 5.31/1.32 % SZS output start Refutation
% 5.31/1.32 thf(least_upper_bound_type, type, least_upper_bound: $i > $i > $i).
% 5.31/1.32 thf(identity_type, type, identity: $i).
% 5.31/1.32 thf(multiply_type, type, multiply: $i > $i > $i).
% 5.31/1.32 thf(greatest_lower_bound_type, type, greatest_lower_bound: $i > $i > $i).
% 5.31/1.32 thf(inverse_type, type, inverse: $i > $i).
% 5.31/1.32 thf(a_type, type, a: $i).
% 5.31/1.32 thf(prove_lat1b, conjecture,
% 5.31/1.32 (( greatest_lower_bound @ a @ ( multiply @ a @ a ) ) = ( a ))).
% 5.31/1.32 thf(zf_stmt_0, negated_conjecture,
% 5.31/1.32 (( greatest_lower_bound @ a @ ( multiply @ a @ a ) ) != ( a )),
% 5.31/1.32 inference('cnf.neg', [status(esa)], [prove_lat1b])).
% 5.31/1.32 thf(zip_derived_cl16, plain,
% 5.31/1.32 (((greatest_lower_bound @ a @ (multiply @ a @ a)) != (a))),
% 5.31/1.32 inference('cnf', [status(esa)], [zf_stmt_0])).
% 5.31/1.32 thf(lat1b_1, axiom, (( greatest_lower_bound @ a @ identity ) = ( identity ))).
% 5.31/1.32 thf(zip_derived_cl15, plain,
% 5.31/1.32 (((greatest_lower_bound @ a @ identity) = (identity))),
% 5.31/1.32 inference('cnf', [status(esa)], [lat1b_1])).
% 5.31/1.32 thf(monotony_glb1, axiom,
% 5.31/1.32 (( multiply @ X @ ( greatest_lower_bound @ Y @ Z ) ) =
% 5.31/1.32 ( greatest_lower_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ))).
% 5.31/1.32 thf(zip_derived_cl12, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 5.31/1.32 ((multiply @ X0 @ (greatest_lower_bound @ X1 @ X2))
% 5.31/1.32 = (greatest_lower_bound @ (multiply @ X0 @ X1) @
% 5.31/1.32 (multiply @ X0 @ X2)))),
% 5.31/1.32 inference('cnf', [status(esa)], [monotony_glb1])).
% 5.31/1.32 thf(lub_absorbtion, axiom,
% 5.31/1.32 (( least_upper_bound @ X @ ( greatest_lower_bound @ X @ Y ) ) = ( X ))).
% 5.31/1.32 thf(zip_derived_cl9, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((least_upper_bound @ X0 @ (greatest_lower_bound @ X0 @ X1)) = (X0))),
% 5.31/1.32 inference('cnf', [status(esa)], [lub_absorbtion])).
% 5.31/1.32 thf(zip_derived_cl68, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 5.31/1.32 ((least_upper_bound @ (multiply @ X2 @ X1) @
% 5.31/1.32 (multiply @ X2 @ (greatest_lower_bound @ X1 @ X0)))
% 5.31/1.32 = (multiply @ X2 @ X1))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl12, zip_derived_cl9])).
% 5.31/1.32 thf(zip_derived_cl2208, plain,
% 5.31/1.32 (![X0 : $i]:
% 5.31/1.32 ((least_upper_bound @ (multiply @ X0 @ a) @ (multiply @ X0 @ identity))
% 5.31/1.32 = (multiply @ X0 @ a))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl15, zip_derived_cl68])).
% 5.31/1.32 thf(left_inverse, axiom, (( multiply @ ( inverse @ X ) @ X ) = ( identity ))).
% 5.31/1.32 thf(zip_derived_cl1, plain,
% 5.31/1.32 (![X0 : $i]: ((multiply @ (inverse @ X0) @ X0) = (identity))),
% 5.31/1.32 inference('cnf', [status(esa)], [left_inverse])).
% 5.31/1.32 thf(zip_derived_cl1, plain,
% 5.31/1.32 (![X0 : $i]: ((multiply @ (inverse @ X0) @ X0) = (identity))),
% 5.31/1.32 inference('cnf', [status(esa)], [left_inverse])).
% 5.31/1.32 thf(associativity, axiom,
% 5.31/1.32 (( multiply @ ( multiply @ X @ Y ) @ Z ) =
% 5.31/1.32 ( multiply @ X @ ( multiply @ Y @ Z ) ))).
% 5.31/1.32 thf(zip_derived_cl2, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i, X2 : $i]:
% 5.31/1.32 ((multiply @ (multiply @ X0 @ X1) @ X2)
% 5.31/1.32 = (multiply @ X0 @ (multiply @ X1 @ X2)))),
% 5.31/1.32 inference('cnf', [status(esa)], [associativity])).
% 5.31/1.32 thf(zip_derived_cl26, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((multiply @ identity @ X0)
% 5.31/1.32 = (multiply @ (inverse @ X1) @ (multiply @ X1 @ X0)))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl1, zip_derived_cl2])).
% 5.31/1.32 thf(left_identity, axiom, (( multiply @ identity @ X ) = ( X ))).
% 5.31/1.32 thf(zip_derived_cl0, plain,
% 5.31/1.32 (![X0 : $i]: ((multiply @ identity @ X0) = (X0))),
% 5.31/1.32 inference('cnf', [status(esa)], [left_identity])).
% 5.31/1.32 thf(zip_derived_cl28, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((X0) = (multiply @ (inverse @ X1) @ (multiply @ X1 @ X0)))),
% 5.31/1.32 inference('demod', [status(thm)], [zip_derived_cl26, zip_derived_cl0])).
% 5.31/1.32 thf(zip_derived_cl34, plain,
% 5.31/1.32 (![X0 : $i]: ((X0) = (multiply @ (inverse @ (inverse @ X0)) @ identity))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl1, zip_derived_cl28])).
% 5.31/1.32 thf(zip_derived_cl28, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((X0) = (multiply @ (inverse @ X1) @ (multiply @ X1 @ X0)))),
% 5.31/1.32 inference('demod', [status(thm)], [zip_derived_cl26, zip_derived_cl0])).
% 5.31/1.32 thf(zip_derived_cl28, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((X0) = (multiply @ (inverse @ X1) @ (multiply @ X1 @ X0)))),
% 5.31/1.32 inference('demod', [status(thm)], [zip_derived_cl26, zip_derived_cl0])).
% 5.31/1.32 thf(zip_derived_cl31, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((multiply @ X1 @ X0) = (multiply @ (inverse @ (inverse @ X1)) @ X0))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl28, zip_derived_cl28])).
% 5.31/1.32 thf(zip_derived_cl261, plain,
% 5.31/1.32 (![X0 : $i]: ((multiply @ X0 @ identity) = (X0))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl34, zip_derived_cl31])).
% 5.31/1.32 thf(symmetry_of_lub, axiom,
% 5.31/1.32 (( least_upper_bound @ X @ Y ) = ( least_upper_bound @ Y @ X ))).
% 5.31/1.32 thf(zip_derived_cl4, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((least_upper_bound @ X1 @ X0) = (least_upper_bound @ X0 @ X1))),
% 5.31/1.32 inference('cnf', [status(esa)], [symmetry_of_lub])).
% 5.31/1.32 thf(zip_derived_cl2229, plain,
% 5.31/1.32 (![X0 : $i]:
% 5.31/1.32 ((least_upper_bound @ X0 @ (multiply @ X0 @ a)) = (multiply @ X0 @ a))),
% 5.31/1.32 inference('demod', [status(thm)],
% 5.31/1.32 [zip_derived_cl2208, zip_derived_cl261, zip_derived_cl4])).
% 5.31/1.32 thf(glb_absorbtion, axiom,
% 5.31/1.32 (( greatest_lower_bound @ X @ ( least_upper_bound @ X @ Y ) ) = ( X ))).
% 5.31/1.32 thf(zip_derived_cl10, plain,
% 5.31/1.32 (![X0 : $i, X1 : $i]:
% 5.31/1.32 ((greatest_lower_bound @ X0 @ (least_upper_bound @ X0 @ X1)) = (X0))),
% 5.31/1.32 inference('cnf', [status(esa)], [glb_absorbtion])).
% 5.31/1.32 thf(zip_derived_cl2242, plain,
% 5.31/1.32 (![X0 : $i]: ((greatest_lower_bound @ X0 @ (multiply @ X0 @ a)) = (X0))),
% 5.31/1.32 inference('sup+', [status(thm)], [zip_derived_cl2229, zip_derived_cl10])).
% 5.31/1.32 thf(zip_derived_cl2267, plain, (((a) != (a))),
% 5.31/1.32 inference('demod', [status(thm)], [zip_derived_cl16, zip_derived_cl2242])).
% 5.31/1.32 thf(zip_derived_cl2268, plain, ($false),
% 5.31/1.32 inference('simplify', [status(thm)], [zip_derived_cl2267])).
% 5.31/1.32
% 5.31/1.32 % SZS output end Refutation
% 5.31/1.32
% 5.31/1.32
% 5.31/1.32 % Terminating...
% 5.66/1.48 % Runner terminated.
% 5.71/1.49 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------