TSTP Solution File: SYN088-1.010 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SYN088-1.010 : 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 : n008.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 : Fri Sep 1 03:33:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.45s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN088-1.010 : TPTP v8.1.2. Released v1.0.0.
% 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.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 21:48:33 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.45 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.20/0.45
% 0.20/0.45 % SZS status Unsatisfiable
% 0.20/0.45
% 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(s4_1, axiom, ![X_1, X_2, X_3, X_4, X_5, X_6, X_7, X_8, X_9, X_10]: (p(X_1, X_2, X_3, X_4, X_5, X_6, X_7, X_8, X_9, X_10) | (~q_1(X_1) | (~q_2(X_2) | (~q_3(X_3) | (~q_4(X_4) | (~q_5(X_5) | (~q_6(X_6) | (~q_7(X_7) | (~q_8(X_8) | (~q_9(X_9) | ~q_10(X_10)))))))))))).
% 0.20/0.47 fof(s4_10, axiom, q_5(a)).
% 0.20/0.47 fof(s4_12, axiom, q_6(a)).
% 0.20/0.47 fof(s4_14, axiom, q_7(a)).
% 0.20/0.47 fof(s4_16, axiom, q_8(a)).
% 0.20/0.47 fof(s4_18, axiom, q_9(a)).
% 0.20/0.47 fof(s4_2, axiom, q_1(a)).
% 0.20/0.47 fof(s4_20, axiom, q_10(a)).
% 0.20/0.47 fof(s4_4, axiom, q_2(a)).
% 0.20/0.47 fof(s4_6, axiom, q_3(a)).
% 0.20/0.47 fof(s4_8, axiom, q_4(a)).
% 0.20/0.47 fof(s4_goal_1, negated_conjecture, ~p(a, a, a, a, a, a, a, a, a, a)).
% 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 (s4_2): q_1(a) = true.
% 0.20/0.47 Axiom 2 (s4_4): q_2(a) = true.
% 0.20/0.47 Axiom 3 (s4_6): q_3(a) = true.
% 0.20/0.47 Axiom 4 (s4_8): q_4(a) = true.
% 0.20/0.47 Axiom 5 (s4_10): q_5(a) = true.
% 0.20/0.47 Axiom 6 (s4_12): q_6(a) = true.
% 0.20/0.47 Axiom 7 (s4_14): q_7(a) = true.
% 0.20/0.47 Axiom 8 (s4_16): q_8(a) = true.
% 0.20/0.47 Axiom 9 (s4_18): q_9(a) = true.
% 0.20/0.47 Axiom 10 (s4_20): q_10(a) = true.
% 0.20/0.47 Axiom 11 (s4_1): fresh10(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = true.
% 0.20/0.47 Axiom 12 (s4_1): fresh8(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = p(Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 13 (s4_1): fresh9(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh10(q_1(Y), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 14 (s4_1): fresh6(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh9(q_3(W), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 15 (s4_1): fresh7(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh8(q_2(Z), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 16 (s4_1): fresh5(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh7(q_4(V), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 17 (s4_1): fresh4(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh6(q_5(U), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 18 (s4_1): fresh3(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh5(q_6(T), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 19 (s4_1): fresh2(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh4(q_7(S), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 20 (s4_1): fresh(X, X, Y, Z, W, V, U, T, S, X2, Y2, Z2) = fresh3(q_8(X2), true, Y, Z, W, V, U, T, S, X2, Y2, Z2).
% 0.20/0.47 Axiom 21 (s4_1): fresh(q_10(X), true, Y, Z, W, V, U, T, S, X2, Y2, X) = fresh2(q_9(Y2), true, Y, Z, W, V, U, T, S, X2, Y2, X).
% 0.20/0.47
% 0.20/0.47 Goal 1 (s4_goal_1): p(a, a, a, a, a, a, a, a, a, a) = true.
% 0.20/0.47 Proof:
% 0.20/0.47 p(a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 12 (s4_1) R->L }
% 0.20/0.47 fresh8(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 2 (s4_4) R->L }
% 0.20/0.47 fresh8(q_2(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 15 (s4_1) R->L }
% 0.20/0.47 fresh7(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 4 (s4_8) R->L }
% 0.20/0.47 fresh7(q_4(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 16 (s4_1) R->L }
% 0.20/0.47 fresh5(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 6 (s4_12) R->L }
% 0.20/0.47 fresh5(q_6(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 18 (s4_1) R->L }
% 0.20/0.47 fresh3(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 8 (s4_16) R->L }
% 0.20/0.47 fresh3(q_8(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 20 (s4_1) R->L }
% 0.20/0.47 fresh(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 10 (s4_20) R->L }
% 0.20/0.47 fresh(q_10(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 21 (s4_1) }
% 0.20/0.47 fresh2(q_9(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 9 (s4_18) }
% 0.20/0.47 fresh2(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 19 (s4_1) }
% 0.20/0.47 fresh4(q_7(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 7 (s4_14) }
% 0.20/0.47 fresh4(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 17 (s4_1) }
% 0.20/0.47 fresh6(q_5(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 5 (s4_10) }
% 0.20/0.47 fresh6(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 14 (s4_1) }
% 0.20/0.47 fresh9(q_3(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 3 (s4_6) }
% 0.20/0.47 fresh9(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 13 (s4_1) }
% 0.20/0.47 fresh10(q_1(a), true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 1 (s4_2) }
% 0.20/0.47 fresh10(true, true, a, a, a, a, a, a, a, a, a, a)
% 0.20/0.47 = { by axiom 11 (s4_1) }
% 0.20/0.47 true
% 0.20/0.47 % SZS output end Proof
% 0.20/0.47
% 0.20/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------