TSTP Solution File: MGT011-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : MGT011-1 : TPTP v8.1.2. Released v2.4.0.
% 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 : n013.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 09:16:58 EDT 2023
% Result : Unsatisfiable 0.20s 0.43s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT011-1 : TPTP v8.1.2. Released v2.4.0.
% 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.33 % Computer : n013.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 06:19:17 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.43 Command-line arguments: --no-flatten-goal
% 0.20/0.43
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43
% 0.20/0.47 % SZS output start Proof
% 0.20/0.47 Take the following subset of the input axioms:
% 0.20/0.47 fof(a5_FOL_25, hypothesis, ![B, C, D, E, F, G, H, I, A2]: (~organization(A2, B) | (~organization(C, D) | (~class(A2, E, B) | (~class(C, E, D) | (~size(A2, F, B) | (~size(C, G, D) | (~inertia(A2, H, B) | (~inertia(C, I, D) | (~greater(G, F) | greater(I, H))))))))))).
% 0.20/0.47 fof(mp10_24, axiom, ![B2, C2, D2, E2, A2_2]: (~organization(A2_2, B2) | (~organization(A2_2, C2) | (~reorganization_free(A2_2, B2, C2) | (~class(A2_2, D2, B2) | (~class(A2_2, E2, C2) | D2=E2)))))).
% 0.20/0.47 fof(mp5_20, axiom, ![B2, A2_2]: (~organization(A2_2, B2) | inertia(A2_2, sk1(B2, A2_2), B2))).
% 0.20/0.47 fof(mp6_1_21, axiom, ![A, B2]: (~greater(A, B2) | A!=B2)).
% 0.20/0.47 fof(mp6_2_22, axiom, ![B2, A3]: (~greater(A3, B2) | ~greater(B2, A3))).
% 0.20/0.47 fof(mp9_23, axiom, ![B2, A2_2]: (~organization(A2_2, B2) | class(A2_2, sk2(B2, A2_2), B2))).
% 0.20/0.47 fof(t11_FOL_27, negated_conjecture, organization(sk3, sk6)).
% 0.20/0.47 fof(t11_FOL_28, negated_conjecture, organization(sk3, sk7)).
% 0.20/0.47 fof(t11_FOL_29, negated_conjecture, reorganization_free(sk3, sk6, sk7)).
% 0.20/0.47 fof(t11_FOL_30, negated_conjecture, size(sk3, sk4, sk6)).
% 0.20/0.47 fof(t11_FOL_31, negated_conjecture, size(sk3, sk5, sk7)).
% 0.20/0.47 fof(t11_FOL_32, negated_conjecture, greater(sk7, sk6)).
% 0.20/0.47 fof(t11_FOL_33, negated_conjecture, greater(sk4, sk5)).
% 0.20/0.47 fof(t2_FOL_26, hypothesis, ![B2, C2, D2, E2, A2_2]: (~organization(A2_2, B2) | (~organization(A2_2, C2) | (~reorganization_free(A2_2, B2, C2) | (~inertia(A2_2, D2, B2) | (~inertia(A2_2, E2, C2) | (~greater(C2, B2) | greater(E2, D2)))))))).
% 0.20/0.47
% 0.20/0.47 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.47 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.47 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.47 fresh(y, y, x1...xn) = u
% 0.20/0.47 C => fresh(s, t, x1...xn) = v
% 0.20/0.47 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.47 variables of u and v.
% 0.20/0.47 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.47 input problem has no model of domain size 1).
% 0.20/0.47
% 0.20/0.47 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.47
% 0.20/0.47 Axiom 1 (t11_FOL_33): greater(sk4, sk5) = true2.
% 0.20/0.47 Axiom 2 (t11_FOL_32): greater(sk7, sk6) = true2.
% 0.20/0.47 Axiom 3 (t11_FOL_27): organization(sk3, sk6) = true2.
% 0.20/0.47 Axiom 4 (t11_FOL_28): organization(sk3, sk7) = true2.
% 0.20/0.47 Axiom 5 (t11_FOL_29): reorganization_free(sk3, sk6, sk7) = true2.
% 0.20/0.47 Axiom 6 (t11_FOL_30): size(sk3, sk4, sk6) = true2.
% 0.20/0.47 Axiom 7 (t11_FOL_31): size(sk3, sk5, sk7) = true2.
% 0.20/0.47 Axiom 8 (mp9_23): fresh(X, X, Y, Z) = true2.
% 0.20/0.47 Axiom 9 (mp10_24): fresh22(X, X, Y, Z) = Z.
% 0.20/0.47 Axiom 10 (a5_FOL_25): fresh17(X, X, Y, Z) = true2.
% 0.20/0.47 Axiom 11 (t2_FOL_26): fresh8(X, X, Y, Z) = true2.
% 0.20/0.47 Axiom 12 (mp5_20): fresh2(X, X, Y, Z) = true2.
% 0.20/0.47 Axiom 13 (mp9_23): fresh(organization(X, Y), true2, X, Y) = class(X, sk2(Y, X), Y).
% 0.20/0.47 Axiom 14 (mp10_24): fresh20(X, X, Y, Z, W, V) = W.
% 0.20/0.47 Axiom 15 (a5_FOL_25): fresh15(X, X, Y, Z, W, V) = greater(W, Z).
% 0.20/0.47 Axiom 16 (t2_FOL_26): fresh6(X, X, Y, Z, W, V) = greater(V, W).
% 0.20/0.47 Axiom 17 (mp5_20): fresh2(organization(X, Y), true2, X, Y) = inertia(X, sk1(Y, X), Y).
% 0.20/0.47 Axiom 18 (mp10_24): fresh21(X, X, Y, Z, W, V, U) = fresh22(organization(Y, Z), true2, V, U).
% 0.20/0.47 Axiom 19 (t2_FOL_26): fresh7(X, X, Y, Z, W, V, U) = fresh8(organization(Y, Z), true2, V, U).
% 0.20/0.47 Axiom 20 (mp10_24): fresh19(X, X, Y, Z, W, V, U) = fresh20(organization(Y, W), true2, Y, Z, V, U).
% 0.20/0.47 Axiom 21 (a5_FOL_25): fresh16(X, X, Y, Z, W, V, U, T) = fresh17(organization(Y, T), true2, V, U).
% 0.20/0.47 Axiom 22 (a5_FOL_25): fresh14(X, X, Y, Z, W, V, U, T) = fresh15(organization(Z, W), true2, Y, V, U, T).
% 0.20/0.47 Axiom 23 (t2_FOL_26): fresh5(X, X, Y, Z, W, V, U) = fresh6(organization(Y, W), true2, Y, Z, V, U).
% 0.20/0.47 Axiom 24 (t2_FOL_26): fresh3(X, X, Y, Z, W, V, U) = fresh4(greater(W, Z), true2, Y, Z, W, V, U).
% 0.20/0.47 Axiom 25 (mp10_24): fresh18(X, X, Y, Z, W, V, U) = fresh21(class(Y, V, Z), true2, Y, Z, W, V, U).
% 0.20/0.47 Axiom 26 (mp10_24): fresh18(reorganization_free(X, Y, Z), true2, X, Y, Z, W, V) = fresh19(class(X, V, Z), true2, X, Y, Z, W, V).
% 0.20/0.47 Axiom 27 (a5_FOL_25): fresh12(X, X, Y, Z, W, V, U, T, S, X2) = fresh13(greater(U, V), true2, Y, Z, W, T, S, X2).
% 0.20/0.47 Axiom 28 (t2_FOL_26): fresh4(X, X, Y, Z, W, V, U) = fresh7(inertia(Y, V, Z), true2, Y, Z, W, V, U).
% 0.20/0.47 Axiom 29 (t2_FOL_26): fresh3(reorganization_free(X, Y, Z), true2, X, Y, Z, W, V) = fresh5(inertia(X, V, Z), true2, X, Y, Z, W, V).
% 0.20/0.47 Axiom 30 (a5_FOL_25): fresh13(X, X, Y, Z, W, V, U, T) = fresh16(inertia(Y, V, T), true2, Y, Z, W, V, U, T).
% 0.20/0.47 Axiom 31 (a5_FOL_25): fresh11(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh14(inertia(Z, X2, W), true2, Y, Z, W, S, X2, Y2).
% 0.20/0.47 Axiom 32 (a5_FOL_25): fresh10(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh12(class(Y, V, Y2), true2, Y, Z, W, U, T, S, X2, Y2).
% 0.20/0.47 Axiom 33 (a5_FOL_25): fresh9(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh11(class(Z, V, W), true2, Y, Z, W, V, U, T, S, X2, Y2).
% 0.20/0.47 Axiom 34 (a5_FOL_25): fresh9(size(X, Y, Z), true2, W, X, Z, V, U, Y, T, S, X2) = fresh10(size(W, U, X2), true2, W, X, Z, V, U, Y, T, S, X2).
% 0.20/0.47
% 0.20/0.47 Lemma 35: inertia(sk3, sk1(sk6, sk3), sk6) = true2.
% 0.20/0.47 Proof:
% 0.20/0.47 inertia(sk3, sk1(sk6, sk3), sk6)
% 0.20/0.47 = { by axiom 17 (mp5_20) R->L }
% 0.20/0.47 fresh2(organization(sk3, sk6), true2, sk3, sk6)
% 0.20/0.47 = { by axiom 3 (t11_FOL_27) }
% 0.20/0.47 fresh2(true2, true2, sk3, sk6)
% 0.20/0.47 = { by axiom 12 (mp5_20) }
% 0.20/0.47 true2
% 0.20/0.47
% 0.20/0.47 Lemma 36: inertia(sk3, sk1(sk7, sk3), sk7) = true2.
% 0.20/0.47 Proof:
% 0.20/0.47 inertia(sk3, sk1(sk7, sk3), sk7)
% 0.20/0.47 = { by axiom 17 (mp5_20) R->L }
% 0.20/0.47 fresh2(organization(sk3, sk7), true2, sk3, sk7)
% 0.20/0.47 = { by axiom 4 (t11_FOL_28) }
% 0.20/0.47 fresh2(true2, true2, sk3, sk7)
% 0.20/0.47 = { by axiom 12 (mp5_20) }
% 0.20/0.47 true2
% 0.20/0.47
% 0.20/0.47 Lemma 37: class(sk3, sk2(sk6, sk3), sk6) = true2.
% 0.20/0.47 Proof:
% 0.20/0.47 class(sk3, sk2(sk6, sk3), sk6)
% 0.20/0.47 = { by axiom 13 (mp9_23) R->L }
% 0.20/0.47 fresh(organization(sk3, sk6), true2, sk3, sk6)
% 0.20/0.47 = { by axiom 3 (t11_FOL_27) }
% 0.20/0.47 fresh(true2, true2, sk3, sk6)
% 0.20/0.47 = { by axiom 8 (mp9_23) }
% 0.20/0.47 true2
% 0.20/0.47
% 0.20/0.47 Lemma 38: class(sk3, sk2(sk7, sk3), sk7) = true2.
% 0.20/0.47 Proof:
% 0.20/0.47 class(sk3, sk2(sk7, sk3), sk7)
% 0.20/0.47 = { by axiom 13 (mp9_23) R->L }
% 0.20/0.47 fresh(organization(sk3, sk7), true2, sk3, sk7)
% 0.20/0.47 = { by axiom 4 (t11_FOL_28) }
% 0.20/0.47 fresh(true2, true2, sk3, sk7)
% 0.20/0.47 = { by axiom 8 (mp9_23) }
% 0.20/0.47 true2
% 0.20/0.47
% 0.20/0.47 Goal 1 (mp6_2_22): tuple(greater(X, Y), greater(Y, X)) = tuple(true2, true2).
% 0.20/0.47 The goal is true when:
% 0.20/0.47 X = sk1(sk6, sk3)
% 0.20/0.47 Y = sk1(sk7, sk3)
% 0.20/0.47
% 0.20/0.47 Proof:
% 0.20/0.47 tuple(greater(sk1(sk6, sk3), sk1(sk7, sk3)), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 15 (a5_FOL_25) R->L }
% 0.20/0.47 tuple(fresh15(true2, true2, sk3, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 3 (t11_FOL_27) R->L }
% 0.20/0.47 tuple(fresh15(organization(sk3, sk6), true2, sk3, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 22 (a5_FOL_25) R->L }
% 0.20/0.47 tuple(fresh14(true2, true2, sk3, sk3, sk6, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by lemma 35 R->L }
% 0.20/0.47 tuple(fresh14(inertia(sk3, sk1(sk6, sk3), sk6), true2, sk3, sk3, sk6, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 31 (a5_FOL_25) R->L }
% 0.20/0.47 tuple(fresh11(true2, true2, sk3, sk3, sk6, sk2(sk6, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by lemma 37 R->L }
% 0.20/0.47 tuple(fresh11(class(sk3, sk2(sk6, sk3), sk6), true2, sk3, sk3, sk6, sk2(sk6, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 33 (a5_FOL_25) R->L }
% 0.20/0.47 tuple(fresh9(true2, true2, sk3, sk3, sk6, sk2(sk6, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 6 (t11_FOL_30) R->L }
% 0.20/0.47 tuple(fresh9(size(sk3, sk4, sk6), true2, sk3, sk3, sk6, sk2(sk6, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 34 (a5_FOL_25) }
% 0.20/0.47 tuple(fresh10(size(sk3, sk5, sk7), true2, sk3, sk3, sk6, sk2(sk6, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 7 (t11_FOL_31) }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, sk2(sk6, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 14 (mp10_24) R->L }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh20(true2, true2, sk3, sk6, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 4 (t11_FOL_28) R->L }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh20(organization(sk3, sk7), true2, sk3, sk6, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 20 (mp10_24) R->L }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh19(true2, true2, sk3, sk6, sk7, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by lemma 38 R->L }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh19(class(sk3, sk2(sk7, sk3), sk7), true2, sk3, sk6, sk7, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 26 (mp10_24) R->L }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh18(reorganization_free(sk3, sk6, sk7), true2, sk3, sk6, sk7, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 5 (t11_FOL_29) }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh18(true2, true2, sk3, sk6, sk7, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 25 (mp10_24) }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh21(class(sk3, sk2(sk6, sk3), sk6), true2, sk3, sk6, sk7, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by lemma 37 }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh21(true2, true2, sk3, sk6, sk7, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 18 (mp10_24) }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh22(organization(sk3, sk6), true2, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 3 (t11_FOL_27) }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, fresh22(true2, true2, sk2(sk6, sk3), sk2(sk7, sk3)), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 9 (mp10_24) }
% 0.20/0.47 tuple(fresh10(true2, true2, sk3, sk3, sk6, sk2(sk7, sk3), sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 32 (a5_FOL_25) }
% 0.20/0.47 tuple(fresh12(class(sk3, sk2(sk7, sk3), sk7), true2, sk3, sk3, sk6, sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by lemma 38 }
% 0.20/0.47 tuple(fresh12(true2, true2, sk3, sk3, sk6, sk5, sk4, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 27 (a5_FOL_25) }
% 0.20/0.47 tuple(fresh13(greater(sk4, sk5), true2, sk3, sk3, sk6, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 1 (t11_FOL_33) }
% 0.20/0.47 tuple(fresh13(true2, true2, sk3, sk3, sk6, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 30 (a5_FOL_25) }
% 0.20/0.47 tuple(fresh16(inertia(sk3, sk1(sk7, sk3), sk7), true2, sk3, sk3, sk6, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by lemma 36 }
% 0.20/0.47 tuple(fresh16(true2, true2, sk3, sk3, sk6, sk1(sk7, sk3), sk1(sk6, sk3), sk7), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 21 (a5_FOL_25) }
% 0.20/0.47 tuple(fresh17(organization(sk3, sk7), true2, sk1(sk7, sk3), sk1(sk6, sk3)), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 4 (t11_FOL_28) }
% 0.20/0.47 tuple(fresh17(true2, true2, sk1(sk7, sk3), sk1(sk6, sk3)), greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 10 (a5_FOL_25) }
% 0.20/0.47 tuple(true2, greater(sk1(sk7, sk3), sk1(sk6, sk3)))
% 0.20/0.47 = { by axiom 16 (t2_FOL_26) R->L }
% 0.20/0.47 tuple(true2, fresh6(true2, true2, sk3, sk6, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 4 (t11_FOL_28) R->L }
% 0.20/0.47 tuple(true2, fresh6(organization(sk3, sk7), true2, sk3, sk6, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 23 (t2_FOL_26) R->L }
% 0.20/0.47 tuple(true2, fresh5(true2, true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by lemma 36 R->L }
% 0.20/0.47 tuple(true2, fresh5(inertia(sk3, sk1(sk7, sk3), sk7), true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 29 (t2_FOL_26) R->L }
% 0.20/0.47 tuple(true2, fresh3(reorganization_free(sk3, sk6, sk7), true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 5 (t11_FOL_29) }
% 0.20/0.47 tuple(true2, fresh3(true2, true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 24 (t2_FOL_26) }
% 0.20/0.47 tuple(true2, fresh4(greater(sk7, sk6), true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 2 (t11_FOL_32) }
% 0.20/0.47 tuple(true2, fresh4(true2, true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 28 (t2_FOL_26) }
% 0.20/0.47 tuple(true2, fresh7(inertia(sk3, sk1(sk6, sk3), sk6), true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by lemma 35 }
% 0.20/0.47 tuple(true2, fresh7(true2, true2, sk3, sk6, sk7, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 19 (t2_FOL_26) }
% 0.20/0.47 tuple(true2, fresh8(organization(sk3, sk6), true2, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 3 (t11_FOL_27) }
% 0.20/0.47 tuple(true2, fresh8(true2, true2, sk1(sk6, sk3), sk1(sk7, sk3)))
% 0.20/0.47 = { by axiom 11 (t2_FOL_26) }
% 0.20/0.47 tuple(true2, true2)
% 0.20/0.47 % SZS output end Proof
% 0.20/0.47
% 0.20/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------