TSTP Solution File: SWV200+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV200+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 : n028.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:58 EDT 2023
% Result : Theorem 3.44s 0.82s
% Output : Proof 3.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV200+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/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.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 09:45:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.44/0.82 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 3.44/0.82
% 3.44/0.82 % SZS status Theorem
% 3.44/0.82
% 3.44/0.83 % SZS output start Proof
% 3.44/0.83 Take the following subset of the input axioms:
% 3.87/0.84 fof(quaternion_ds1_inuse_0011, conjecture, (a_select2(rho_defuse, n0)=use & (a_select2(rho_defuse, n1)=use & (a_select2(rho_defuse, n2)=use & (a_select2(sigma_defuse, n0)=use & (a_select2(sigma_defuse, n1)=use & (a_select2(sigma_defuse, n2)=use & (a_select2(sigma_defuse, n3)=use & (a_select2(sigma_defuse, n4)=use & (a_select2(sigma_defuse, n5)=use & (a_select3(u_defuse, n0, n0)=use & (a_select3(u_defuse, n1, n0)=use & (a_select3(u_defuse, n2, n0)=use & (a_select2(xinit_defuse, n3)=use & (a_select2(xinit_defuse, n4)=use & (a_select2(xinit_defuse, n5)=use & (a_select2(xinit_mean_defuse, n0)=use & (a_select2(xinit_mean_defuse, n1)=use & (a_select2(xinit_mean_defuse, n2)=use & (a_select2(xinit_mean_defuse, n3)=use & (a_select2(xinit_mean_defuse, n4)=use & (a_select2(xinit_mean_defuse, n5)=use & (a_select2(xinit_noise_defuse, n0)=use & (a_select2(xinit_noise_defuse, n1)=use & (a_select2(xinit_noise_defuse, n2)=use & (a_select2(xinit_noise_defuse, n3)=use & (a_select2(xinit_noise_defuse, n4)=use & (a_select2(xinit_noise_defuse, n5)=use & (leq(n0, pv5) & (leq(pv5, n998) & (gt(pv5, n0) & (![B, A2]: ((leq(n0, A2) & (leq(n0, B) & (leq(A2, n2) & leq(B, pred(pv5))))) => a_select3(u_defuse, A2, B)=use) & ![C, D]: ((leq(n0, C) & (leq(n0, D) & (leq(C, n2) & leq(D, pred(pv5))))) => a_select3(z_defuse, C, D)=use)))))))))))))))))))))))))))))))) => ![E, F]: ((leq(n0, E) & (leq(n0, F) & (leq(E, n2) & leq(F, pred(pv5))))) => ((~(n0=E & pv5=F) & (~(n1=E & pv5=F) & ~(n2=E & pv5=F))) => a_select3(u_defuse, E, F)=use))).
% 3.87/0.84
% 3.87/0.84 Now clausify the problem and encode Horn clauses using encoding 3 of
% 3.87/0.84 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 3.87/0.84 We repeatedly replace C & s=t => u=v by the two clauses:
% 3.87/0.84 fresh(y, y, x1...xn) = u
% 3.87/0.84 C => fresh(s, t, x1...xn) = v
% 3.87/0.84 where fresh is a fresh function symbol and x1..xn are the free
% 3.87/0.84 variables of u and v.
% 3.87/0.84 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 3.87/0.84 input problem has no model of domain size 1).
% 3.87/0.84
% 3.87/0.84 The encoding turns the above axioms into the following unit equations and goals:
% 3.87/0.84
% 3.87/0.84 Axiom 1 (quaternion_ds1_inuse_0011_29): leq(n0, f) = true3.
% 3.87/0.84 Axiom 2 (quaternion_ds1_inuse_0011_30): leq(n0, e) = true3.
% 3.87/0.84 Axiom 3 (quaternion_ds1_inuse_0011_33): leq(e, n2) = true3.
% 3.87/0.84 Axiom 4 (quaternion_ds1_inuse_0011_32): leq(f, pred(pv5)) = true3.
% 3.87/0.84 Axiom 5 (quaternion_ds1_inuse_0011_38): fresh48(X, X, Y, Z) = use.
% 3.87/0.84 Axiom 6 (quaternion_ds1_inuse_0011_38): fresh12(X, X, Y, Z) = a_select3(u_defuse, Y, Z).
% 3.87/0.84 Axiom 7 (quaternion_ds1_inuse_0011_38): fresh47(X, X, Y, Z) = fresh48(leq(Y, n2), true3, Y, Z).
% 3.87/0.84 Axiom 8 (quaternion_ds1_inuse_0011_38): fresh46(X, X, Y, Z) = fresh47(leq(n0, Y), true3, Y, Z).
% 3.87/0.84 Axiom 9 (quaternion_ds1_inuse_0011_38): fresh46(leq(n0, X), true3, Y, X) = fresh12(leq(X, pred(pv5)), true3, Y, X).
% 3.87/0.84
% 3.87/0.84 Goal 1 (quaternion_ds1_inuse_0011_35): a_select3(u_defuse, e, f) = use.
% 3.87/0.84 Proof:
% 3.87/0.84 a_select3(u_defuse, e, f)
% 3.87/0.84 = { by axiom 6 (quaternion_ds1_inuse_0011_38) R->L }
% 3.87/0.84 fresh12(true3, true3, e, f)
% 3.87/0.84 = { by axiom 4 (quaternion_ds1_inuse_0011_32) R->L }
% 3.87/0.84 fresh12(leq(f, pred(pv5)), true3, e, f)
% 3.87/0.84 = { by axiom 9 (quaternion_ds1_inuse_0011_38) R->L }
% 3.87/0.84 fresh46(leq(n0, f), true3, e, f)
% 3.87/0.84 = { by axiom 1 (quaternion_ds1_inuse_0011_29) }
% 3.87/0.84 fresh46(true3, true3, e, f)
% 3.87/0.84 = { by axiom 8 (quaternion_ds1_inuse_0011_38) }
% 3.87/0.84 fresh47(leq(n0, e), true3, e, f)
% 3.87/0.84 = { by axiom 2 (quaternion_ds1_inuse_0011_30) }
% 3.87/0.84 fresh47(true3, true3, e, f)
% 3.87/0.84 = { by axiom 7 (quaternion_ds1_inuse_0011_38) }
% 3.87/0.84 fresh48(leq(e, n2), true3, e, f)
% 3.87/0.84 = { by axiom 3 (quaternion_ds1_inuse_0011_33) }
% 3.87/0.84 fresh48(true3, true3, e, f)
% 3.87/0.84 = { by axiom 5 (quaternion_ds1_inuse_0011_38) }
% 3.87/0.84 use
% 3.87/0.84 % SZS output end Proof
% 3.87/0.84
% 3.87/0.84 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------