TSTP Solution File: GRP155-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP155-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 : 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:17:23 EDT 2023
% Result : Unsatisfiable 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP155-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/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.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 21:16:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.39 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.20/0.39
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 Axiom 1 (symmetry_of_glb): greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X).
% 0.20/0.39 Axiom 2 (ax_mono1b): greatest_lower_bound(a, b) = a.
% 0.20/0.39 Axiom 3 (monotony_glb2): multiply(greatest_lower_bound(X, Y), Z) = greatest_lower_bound(multiply(X, Z), multiply(Y, Z)).
% 0.20/0.39
% 0.20/0.39 Goal 1 (prove_ax_mono1b): greatest_lower_bound(multiply(a, c), multiply(b, c)) = multiply(a, c).
% 0.20/0.39 Proof:
% 0.20/0.39 greatest_lower_bound(multiply(a, c), multiply(b, c))
% 0.20/0.39 = { by axiom 1 (symmetry_of_glb) }
% 0.20/0.39 greatest_lower_bound(multiply(b, c), multiply(a, c))
% 0.20/0.39 = { by axiom 3 (monotony_glb2) R->L }
% 0.20/0.39 multiply(greatest_lower_bound(b, a), c)
% 0.20/0.39 = { by axiom 1 (symmetry_of_glb) R->L }
% 0.20/0.39 multiply(greatest_lower_bound(a, b), c)
% 0.20/0.39 = { by axiom 2 (ax_mono1b) }
% 0.20/0.39 multiply(a, c)
% 0.20/0.39 % SZS output end Proof
% 0.20/0.39
% 0.20/0.39 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------