TSTP Solution File: GRP165-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP165-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 : n020.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:26 EDT 2023
% Result : Unsatisfiable 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP165-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.35 % Computer : n020.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 29 00:13:28 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.20/0.40 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.20/0.40
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40
% 0.20/0.40 % SZS output start Proof
% 0.20/0.40 Axiom 1 (symmetry_of_lub): least_upper_bound(X, Y) = least_upper_bound(Y, X).
% 0.20/0.40 Axiom 2 (lat1a_1): least_upper_bound(a, identity) = a.
% 0.20/0.40 Axiom 3 (left_identity): multiply(identity, X) = X.
% 0.20/0.40 Axiom 4 (monotony_lub2): multiply(least_upper_bound(X, Y), Z) = least_upper_bound(multiply(X, Z), multiply(Y, Z)).
% 0.20/0.40
% 0.20/0.40 Goal 1 (prove_lat1a): least_upper_bound(a, multiply(a, a)) = multiply(a, a).
% 0.20/0.40 Proof:
% 0.20/0.40 least_upper_bound(a, multiply(a, a))
% 0.20/0.40 = { by axiom 3 (left_identity) R->L }
% 0.20/0.40 least_upper_bound(multiply(identity, a), multiply(a, a))
% 0.20/0.40 = { by axiom 4 (monotony_lub2) R->L }
% 0.20/0.40 multiply(least_upper_bound(identity, a), a)
% 0.20/0.40 = { by axiom 1 (symmetry_of_lub) R->L }
% 0.20/0.40 multiply(least_upper_bound(a, identity), a)
% 0.20/0.40 = { by axiom 2 (lat1a_1) }
% 0.20/0.40 multiply(a, a)
% 0.20/0.40 % SZS output end Proof
% 0.20/0.40
% 0.20/0.40 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------