TSTP Solution File: GRP175-2 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : GRP175-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.RajxTDRN8U true
% Computer : n015.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 Aug 31 01:50:31 EDT 2023
% Result : Unsatisfiable 1.29s 1.28s
% Output : Refutation 1.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP175-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.RajxTDRN8U true
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 21:56:25 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.14/0.34 % Running portfolio for 300 s
% 0.14/0.34 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.34 % Number of cores: 8
% 0.14/0.34 % Python version: Python 3.6.8
% 0.14/0.35 % Running in FO mode
% 0.21/0.64 % Total configuration time : 435
% 0.21/0.64 % Estimated wc time : 1092
% 0.21/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.69 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.74 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.76 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.29/1.28 % Solved by fo/fo6_bce.sh.
% 1.29/1.28 % BCE start: 17
% 1.29/1.28 % BCE eliminated: 0
% 1.29/1.28 % PE start: 17
% 1.29/1.28 logic: eq
% 1.29/1.28 % PE eliminated: 0
% 1.29/1.28 % done 243 iterations in 0.575s
% 1.29/1.28 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.29/1.28 % SZS output start Refutation
% 1.29/1.28 thf(a_type, type, a: $i).
% 1.29/1.28 thf(least_upper_bound_type, type, least_upper_bound: $i > $i > $i).
% 1.29/1.28 thf(identity_type, type, identity: $i).
% 1.29/1.28 thf(multiply_type, type, multiply: $i > $i > $i).
% 1.29/1.28 thf(greatest_lower_bound_type, type, greatest_lower_bound: $i > $i > $i).
% 1.29/1.28 thf(inverse_type, type, inverse: $i > $i).
% 1.29/1.28 thf(b_type, type, b: $i).
% 1.29/1.28 thf(prove_p06b, conjecture,
% 1.29/1.28 (( greatest_lower_bound @
% 1.29/1.28 identity @ ( multiply @ ( inverse @ a ) @ ( multiply @ b @ a ) ) ) =
% 1.29/1.28 ( identity ))).
% 1.29/1.28 thf(zf_stmt_0, negated_conjecture,
% 1.29/1.28 (( greatest_lower_bound @
% 1.29/1.28 identity @ ( multiply @ ( inverse @ a ) @ ( multiply @ b @ a ) ) ) !=
% 1.29/1.28 ( identity )),
% 1.29/1.28 inference('cnf.neg', [status(esa)], [prove_p06b])).
% 1.29/1.28 thf(zip_derived_cl16, plain,
% 1.29/1.28 (((greatest_lower_bound @ identity @
% 1.29/1.28 (multiply @ (inverse @ a) @ (multiply @ b @ a))) != (identity))),
% 1.29/1.28 inference('cnf', [status(esa)], [zf_stmt_0])).
% 1.29/1.28 thf(left_inverse, axiom, (( multiply @ ( inverse @ X ) @ X ) = ( identity ))).
% 1.29/1.28 thf(zip_derived_cl1, plain,
% 1.29/1.28 (![X0 : $i]: ((multiply @ (inverse @ X0) @ X0) = (identity))),
% 1.29/1.28 inference('cnf', [status(esa)], [left_inverse])).
% 1.29/1.28 thf(monotony_glb1, axiom,
% 1.29/1.28 (( multiply @ X @ ( greatest_lower_bound @ Y @ Z ) ) =
% 1.29/1.28 ( greatest_lower_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ))).
% 1.29/1.28 thf(zip_derived_cl12, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.29/1.28 ((multiply @ X0 @ (greatest_lower_bound @ X1 @ X2))
% 1.29/1.28 = (greatest_lower_bound @ (multiply @ X0 @ X1) @
% 1.29/1.28 (multiply @ X0 @ X2)))),
% 1.29/1.28 inference('cnf', [status(esa)], [monotony_glb1])).
% 1.29/1.28 thf(zip_derived_cl115, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i]:
% 1.29/1.28 ((multiply @ (inverse @ X1) @ (greatest_lower_bound @ X1 @ X0))
% 1.29/1.28 = (greatest_lower_bound @ identity @
% 1.29/1.28 (multiply @ (inverse @ X1) @ X0)))),
% 1.29/1.28 inference('s_sup+', [status(thm)], [zip_derived_cl1, zip_derived_cl12])).
% 1.29/1.28 thf(zip_derived_cl2557, plain,
% 1.29/1.28 (((multiply @ (inverse @ a) @
% 1.29/1.28 (greatest_lower_bound @ a @ (multiply @ b @ a))) != (identity))),
% 1.29/1.28 inference('demod', [status(thm)], [zip_derived_cl16, zip_derived_cl115])).
% 1.29/1.28 thf(p06b_1, axiom, (( greatest_lower_bound @ identity @ b ) = ( identity ))).
% 1.29/1.28 thf(zip_derived_cl15, plain,
% 1.29/1.28 (((greatest_lower_bound @ identity @ b) = (identity))),
% 1.29/1.28 inference('cnf', [status(esa)], [p06b_1])).
% 1.29/1.28 thf(symmetry_of_glb, axiom,
% 1.29/1.28 (( greatest_lower_bound @ X @ Y ) = ( greatest_lower_bound @ Y @ X ))).
% 1.29/1.28 thf(zip_derived_cl3, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i]:
% 1.29/1.28 ((greatest_lower_bound @ X1 @ X0) = (greatest_lower_bound @ X0 @ X1))),
% 1.29/1.28 inference('cnf', [status(esa)], [symmetry_of_glb])).
% 1.29/1.28 thf(lub_absorbtion, axiom,
% 1.29/1.28 (( least_upper_bound @ X @ ( greatest_lower_bound @ X @ Y ) ) = ( X ))).
% 1.29/1.28 thf(zip_derived_cl9, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i]:
% 1.29/1.28 ((least_upper_bound @ X0 @ (greatest_lower_bound @ X0 @ X1)) = (X0))),
% 1.29/1.28 inference('cnf', [status(esa)], [lub_absorbtion])).
% 1.29/1.28 thf(zip_derived_cl28, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i]:
% 1.29/1.28 ((least_upper_bound @ X0 @ (greatest_lower_bound @ X1 @ X0)) = (X0))),
% 1.29/1.28 inference('s_sup+', [status(thm)], [zip_derived_cl3, zip_derived_cl9])).
% 1.29/1.28 thf(zip_derived_cl225, plain, (((least_upper_bound @ b @ identity) = (b))),
% 1.29/1.28 inference('s_sup+', [status(thm)], [zip_derived_cl15, zip_derived_cl28])).
% 1.29/1.28 thf(symmetry_of_lub, axiom,
% 1.29/1.28 (( least_upper_bound @ X @ Y ) = ( least_upper_bound @ Y @ X ))).
% 1.29/1.28 thf(zip_derived_cl4, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i]:
% 1.29/1.28 ((least_upper_bound @ X1 @ X0) = (least_upper_bound @ X0 @ X1))),
% 1.29/1.28 inference('cnf', [status(esa)], [symmetry_of_lub])).
% 1.29/1.28 thf(zip_derived_cl227, plain, (((least_upper_bound @ identity @ b) = (b))),
% 1.29/1.28 inference('s_sup+', [status(thm)], [zip_derived_cl225, zip_derived_cl4])).
% 1.29/1.28 thf(monotony_lub2, axiom,
% 1.29/1.28 (( multiply @ ( least_upper_bound @ Y @ Z ) @ X ) =
% 1.29/1.28 ( least_upper_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ))).
% 1.29/1.28 thf(zip_derived_cl13, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.29/1.28 ((multiply @ (least_upper_bound @ X0 @ X2) @ X1)
% 1.29/1.28 = (least_upper_bound @ (multiply @ X0 @ X1) @ (multiply @ X2 @ X1)))),
% 1.29/1.28 inference('cnf', [status(esa)], [monotony_lub2])).
% 1.29/1.28 thf(glb_absorbtion, axiom,
% 1.29/1.28 (( greatest_lower_bound @ X @ ( least_upper_bound @ X @ Y ) ) = ( X ))).
% 1.29/1.28 thf(zip_derived_cl10, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i]:
% 1.29/1.28 ((greatest_lower_bound @ X0 @ (least_upper_bound @ X0 @ X1)) = (X0))),
% 1.29/1.28 inference('cnf', [status(esa)], [glb_absorbtion])).
% 1.29/1.28 thf(zip_derived_cl123, plain,
% 1.29/1.28 (![X0 : $i, X1 : $i, X2 : $i]:
% 1.29/1.28 ((greatest_lower_bound @ (multiply @ X2 @ X0) @
% 1.29/1.28 (multiply @ (least_upper_bound @ X2 @ X1) @ X0))
% 1.29/1.28 = (multiply @ X2 @ X0))),
% 1.29/1.28 inference('s_sup+', [status(thm)], [zip_derived_cl13, zip_derived_cl10])).
% 1.29/1.28 thf(zip_derived_cl3084, plain,
% 1.29/1.28 (![X0 : $i]:
% 1.29/1.28 ((greatest_lower_bound @ (multiply @ identity @ X0) @
% 1.29/1.28 (multiply @ b @ X0)) = (multiply @ identity @ X0))),
% 1.29/1.28 inference('s_sup+', [status(thm)], [zip_derived_cl227, zip_derived_cl123])).
% 1.29/1.28 thf(left_identity, axiom, (( multiply @ identity @ X ) = ( X ))).
% 1.29/1.28 thf(zip_derived_cl0, plain,
% 1.29/1.28 (![X0 : $i]: ((multiply @ identity @ X0) = (X0))),
% 1.29/1.28 inference('cnf', [status(esa)], [left_identity])).
% 1.29/1.28 thf(zip_derived_cl0, plain,
% 1.29/1.28 (![X0 : $i]: ((multiply @ identity @ X0) = (X0))),
% 1.29/1.28 inference('cnf', [status(esa)], [left_identity])).
% 1.29/1.28 thf(zip_derived_cl3108, plain,
% 1.29/1.28 (![X0 : $i]: ((greatest_lower_bound @ X0 @ (multiply @ b @ X0)) = (X0))),
% 1.29/1.28 inference('demod', [status(thm)],
% 1.29/1.28 [zip_derived_cl3084, zip_derived_cl0, zip_derived_cl0])).
% 1.29/1.28 thf(zip_derived_cl1, plain,
% 1.29/1.28 (![X0 : $i]: ((multiply @ (inverse @ X0) @ X0) = (identity))),
% 1.29/1.28 inference('cnf', [status(esa)], [left_inverse])).
% 1.29/1.28 thf(zip_derived_cl3488, plain, (((identity) != (identity))),
% 1.29/1.28 inference('demod', [status(thm)],
% 1.29/1.28 [zip_derived_cl2557, zip_derived_cl3108, zip_derived_cl1])).
% 1.29/1.28 thf(zip_derived_cl3489, plain, ($false),
% 1.29/1.28 inference('simplify', [status(thm)], [zip_derived_cl3488])).
% 1.29/1.28
% 1.29/1.28 % SZS output end Refutation
% 1.29/1.28
% 1.29/1.28
% 1.29/1.28 % Terminating...
% 1.29/1.37 % Runner terminated.
% 1.29/1.38 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------