TSTP Solution File: GRP168-1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : GRP168-1 : 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.DJ5putxsMT true
% Computer : n022.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:28 EDT 2023
% Result : Unsatisfiable 0.64s 0.69s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP168-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.DJ5putxsMT true
% 0.14/0.34 % Computer : n022.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 23:37:39 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.52/0.60 % Total configuration time : 435
% 0.52/0.60 % Estimated wc time : 1092
% 0.52/0.60 % Estimated cpu time (7 cpus) : 156.0
% 0.52/0.65 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.52/0.65 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.64/0.69 % Solved by fo/fo3_bce.sh.
% 0.64/0.69 % BCE start: 17
% 0.64/0.69 % BCE eliminated: 0
% 0.64/0.69 % PE start: 17
% 0.64/0.69 logic: eq
% 0.64/0.69 % PE eliminated: 0
% 0.64/0.69 % done 22 iterations in 0.019s
% 0.64/0.69 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.64/0.69 % SZS output start Refutation
% 0.64/0.69 thf(c_type, type, c: $i).
% 0.64/0.69 thf(b_type, type, b: $i).
% 0.64/0.69 thf(least_upper_bound_type, type, least_upper_bound: $i > $i > $i).
% 0.64/0.69 thf(multiply_type, type, multiply: $i > $i > $i).
% 0.64/0.69 thf(inverse_type, type, inverse: $i > $i).
% 0.64/0.69 thf(a_type, type, a: $i).
% 0.64/0.69 thf(prove_p01a, conjecture,
% 0.64/0.69 (( least_upper_bound @
% 0.64/0.69 ( multiply @ ( inverse @ c ) @ ( multiply @ a @ c ) ) @
% 0.64/0.69 ( multiply @ ( inverse @ c ) @ ( multiply @ b @ c ) ) ) =
% 0.64/0.69 ( multiply @ ( inverse @ c ) @ ( multiply @ b @ c ) ))).
% 0.64/0.69 thf(zf_stmt_0, negated_conjecture,
% 0.64/0.69 (( least_upper_bound @
% 0.64/0.69 ( multiply @ ( inverse @ c ) @ ( multiply @ a @ c ) ) @
% 0.64/0.69 ( multiply @ ( inverse @ c ) @ ( multiply @ b @ c ) ) ) !=
% 0.64/0.69 ( multiply @ ( inverse @ c ) @ ( multiply @ b @ c ) )),
% 0.64/0.69 inference('cnf.neg', [status(esa)], [prove_p01a])).
% 0.64/0.69 thf(zip_derived_cl16, plain,
% 0.64/0.69 (((least_upper_bound @ (multiply @ (inverse @ c) @ (multiply @ a @ c)) @
% 0.64/0.69 (multiply @ (inverse @ c) @ (multiply @ b @ c)))
% 0.64/0.69 != (multiply @ (inverse @ c) @ (multiply @ b @ c)))),
% 0.64/0.69 inference('cnf', [status(esa)], [zf_stmt_0])).
% 0.64/0.69 thf(monotony_lub1, axiom,
% 0.64/0.69 (( multiply @ X @ ( least_upper_bound @ Y @ Z ) ) =
% 0.64/0.69 ( least_upper_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ))).
% 0.64/0.69 thf(zip_derived_cl11, plain,
% 0.64/0.69 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.69 ((multiply @ X0 @ (least_upper_bound @ X1 @ X2))
% 0.64/0.69 = (least_upper_bound @ (multiply @ X0 @ X1) @ (multiply @ X0 @ X2)))),
% 0.64/0.69 inference('cnf', [status(esa)], [monotony_lub1])).
% 0.64/0.69 thf(zip_derived_cl66, plain,
% 0.64/0.69 (((multiply @ (inverse @ c) @
% 0.64/0.69 (least_upper_bound @ (multiply @ a @ c) @ (multiply @ b @ c)))
% 0.64/0.69 != (multiply @ (inverse @ c) @ (multiply @ b @ c)))),
% 0.64/0.69 inference('demod', [status(thm)], [zip_derived_cl16, zip_derived_cl11])).
% 0.64/0.69 thf(monotony_lub2, axiom,
% 0.64/0.69 (( multiply @ ( least_upper_bound @ Y @ Z ) @ X ) =
% 0.64/0.69 ( least_upper_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ))).
% 0.64/0.69 thf(zip_derived_cl13, plain,
% 0.64/0.69 (![X0 : $i, X1 : $i, X2 : $i]:
% 0.64/0.69 ((multiply @ (least_upper_bound @ X0 @ X2) @ X1)
% 0.64/0.69 = (least_upper_bound @ (multiply @ X0 @ X1) @ (multiply @ X2 @ X1)))),
% 0.64/0.69 inference('cnf', [status(esa)], [monotony_lub2])).
% 0.64/0.69 thf(p01a_1, axiom, (( least_upper_bound @ a @ b ) = ( b ))).
% 0.64/0.69 thf(zip_derived_cl15, plain, (((least_upper_bound @ a @ b) = (b))),
% 0.64/0.69 inference('cnf', [status(esa)], [p01a_1])).
% 0.64/0.69 thf(zip_derived_cl99, plain,
% 0.64/0.69 (((multiply @ (inverse @ c) @ (multiply @ b @ c))
% 0.64/0.69 != (multiply @ (inverse @ c) @ (multiply @ b @ c)))),
% 0.64/0.69 inference('demod', [status(thm)],
% 0.64/0.69 [zip_derived_cl66, zip_derived_cl13, zip_derived_cl15])).
% 0.64/0.69 thf(zip_derived_cl100, plain, ($false),
% 0.64/0.69 inference('simplify', [status(thm)], [zip_derived_cl99])).
% 0.64/0.69
% 0.64/0.69 % SZS output end Refutation
% 0.64/0.69
% 0.64/0.69
% 0.64/0.69 % Terminating...
% 1.34/0.78 % Runner terminated.
% 1.34/0.79 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------