TSTP Solution File: GRP168-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP168-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 : 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:17:28 EDT 2023
% Result : Unsatisfiable 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP168-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 23:37:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.38 Command-line arguments: --no-flatten-goal
% 0.13/0.38
% 0.13/0.38 % SZS status Unsatisfiable
% 0.13/0.38
% 0.13/0.38 % SZS output start Proof
% 0.13/0.38 Axiom 1 (p01a_1): least_upper_bound(a, b) = b.
% 0.13/0.38 Axiom 2 (monotony_lub1): multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z)).
% 0.13/0.38 Axiom 3 (monotony_lub2): multiply(least_upper_bound(X, Y), Z) = least_upper_bound(multiply(X, Z), multiply(Y, Z)).
% 0.13/0.38
% 0.13/0.38 Goal 1 (prove_p01a): least_upper_bound(multiply(inverse(c), multiply(a, c)), multiply(inverse(c), multiply(b, c))) = multiply(inverse(c), multiply(b, c)).
% 0.13/0.38 Proof:
% 0.13/0.38 least_upper_bound(multiply(inverse(c), multiply(a, c)), multiply(inverse(c), multiply(b, c)))
% 0.13/0.38 = { by axiom 2 (monotony_lub1) R->L }
% 0.13/0.38 multiply(inverse(c), least_upper_bound(multiply(a, c), multiply(b, c)))
% 0.13/0.38 = { by axiom 3 (monotony_lub2) R->L }
% 0.13/0.38 multiply(inverse(c), multiply(least_upper_bound(a, b), c))
% 0.13/0.38 = { by axiom 1 (p01a_1) }
% 0.13/0.38 multiply(inverse(c), multiply(b, c))
% 0.13/0.38 % SZS output end Proof
% 0.13/0.38
% 0.13/0.38 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------