TSTP Solution File: SWV152+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV152+1 : TPTP v8.1.2. Bugfixed v3.3.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 : n021.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 23:02:46 EDT 2023
% Result : Theorem 1.34s 0.60s
% Output : Proof 1.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV152+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.08/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 10:43:44 EDT 2023
% 0.14/0.36 % CPUTime :
% 1.34/0.60 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 1.34/0.60
% 1.34/0.60 % SZS status Theorem
% 1.34/0.60
% 1.34/0.60 % SZS output start Proof
% 1.34/0.60 Take the following subset of the input axioms:
% 1.34/0.60 fof(cl5_nebula_norm_0002, conjecture, ![A]: ((leq(n0, A) & leq(A, tptp_minus_1)) => sum(n0, n4, a_select3(q, A, tptp_sum_index))=n1)).
% 1.34/0.60 fof(finite_domain_0, axiom, ![X]: ((leq(n0, X) & leq(X, n0)) => X=n0)).
% 1.34/0.60 fof(irreflexivity_gt, axiom, ![X2]: ~gt(X2, X2)).
% 1.34/0.60 fof(leq_succ, axiom, ![Y, X2]: (leq(X2, Y) => leq(X2, succ(Y)))).
% 1.34/0.60 fof(leq_succ_gt_equiv, axiom, ![X2, Y2]: (leq(X2, Y2) <=> gt(succ(Y2), X2))).
% 1.34/0.60 fof(matrix_symm_joseph_update, axiom, ![C, N, B, M, D, E, F, A2]: ((![I, J]: ((leq(n0, I) & (leq(I, M) & (leq(n0, J) & leq(J, M)))) => a_select3(D, I, J)=a_select3(D, J, I)) & (![I2, J2]: ((leq(n0, I2) & (leq(I2, N) & (leq(n0, J2) & leq(J2, N)))) => a_select3(A2, I2, J2)=a_select3(A2, J2, I2)) & ![I2, J2]: ((leq(n0, I2) & (leq(I2, N) & (leq(n0, J2) & leq(J2, N)))) => a_select3(F, I2, J2)=a_select3(F, J2, I2)))) => ![I2, J2]: ((leq(n0, I2) & (leq(I2, N) & (leq(n0, J2) & leq(J2, N)))) => a_select3(tptp_madd(A2, tptp_mmul(B, tptp_mmul(tptp_madd(tptp_mmul(C, tptp_mmul(D, trans(C))), tptp_mmul(E, tptp_mmul(F, trans(E)))), trans(B)))), I2, J2)=a_select3(tptp_madd(A2, tptp_mmul(B, tptp_mmul(tptp_madd(tptp_mmul(C, tptp_mmul(D, trans(C))), tptp_mmul(E, tptp_mmul(F, trans(E)))), trans(B)))), J2, I2)))).
% 1.34/0.60 fof(succ_tptp_minus_1, axiom, succ(tptp_minus_1)=n0).
% 1.34/0.60
% 1.34/0.60 Now clausify the problem and encode Horn clauses using encoding 3 of
% 1.34/0.60 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 1.34/0.60 We repeatedly replace C & s=t => u=v by the two clauses:
% 1.34/0.60 fresh(y, y, x1...xn) = u
% 1.34/0.60 C => fresh(s, t, x1...xn) = v
% 1.34/0.60 where fresh is a fresh function symbol and x1..xn are the free
% 1.34/0.60 variables of u and v.
% 1.34/0.60 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 1.34/0.60 input problem has no model of domain size 1).
% 1.34/0.60
% 1.34/0.60 The encoding turns the above axioms into the following unit equations and goals:
% 1.34/0.60
% 1.34/0.60 Axiom 1 (succ_tptp_minus_1): succ(tptp_minus_1) = n0.
% 1.34/0.60 Axiom 2 (cl5_nebula_norm_0002): leq(n0, a) = true3.
% 1.34/0.60 Axiom 3 (cl5_nebula_norm_0002_1): leq(a, tptp_minus_1) = true3.
% 1.34/0.60 Axiom 4 (finite_domain_0): fresh(X, X, Y) = Y.
% 1.34/0.60 Axiom 5 (finite_domain_0): fresh39(X, X, Y) = n0.
% 1.34/0.60 Axiom 6 (leq_succ): fresh32(X, X, Y, Z) = true3.
% 1.34/0.60 Axiom 7 (leq_succ_gt_equiv_1): fresh29(X, X, Y, Z) = true3.
% 1.34/0.60 Axiom 8 (finite_domain_0): fresh(leq(n0, X), true3, X) = fresh39(leq(X, n0), true3, X).
% 1.34/0.60 Axiom 9 (leq_succ): fresh32(leq(X, Y), true3, X, Y) = leq(X, succ(Y)).
% 1.34/0.60 Axiom 10 (leq_succ_gt_equiv_1): fresh29(leq(X, Y), true3, X, Y) = gt(succ(Y), X).
% 1.34/0.60
% 1.34/0.60 Goal 1 (irreflexivity_gt): gt(X, X) = true3.
% 1.34/0.60 The goal is true when:
% 1.34/0.60 X = n0
% 1.34/0.60
% 1.34/0.60 Proof:
% 1.34/0.60 gt(n0, n0)
% 1.34/0.60 = { by axiom 5 (finite_domain_0) R->L }
% 1.34/0.60 gt(n0, fresh39(true3, true3, a))
% 1.34/0.60 = { by axiom 6 (leq_succ) R->L }
% 1.34/0.60 gt(n0, fresh39(fresh32(true3, true3, a, tptp_minus_1), true3, a))
% 1.34/0.60 = { by axiom 3 (cl5_nebula_norm_0002_1) R->L }
% 1.34/0.60 gt(n0, fresh39(fresh32(leq(a, tptp_minus_1), true3, a, tptp_minus_1), true3, a))
% 1.34/0.60 = { by axiom 9 (leq_succ) }
% 1.34/0.60 gt(n0, fresh39(leq(a, succ(tptp_minus_1)), true3, a))
% 1.34/0.60 = { by axiom 1 (succ_tptp_minus_1) }
% 1.34/0.60 gt(n0, fresh39(leq(a, n0), true3, a))
% 1.34/0.60 = { by axiom 8 (finite_domain_0) R->L }
% 1.34/0.60 gt(n0, fresh(leq(n0, a), true3, a))
% 1.34/0.60 = { by axiom 2 (cl5_nebula_norm_0002) }
% 1.34/0.60 gt(n0, fresh(true3, true3, a))
% 1.34/0.60 = { by axiom 4 (finite_domain_0) }
% 1.34/0.60 gt(n0, a)
% 1.34/0.60 = { by axiom 1 (succ_tptp_minus_1) R->L }
% 1.34/0.60 gt(succ(tptp_minus_1), a)
% 1.34/0.60 = { by axiom 10 (leq_succ_gt_equiv_1) R->L }
% 1.34/0.60 fresh29(leq(a, tptp_minus_1), true3, a, tptp_minus_1)
% 1.34/0.60 = { by axiom 3 (cl5_nebula_norm_0002_1) }
% 1.34/0.60 fresh29(true3, true3, a, tptp_minus_1)
% 1.34/0.60 = { by axiom 7 (leq_succ_gt_equiv_1) }
% 1.34/0.60 true3
% 1.34/0.60 % SZS output end Proof
% 1.34/0.60
% 1.34/0.60 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------