TSTP Solution File: GRP004-2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP004-2 : TPTP v8.1.2. Released v1.0.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 : n001.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:16:31 EDT 2023
% Result : Unsatisfiable 0.18s 0.40s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP004-2 : TPTP v8.1.2. Released v1.0.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.12/0.33 % Computer : n001.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 20:42:50 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.40 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.18/0.40
% 0.18/0.40 % SZS status Unsatisfiable
% 0.18/0.40
% 0.18/0.40 % SZS output start Proof
% 0.18/0.40 Take the following subset of the input axioms:
% 0.18/0.40 fof(associativity1, axiom, ![X, Y, Z, W, U, V]: (~product(X, Y, U) | (~product(Y, Z, V) | (~product(U, Z, W) | product(X, V, W))))).
% 0.18/0.40 fof(associativity2, axiom, ![X2, Y2, Z2, W2, U2, V2]: (~product(X2, Y2, U2) | (~product(Y2, Z2, V2) | (~product(X2, V2, W2) | product(U2, Z2, W2))))).
% 0.18/0.40 fof(left_identity, axiom, ![X2]: product(identity, X2, X2)).
% 0.18/0.40 fof(left_inverse, axiom, ![X2]: product(inverse(X2), X2, identity)).
% 0.18/0.40 fof(prove_right_inverse, negated_conjecture, ~product(a, inverse(a), identity)).
% 0.18/0.40
% 0.18/0.40 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.18/0.40 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.18/0.40 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.18/0.40 fresh(y, y, x1...xn) = u
% 0.18/0.40 C => fresh(s, t, x1...xn) = v
% 0.18/0.40 where fresh is a fresh function symbol and x1..xn are the free
% 0.18/0.40 variables of u and v.
% 0.18/0.40 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.18/0.40 input problem has no model of domain size 1).
% 0.18/0.40
% 0.18/0.40 The encoding turns the above axioms into the following unit equations and goals:
% 0.18/0.40
% 0.18/0.40 Axiom 1 (left_identity): product(identity, X, X) = true.
% 0.18/0.40 Axiom 2 (left_inverse): product(inverse(X), X, identity) = true.
% 0.18/0.40 Axiom 3 (associativity1): fresh10(X, X, Y, Z, W) = true.
% 0.18/0.40 Axiom 4 (associativity2): fresh8(X, X, Y, Z, W) = true.
% 0.18/0.40 Axiom 5 (associativity1): fresh6(X, X, Y, Z, W, V, U) = product(Y, V, U).
% 0.18/0.40 Axiom 6 (associativity2): fresh5(X, X, Y, Z, W, V, U) = product(W, V, U).
% 0.18/0.40 Axiom 7 (associativity1): fresh9(X, X, Y, Z, W, V, U, T) = fresh10(product(Y, Z, W), true, Y, U, T).
% 0.18/0.40 Axiom 8 (associativity2): fresh7(X, X, Y, Z, W, V, U, T) = fresh8(product(Y, Z, W), true, W, V, T).
% 0.18/0.40 Axiom 9 (associativity1): fresh9(product(X, Y, Z), true, W, V, X, Y, U, Z) = fresh6(product(V, Y, U), true, W, V, X, U, Z).
% 0.18/0.40 Axiom 10 (associativity2): fresh7(product(X, Y, Z), true, W, X, V, Y, Z, U) = fresh5(product(W, Z, U), true, W, X, V, Y, U).
% 0.18/0.40
% 0.18/0.40 Goal 1 (prove_right_inverse): product(a, inverse(a), identity) = true.
% 0.18/0.40 Proof:
% 0.18/0.40 product(a, inverse(a), identity)
% 0.18/0.40 = { by axiom 6 (associativity2) R->L }
% 0.18/0.40 fresh5(true, true, inverse(inverse(a)), identity, a, inverse(a), identity)
% 0.18/0.40 = { by axiom 2 (left_inverse) R->L }
% 0.18/0.40 fresh5(product(inverse(inverse(a)), inverse(a), identity), true, inverse(inverse(a)), identity, a, inverse(a), identity)
% 0.18/0.40 = { by axiom 10 (associativity2) R->L }
% 0.18/0.40 fresh7(product(identity, inverse(a), inverse(a)), true, inverse(inverse(a)), identity, a, inverse(a), inverse(a), identity)
% 0.18/0.40 = { by axiom 1 (left_identity) }
% 0.18/0.40 fresh7(true, true, inverse(inverse(a)), identity, a, inverse(a), inverse(a), identity)
% 0.18/0.40 = { by axiom 8 (associativity2) }
% 0.18/0.41 fresh8(product(inverse(inverse(a)), identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 5 (associativity1) R->L }
% 0.18/0.41 fresh8(fresh6(true, true, inverse(inverse(a)), inverse(a), identity, identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 2 (left_inverse) R->L }
% 0.18/0.41 fresh8(fresh6(product(inverse(a), a, identity), true, inverse(inverse(a)), inverse(a), identity, identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 9 (associativity1) R->L }
% 0.18/0.41 fresh8(fresh9(product(identity, a, a), true, inverse(inverse(a)), inverse(a), identity, a, identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 1 (left_identity) }
% 0.18/0.41 fresh8(fresh9(true, true, inverse(inverse(a)), inverse(a), identity, a, identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 7 (associativity1) }
% 0.18/0.41 fresh8(fresh10(product(inverse(inverse(a)), inverse(a), identity), true, inverse(inverse(a)), identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 2 (left_inverse) }
% 0.18/0.41 fresh8(fresh10(true, true, inverse(inverse(a)), identity, a), true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 3 (associativity1) }
% 0.18/0.41 fresh8(true, true, a, inverse(a), identity)
% 0.18/0.41 = { by axiom 4 (associativity2) }
% 0.18/0.41 true
% 0.18/0.41 % SZS output end Proof
% 0.18/0.41
% 0.18/0.41 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------