TSTP Solution File: MGT010-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : MGT010-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 : n004.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.55s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT010-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.34 % Computer : n004.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.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 06:19:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.55 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.20/0.55
% 0.20/0.55 % SZS status Unsatisfiable
% 0.20/0.55
% 0.20/0.58 % SZS output start Proof
% 0.20/0.58 Take the following subset of the input axioms:
% 0.20/0.58 fof(a2_FOL_2, hypothesis, ![B, C, D, E, F, G, H, I, J, A2]: (~organization(A2, B) | (~organization(C, D) | (~reliability(A2, E, B) | (~reliability(C, F, D) | (~accountability(A2, G, B) | (~accountability(C, H, D) | (~reproducibility(A2, I, B) | (~reproducibility(C, J, D) | (~greater(J, I) | greater(F, E))))))))))).
% 0.20/0.58 fof(a2_FOL_3, hypothesis, ![B2, C2, D2, E2, F2, G2, H2, I2, A2_2, J2]: (~organization(A2_2, B2) | (~organization(C2, D2) | (~reliability(A2_2, E2, B2) | (~reliability(C2, F2, D2) | (~accountability(A2_2, G2, B2) | (~accountability(C2, H2, D2) | (~reproducibility(A2_2, I2, B2) | (~reproducibility(C2, J2, D2) | (~greater(J2, I2) | greater(H2, G2))))))))))).
% 0.20/0.58 fof(mp3_1, axiom, ![B2, A2_2]: (~organization(A2_2, B2) | reproducibility(A2_2, sk1(B2, A2_2), B2))).
% 0.20/0.58 fof(t10_FOL_10, negated_conjecture, class(sk2, sk4, sk11)).
% 0.20/0.58 fof(t10_FOL_11, negated_conjecture, class(sk3, sk4, sk12)).
% 0.20/0.58 fof(t10_FOL_12, negated_conjecture, reliability(sk2, sk5, sk11)).
% 0.20/0.58 fof(t10_FOL_13, negated_conjecture, reliability(sk3, sk6, sk12)).
% 0.20/0.58 fof(t10_FOL_14, negated_conjecture, accountability(sk2, sk7, sk11)).
% 0.20/0.59 fof(t10_FOL_15, negated_conjecture, accountability(sk3, sk8, sk12)).
% 0.20/0.59 fof(t10_FOL_16, negated_conjecture, size(sk2, sk9, sk11)).
% 0.20/0.59 fof(t10_FOL_17, negated_conjecture, size(sk3, sk10, sk12)).
% 0.20/0.59 fof(t10_FOL_18, negated_conjecture, greater(sk10, sk9)).
% 0.20/0.59 fof(t10_FOL_19, negated_conjecture, ~greater(sk6, sk5) | ~greater(sk8, sk7)).
% 0.20/0.59 fof(t10_FOL_6, negated_conjecture, organization(sk2, sk11)).
% 0.20/0.59 fof(t10_FOL_7, negated_conjecture, organization(sk3, sk12)).
% 0.20/0.59 fof(t10_FOL_8, negated_conjecture, reorganization_free(sk2, sk11, sk11)).
% 0.20/0.59 fof(t10_FOL_9, negated_conjecture, reorganization_free(sk3, sk12, sk12)).
% 0.20/0.59 fof(t9_FOL_5, hypothesis, ![B2, C2, D2, E2, F2, G2, H2, I2, A2_2]: (~organization(A2_2, B2) | (~organization(C2, D2) | (~reorganization_free(A2_2, B2, B2) | (~reorganization_free(C2, D2, D2) | (~class(A2_2, E2, B2) | (~class(C2, E2, D2) | (~reproducibility(A2_2, F2, B2) | (~reproducibility(C2, G2, D2) | (~size(A2_2, H2, B2) | (~size(C2, I2, D2) | (~greater(I2, H2) | greater(G2, F2))))))))))))).
% 0.20/0.59
% 0.20/0.59 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.59 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.59 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.59 fresh(y, y, x1...xn) = u
% 0.20/0.59 C => fresh(s, t, x1...xn) = v
% 0.20/0.59 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.59 variables of u and v.
% 0.20/0.59 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.59 input problem has no model of domain size 1).
% 0.20/0.59
% 0.20/0.59 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.59
% 0.20/0.59 Axiom 1 (t10_FOL_18): greater(sk10, sk9) = true.
% 0.20/0.59 Axiom 2 (t10_FOL_6): organization(sk2, sk11) = true.
% 0.20/0.59 Axiom 3 (t10_FOL_7): organization(sk3, sk12) = true.
% 0.20/0.59 Axiom 4 (t10_FOL_12): reliability(sk2, sk5, sk11) = true.
% 0.20/0.59 Axiom 5 (t10_FOL_13): reliability(sk3, sk6, sk12) = true.
% 0.20/0.59 Axiom 6 (t10_FOL_14): accountability(sk2, sk7, sk11) = true.
% 0.20/0.59 Axiom 7 (t10_FOL_15): accountability(sk3, sk8, sk12) = true.
% 0.20/0.59 Axiom 8 (t10_FOL_8): reorganization_free(sk2, sk11, sk11) = true.
% 0.20/0.59 Axiom 9 (t10_FOL_9): reorganization_free(sk3, sk12, sk12) = true.
% 0.20/0.59 Axiom 10 (t10_FOL_10): class(sk2, sk4, sk11) = true.
% 0.20/0.59 Axiom 11 (t10_FOL_11): class(sk3, sk4, sk12) = true.
% 0.20/0.59 Axiom 12 (t10_FOL_16): size(sk2, sk9, sk11) = true.
% 0.20/0.59 Axiom 13 (t10_FOL_17): size(sk3, sk10, sk12) = true.
% 0.20/0.59 Axiom 14 (mp3_1): fresh(X, X, Y, Z) = true.
% 0.20/0.59 Axiom 15 (a2_FOL_2): fresh40(X, X, Y, Z) = true.
% 0.20/0.59 Axiom 16 (a2_FOL_3): fresh31(X, X, Y, Z) = true.
% 0.20/0.59 Axiom 17 (t9_FOL_5): fresh12(X, X, Y, Z) = true.
% 0.20/0.59 Axiom 18 (mp3_1): fresh(organization(X, Y), true, X, Y) = reproducibility(X, sk1(Y, X), Y).
% 0.20/0.59 Axiom 19 (a2_FOL_2): fresh38(X, X, Y, Z, W, V) = greater(W, Z).
% 0.20/0.59 Axiom 20 (a2_FOL_3): fresh29(X, X, Y, Z, W, V) = greater(W, Z).
% 0.20/0.59 Axiom 21 (t9_FOL_5): fresh10(X, X, Y, Z, W, V) = greater(W, Z).
% 0.20/0.59 Axiom 22 (a2_FOL_2): fresh39(X, X, Y, Z, W, V, U, T) = fresh40(organization(Y, T), true, V, U).
% 0.20/0.59 Axiom 23 (a2_FOL_3): fresh30(X, X, Y, Z, W, V, U, T) = fresh31(organization(Y, T), true, V, U).
% 0.20/0.59 Axiom 24 (t9_FOL_5): fresh11(X, X, Y, Z, W, V, U, T) = fresh12(organization(Y, T), true, V, U).
% 0.20/0.59 Axiom 25 (t9_FOL_5): fresh9(X, X, Y, Z, W, V, U, T) = fresh10(organization(Z, W), true, Y, V, U, T).
% 0.20/0.59 Axiom 26 (a2_FOL_2): fresh37(X, X, Y, Z, W, V, U, T, S) = fresh38(organization(Z, W), true, Y, V, U, S).
% 0.20/0.59 Axiom 27 (a2_FOL_3): fresh28(X, X, Y, Z, W, V, U, T, S) = fresh29(organization(Z, W), true, Y, V, U, S).
% 0.20/0.59 Axiom 28 (t9_FOL_5): fresh7(X, X, Y, Z, W, V, U, T, S, X2) = fresh8(greater(S, T), true, Y, Z, W, V, U, X2).
% 0.20/0.59 Axiom 29 (a2_FOL_2): fresh36(X, X, Y, Z, W, V, U, T, S, X2) = fresh39(reproducibility(Y, T, X2), true, Y, Z, W, V, U, X2).
% 0.20/0.59 Axiom 30 (a2_FOL_3): fresh27(X, X, Y, Z, W, V, U, T, S, X2) = fresh30(reproducibility(Y, T, X2), true, Y, Z, W, V, U, X2).
% 0.20/0.59 Axiom 31 (t9_FOL_5): fresh8(X, X, Y, Z, W, V, U, T) = fresh11(reproducibility(Y, V, T), true, Y, Z, W, V, U, T).
% 0.20/0.59 Axiom 32 (t9_FOL_5): fresh6(X, X, Y, Z, W, V, U, T, S, X2) = fresh9(reproducibility(Z, U, W), true, Y, Z, W, V, U, X2).
% 0.20/0.59 Axiom 33 (a2_FOL_2): fresh35(X, X, Y, Z, W, V, U, T, S, X2) = fresh37(reproducibility(Z, S, W), true, Y, Z, W, V, U, T, X2).
% 0.20/0.59 Axiom 34 (a2_FOL_3): fresh26(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh28(reproducibility(Z, S, W), true, Y, Z, W, V, U, T, X2).
% 0.20/0.59 Axiom 35 (a2_FOL_2): fresh34(X, X, Y, Z, W, V, U, T, S, X2) = fresh36(reliability(Y, V, X2), true, Y, Z, W, V, U, T, S, X2).
% 0.20/0.59 Axiom 36 (a2_FOL_2): fresh33(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh35(reliability(Z, U, W), true, Y, Z, W, V, U, T, S, X2).
% 0.20/0.59 Axiom 37 (a2_FOL_2): fresh32(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh34(accountability(Y, Z2, Y2), true, Y, Z, W, V, U, S, X2, Y2).
% 0.20/0.59 Axiom 38 (a2_FOL_3): fresh25(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh27(reliability(Y, Z2, Y2), true, Y, Z, W, U, T, S, X2, Y2).
% 0.20/0.59 Axiom 39 (t9_FOL_5): fresh5(X, X, Y, Z, W, V, U, T, S, X2) = fresh7(reorganization_free(Y, X2, X2), true, Y, Z, W, V, U, T, S, X2).
% 0.20/0.59 Axiom 40 (t9_FOL_5): fresh4(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh6(reorganization_free(Z, W, W), true, Y, Z, W, U, T, S, X2, Y2).
% 0.20/0.59 Axiom 41 (t9_FOL_5): fresh3(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh5(class(Y, V, Y2), true, Y, Z, W, U, T, S, X2, Y2).
% 0.20/0.59 Axiom 42 (a2_FOL_2): fresh32(greater(X, Y), true, Z, W, V, U, T, S, Y, X, X2, Y2) = fresh33(accountability(W, S, V), true, Z, W, V, U, T, Y, X, X2, Y2).
% 0.20/0.59 Axiom 43 (a2_FOL_3): fresh24(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh26(reliability(Z, V, W), true, Y, Z, W, U, T, S, X2, Y2, Z2).
% 0.20/0.59 Axiom 44 (t9_FOL_5): fresh2(X, X, Y, Z, W, V, U, T, S, X2, Y2) = fresh4(class(Z, V, W), true, Y, Z, W, V, U, T, S, X2, Y2).
% 0.20/0.59 Axiom 45 (t9_FOL_5): fresh2(size(X, Y, Z), true, W, X, Z, V, U, T, S, Y, X2) = fresh3(size(W, S, X2), true, W, X, Z, V, U, T, S, Y, X2).
% 0.20/0.59 Axiom 46 (a2_FOL_3): fresh23(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh25(accountability(Y, U, Y2), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.59 Axiom 47 (a2_FOL_3): fresh23(greater(X, Y), true, Z, W, V, U, T, S, Y, X, X2, Y2) = fresh24(accountability(W, S, V), true, Z, W, V, U, T, S, Y, X, X2, Y2).
% 0.20/0.59
% 0.20/0.59 Lemma 48: reproducibility(sk2, sk1(sk11, sk2), sk11) = true.
% 0.20/0.59 Proof:
% 0.20/0.59 reproducibility(sk2, sk1(sk11, sk2), sk11)
% 0.20/0.59 = { by axiom 18 (mp3_1) R->L }
% 0.20/0.59 fresh(organization(sk2, sk11), true, sk2, sk11)
% 0.20/0.59 = { by axiom 2 (t10_FOL_6) }
% 0.20/0.59 fresh(true, true, sk2, sk11)
% 0.20/0.59 = { by axiom 14 (mp3_1) }
% 0.20/0.59 true
% 0.20/0.59
% 0.20/0.59 Lemma 49: reproducibility(sk3, sk1(sk12, sk3), sk12) = true.
% 0.20/0.59 Proof:
% 0.20/0.59 reproducibility(sk3, sk1(sk12, sk3), sk12)
% 0.20/0.59 = { by axiom 18 (mp3_1) R->L }
% 0.20/0.59 fresh(organization(sk3, sk12), true, sk3, sk12)
% 0.20/0.59 = { by axiom 3 (t10_FOL_7) }
% 0.20/0.59 fresh(true, true, sk3, sk12)
% 0.20/0.59 = { by axiom 14 (mp3_1) }
% 0.20/0.59 true
% 0.20/0.59
% 0.20/0.59 Lemma 50: greater(sk1(sk12, sk3), sk1(sk11, sk2)) = true.
% 0.20/0.59 Proof:
% 0.20/0.59 greater(sk1(sk12, sk3), sk1(sk11, sk2))
% 0.20/0.59 = { by axiom 21 (t9_FOL_5) R->L }
% 0.20/0.59 fresh10(true, true, sk2, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by axiom 3 (t10_FOL_7) R->L }
% 0.20/0.59 fresh10(organization(sk3, sk12), true, sk2, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by axiom 25 (t9_FOL_5) R->L }
% 0.20/0.59 fresh9(true, true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by lemma 49 R->L }
% 0.20/0.59 fresh9(reproducibility(sk3, sk1(sk12, sk3), sk12), true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by axiom 32 (t9_FOL_5) R->L }
% 0.20/0.59 fresh6(true, true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 9 (t10_FOL_9) R->L }
% 0.20/0.59 fresh6(reorganization_free(sk3, sk12, sk12), true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 40 (t9_FOL_5) R->L }
% 0.20/0.59 fresh4(true, true, sk2, sk3, sk12, sk4, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 11 (t10_FOL_11) R->L }
% 0.20/0.59 fresh4(class(sk3, sk4, sk12), true, sk2, sk3, sk12, sk4, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 44 (t9_FOL_5) R->L }
% 0.20/0.59 fresh2(true, true, sk2, sk3, sk12, sk4, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 13 (t10_FOL_17) R->L }
% 0.20/0.59 fresh2(size(sk3, sk10, sk12), true, sk2, sk3, sk12, sk4, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 45 (t9_FOL_5) }
% 0.20/0.59 fresh3(size(sk2, sk9, sk11), true, sk2, sk3, sk12, sk4, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 12 (t10_FOL_16) }
% 0.20/0.59 fresh3(true, true, sk2, sk3, sk12, sk4, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 41 (t9_FOL_5) }
% 0.20/0.59 fresh5(class(sk2, sk4, sk11), true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 10 (t10_FOL_10) }
% 0.20/0.59 fresh5(true, true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 39 (t9_FOL_5) }
% 0.20/0.59 fresh7(reorganization_free(sk2, sk11, sk11), true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 8 (t10_FOL_8) }
% 0.20/0.59 fresh7(true, true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk9, sk10, sk11)
% 0.20/0.59 = { by axiom 28 (t9_FOL_5) }
% 0.20/0.59 fresh8(greater(sk10, sk9), true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by axiom 1 (t10_FOL_18) }
% 0.20/0.59 fresh8(true, true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by axiom 31 (t9_FOL_5) }
% 0.20/0.59 fresh11(reproducibility(sk2, sk1(sk11, sk2), sk11), true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by lemma 48 }
% 0.20/0.59 fresh11(true, true, sk2, sk3, sk12, sk1(sk11, sk2), sk1(sk12, sk3), sk11)
% 0.20/0.59 = { by axiom 24 (t9_FOL_5) }
% 0.20/0.59 fresh12(organization(sk2, sk11), true, sk1(sk11, sk2), sk1(sk12, sk3))
% 0.20/0.59 = { by axiom 2 (t10_FOL_6) }
% 0.20/0.59 fresh12(true, true, sk1(sk11, sk2), sk1(sk12, sk3))
% 0.20/0.59 = { by axiom 17 (t9_FOL_5) }
% 0.20/0.59 true
% 0.20/0.59
% 0.20/0.59 Goal 1 (t10_FOL_19): tuple(greater(sk6, sk5), greater(sk8, sk7)) = tuple(true, true).
% 0.20/0.59 Proof:
% 0.20/0.59 tuple(greater(sk6, sk5), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 19 (a2_FOL_2) R->L }
% 0.20/0.59 tuple(fresh38(true, true, sk2, sk5, sk6, sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 3 (t10_FOL_7) R->L }
% 0.20/0.59 tuple(fresh38(organization(sk3, sk12), true, sk2, sk5, sk6, sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 26 (a2_FOL_2) R->L }
% 0.20/0.59 tuple(fresh37(true, true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by lemma 49 R->L }
% 0.20/0.59 tuple(fresh37(reproducibility(sk3, sk1(sk12, sk3), sk12), true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 33 (a2_FOL_2) R->L }
% 0.20/0.59 tuple(fresh35(true, true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 5 (t10_FOL_13) R->L }
% 0.20/0.59 tuple(fresh35(reliability(sk3, sk6, sk12), true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 36 (a2_FOL_2) R->L }
% 0.20/0.59 tuple(fresh33(true, true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk7), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 7 (t10_FOL_15) R->L }
% 0.20/0.59 tuple(fresh33(accountability(sk3, sk8, sk12), true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk7), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 42 (a2_FOL_2) R->L }
% 0.20/0.59 tuple(fresh32(greater(sk1(sk12, sk3), sk1(sk11, sk2)), true, sk2, sk3, sk12, sk5, sk6, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk7), greater(sk8, sk7))
% 0.20/0.59 = { by lemma 50 }
% 0.20/0.59 tuple(fresh32(true, true, sk2, sk3, sk12, sk5, sk6, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk7), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 37 (a2_FOL_2) }
% 0.20/0.59 tuple(fresh34(accountability(sk2, sk7, sk11), true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 6 (t10_FOL_14) }
% 0.20/0.59 tuple(fresh34(true, true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 35 (a2_FOL_2) }
% 0.20/0.59 tuple(fresh36(reliability(sk2, sk5, sk11), true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 4 (t10_FOL_12) }
% 0.20/0.59 tuple(fresh36(true, true, sk2, sk3, sk12, sk5, sk6, sk1(sk11, sk2), sk1(sk12, sk3), sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 29 (a2_FOL_2) }
% 0.20/0.59 tuple(fresh39(reproducibility(sk2, sk1(sk11, sk2), sk11), true, sk2, sk3, sk12, sk5, sk6, sk11), greater(sk8, sk7))
% 0.20/0.59 = { by lemma 48 }
% 0.20/0.59 tuple(fresh39(true, true, sk2, sk3, sk12, sk5, sk6, sk11), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 22 (a2_FOL_2) }
% 0.20/0.59 tuple(fresh40(organization(sk2, sk11), true, sk5, sk6), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 2 (t10_FOL_6) }
% 0.20/0.59 tuple(fresh40(true, true, sk5, sk6), greater(sk8, sk7))
% 0.20/0.59 = { by axiom 15 (a2_FOL_2) }
% 0.20/0.59 tuple(true, greater(sk8, sk7))
% 0.20/0.59 = { by axiom 20 (a2_FOL_3) R->L }
% 0.20/0.59 tuple(true, fresh29(true, true, sk2, sk7, sk8, sk11))
% 0.20/0.59 = { by axiom 3 (t10_FOL_7) R->L }
% 0.20/0.59 tuple(true, fresh29(organization(sk3, sk12), true, sk2, sk7, sk8, sk11))
% 0.20/0.59 = { by axiom 27 (a2_FOL_3) R->L }
% 0.20/0.59 tuple(true, fresh28(true, true, sk2, sk3, sk12, sk7, sk8, sk1(sk11, sk2), sk11))
% 0.20/0.59 = { by lemma 49 R->L }
% 0.20/0.59 tuple(true, fresh28(reproducibility(sk3, sk1(sk12, sk3), sk12), true, sk2, sk3, sk12, sk7, sk8, sk1(sk11, sk2), sk11))
% 0.20/0.59 = { by axiom 34 (a2_FOL_3) R->L }
% 0.20/0.59 tuple(true, fresh26(true, true, sk2, sk3, sk12, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 5 (t10_FOL_13) R->L }
% 0.20/0.59 tuple(true, fresh26(reliability(sk3, sk6, sk12), true, sk2, sk3, sk12, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 43 (a2_FOL_3) R->L }
% 0.20/0.59 tuple(true, fresh24(true, true, sk2, sk3, sk12, sk6, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 7 (t10_FOL_15) R->L }
% 0.20/0.59 tuple(true, fresh24(accountability(sk3, sk8, sk12), true, sk2, sk3, sk12, sk6, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 47 (a2_FOL_3) R->L }
% 0.20/0.59 tuple(true, fresh23(greater(sk1(sk12, sk3), sk1(sk11, sk2)), true, sk2, sk3, sk12, sk6, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by lemma 50 }
% 0.20/0.59 tuple(true, fresh23(true, true, sk2, sk3, sk12, sk6, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 46 (a2_FOL_3) }
% 0.20/0.59 tuple(true, fresh25(accountability(sk2, sk7, sk11), true, sk2, sk3, sk12, sk6, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 6 (t10_FOL_14) }
% 0.20/0.59 tuple(true, fresh25(true, true, sk2, sk3, sk12, sk6, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11, sk5))
% 0.20/0.59 = { by axiom 38 (a2_FOL_3) }
% 0.20/0.59 tuple(true, fresh27(reliability(sk2, sk5, sk11), true, sk2, sk3, sk12, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11))
% 0.20/0.59 = { by axiom 4 (t10_FOL_12) }
% 0.20/0.59 tuple(true, fresh27(true, true, sk2, sk3, sk12, sk7, sk8, sk1(sk11, sk2), sk1(sk12, sk3), sk11))
% 0.20/0.59 = { by axiom 30 (a2_FOL_3) }
% 0.20/0.59 tuple(true, fresh30(reproducibility(sk2, sk1(sk11, sk2), sk11), true, sk2, sk3, sk12, sk7, sk8, sk11))
% 0.20/0.59 = { by lemma 48 }
% 0.20/0.59 tuple(true, fresh30(true, true, sk2, sk3, sk12, sk7, sk8, sk11))
% 0.20/0.59 = { by axiom 23 (a2_FOL_3) }
% 0.20/0.59 tuple(true, fresh31(organization(sk2, sk11), true, sk7, sk8))
% 0.20/0.59 = { by axiom 2 (t10_FOL_6) }
% 0.20/0.59 tuple(true, fresh31(true, true, sk7, sk8))
% 0.20/0.59 = { by axiom 16 (a2_FOL_3) }
% 0.20/0.59 tuple(true, true)
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59
% 0.20/0.59 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------