TSTP Solution File: GRP149-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP149-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n023.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:17:21 EDT 2023
% Result : Unsatisfiable 0.18s 0.38s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP149-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.12 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.33 % Computer : n023.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 23:53:25 EDT 2023
% 0.18/0.33 % CPUTime :
% 0.18/0.38 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.18/0.38
% 0.18/0.38 % SZS status Unsatisfiable
% 0.18/0.38
% 0.18/0.39 % SZS output start Proof
% 0.18/0.39 Axiom 1 (symmetry_of_lub): least_upper_bound(X, Y) = least_upper_bound(Y, X).
% 0.18/0.39 Axiom 2 (symmetry_of_glb): greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X).
% 0.18/0.39 Axiom 3 (ax_lub1d_1): greatest_lower_bound(a, c) = a.
% 0.18/0.39 Axiom 4 (ax_lub1d_2): greatest_lower_bound(b, c) = b.
% 0.18/0.39 Axiom 5 (lub_absorbtion): least_upper_bound(X, greatest_lower_bound(X, Y)) = X.
% 0.18/0.39 Axiom 6 (associativity_of_lub): least_upper_bound(X, least_upper_bound(Y, Z)) = least_upper_bound(least_upper_bound(X, Y), Z).
% 0.18/0.39
% 0.18/0.39 Goal 1 (prove_ax_lub1d): least_upper_bound(least_upper_bound(a, b), c) = c.
% 0.18/0.39 Proof:
% 0.18/0.39 least_upper_bound(least_upper_bound(a, b), c)
% 0.18/0.39 = { by axiom 6 (associativity_of_lub) R->L }
% 0.18/0.39 least_upper_bound(a, least_upper_bound(b, c))
% 0.18/0.39 = { by axiom 1 (symmetry_of_lub) }
% 0.18/0.39 least_upper_bound(a, least_upper_bound(c, b))
% 0.18/0.39 = { by axiom 4 (ax_lub1d_2) R->L }
% 0.18/0.39 least_upper_bound(a, least_upper_bound(c, greatest_lower_bound(b, c)))
% 0.18/0.39 = { by axiom 2 (symmetry_of_glb) }
% 0.18/0.39 least_upper_bound(a, least_upper_bound(c, greatest_lower_bound(c, b)))
% 0.18/0.39 = { by axiom 5 (lub_absorbtion) }
% 0.18/0.39 least_upper_bound(a, c)
% 0.18/0.39 = { by axiom 1 (symmetry_of_lub) R->L }
% 0.18/0.39 least_upper_bound(c, a)
% 0.18/0.39 = { by axiom 3 (ax_lub1d_1) R->L }
% 0.18/0.39 least_upper_bound(c, greatest_lower_bound(a, c))
% 0.18/0.39 = { by axiom 2 (symmetry_of_glb) R->L }
% 0.18/0.39 least_upper_bound(c, greatest_lower_bound(c, a))
% 0.18/0.39 = { by axiom 5 (lub_absorbtion) }
% 0.18/0.39 c
% 0.18/0.39 % SZS output end Proof
% 0.18/0.39
% 0.18/0.39 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------